469 reputation
26
bio website
location
age
visits member for 1 year, 9 months
seen 12 hours ago

Sep
30
awarded  Explainer
Sep
23
answered Key management for military GPS receivers
Sep
21
awarded  Enlightened
Sep
21
awarded  Nice Answer
Sep
17
comment Finding algorithm: desire RSA's uniqueness and ECDSA's space efficiency
ECDSA signatures can be made to enjoy the uniqueness property you require. See crypto.stackexchange.com/questions/851/…
Sep
17
awarded  Organizer
Sep
17
revised Pollard's Rho - Constructing the random function
Tags fit article better.
Sep
16
comment How secure is this use of Ziv-Lempel encoding?
Distinguishing two strings seems trivial for an adversary. If the encodings are the same then they are the same and if different then different. Also the "sort prefix" enables one to work out the orderings of the encoded values. If some corresponding decoded values are known then bounds can be put on the unknown decoded strings. So then one can guess the input values. This seems obvious enough from a cursory reading of the patent and seems to answer the question.
Sep
16
comment Scalar multiplication of elliptic curve point by a fraction
@user3768186 $P$ is just an implementation detail. It's not a relevant group property for this purpose. If you had two elliptic curves with the same order but different $P$ you would divide points by a fixed number on the different curves by multiplying by the same number.
Sep
16
suggested suggested edit on Pollard's Rho - Constructing the random function
Sep
16
comment Pollard's Rho - Constructing the random function
Please add some references to the "extensive articles" so I can check them out.
Sep
16
answered Pollard's Rho - Constructing the random function
Jan
11
awarded  Yearling
Oct
6
comment Reversing N CRC steps
I understand. Thanks. K.G can be justifiably proud of his answer. I would caution that I have encountered functions used as CRCs in some applications which do not behave exactly K.G describes.
Oct
6
revised Curve parameter for hyperelliptic curve cryptography?
deleted 5 characters in body
Oct
6
answered Reversing N CRC steps
Oct
6
answered Curve parameter for hyperelliptic curve cryptography?
Sep
3
comment Elliptic Curve Cryptography Encryption Results
I misspoke about ECIES. But jecc (which looks quite poor) sends one side of a ECDH key agreement and then appends the plaintext xor'ed with the hash of the shared key. This is a ElGamal encryption. See jecc.cvs.sourceforge.net/viewvc/jecc/jecc/elliptic/… It looks like it'll fall over if you encrypt more bytes than the length of their hash function outputs.
Sep
3
comment Elliptic Curve Cryptography Encryption Results
This is all rubbish. RSA does not involve any randomness but is not "trivially breakable". Secondly,the ciphertext in RSA can be the same length as the plain text. Thirdly ECIES results in longer ciphertexts without any symmetric usage. For shame whoever marked this as +1!
Aug
31
revised How can I take advantage of repeated patterns in non random RSA prime factors?
added quote