5,455 reputation
11123
bio website people.scs.carleton.ca/~clark
location Ottawa, Canada
age 33
visits member for 3 years, 3 months
seen Jan 5 at 22:55

Postdoctoral fellow interested in authentication and cryptographic voting.


Aug
16
revised Verify product without revealing multipliers
added 360 characters in body
Aug
16
answered Verify product without revealing multipliers
Aug
15
comment Where can I find useful data for cryptography/coding theory?
The fun part is getting Wolfram Alpha to generate a safe prime, short of running this query over and over again: {#,PrimeQ[#]}&/@{(RandomPrime[{2^1023,2^1024}]-1)/2}
Aug
15
revised Where can I find useful data for cryptography/coding theory?
added 72 characters in body
Aug
15
revised Where can I find useful data for cryptography/coding theory?
added 116 characters in body
Aug
15
answered Where can I find useful data for cryptography/coding theory?
Aug
12
answered Applications of Group Ciphers
Aug
4
awarded  Scholar
Aug
4
accepted Mapping points between elliptic curves and the integers
Aug
4
comment Mapping points between elliptic curves and the integers
Thanks! This is useful. Hopefully accepting this answer won't discourage other answers for other types of curves (e.g. ones that are not supersingular—Telex for example relies on DDH.)
Aug
3
awarded  Student
Aug
3
revised Mapping points between elliptic curves and the integers
added 2 characters in body
Aug
3
asked Mapping points between elliptic curves and the integers
Aug
2
awarded  Beta
Jul
29
answered Guarding against cryptanalytic breakthroughs: combining multiple hash functions
Jul
28
answered Hermitian curves introductory references
Jul
21
awarded  Commentator
Jul
21
comment Are any of the major asymmetric ciphers distinguishable (EG, RSA, ECC)?
For a fixed plaintext and key pair, we can consider three sets: (1) invalid ciphertexts: numbers/bitstrings that are of the wrong form, (2) plausible ciphertexts: numbers of the right form but do not necessarily decrypt to the plaintext, (3) actual ciphertext(s): the set of ciphertexts that actually decrypt to the plaintext with the key. What I am addressing in my answer is your ability to tell (2) and (3) apart and what I omitted, which may clarify, is telling them apart without the secret key using today's level of computational ability. They can be distinguished with unlimited computation.
Jul
20
revised
added 108 characters in body
Jul
20
revised
added 430 characters in body