Barack Obama
Reputation
511
Top tag
Next privilege 750 Rep.
See vote count; VIP usercard
 Jan11 awarded Yearling Nov1 revised Security of RSA with $\gcd(pq, (p-1)(q-1))\ne 1$ corrected equation Nov1 suggested approved edit on Security of RSA with $\gcd(pq, (p-1)(q-1))\ne 1$ Nov1 answered CRC32 vs. low 32 bits of cryptographic hash Oct23 revised Operation which needs much computing power to be created, but just a little to be solved? added 443 characters in body Oct23 answered Operation which needs much computing power to be created, but just a little to be solved? Sep30 awarded Explainer Sep23 answered Key management for military GPS receivers Sep21 awarded Enlightened Sep21 awarded Nice Answer Sep17 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/… Sep17 awarded Organizer Sep17 revised Pollard's Rho - Constructing the random function Tags fit article better. Sep16 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. Sep16 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. Sep16 suggested approved edit on Pollard's Rho - Constructing the random function Sep16 comment Pollard's Rho - Constructing the random function Please add some references to the "extensive articles" so I can check them out. Sep16 answered Pollard's Rho - Constructing the random function Jan11 awarded Yearling Oct6 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.