Reputation
35,920
Next tag badge:
99/100 score
29/20 answers
Badges
1 30 74
Newest
 Taxonomist
Impact
~507k people reached

Nov
20
comment What is the difference between order of base point and curve order in EC?
@Mhsz: close; it turns out that finite Elliptic Curves need not be cyclic; for example, they can have $Z_2 \times Z_2$ as a subgroup; however that turns out to be cryptographically unimportant, and everything else you said is correct.
Nov
20
revised What is the difference between order of base point and curve order in EC?
Readded a link to a related question
Nov
20
reviewed Approve What is the difference between order of base point and curve order in EC?
Nov
20
answered What is the difference between order of base point and curve order in EC?
Nov
20
reviewed Reject What is the meaning of “trapdoor” in cryptography?
Nov
20
reviewed No Action Needed Is there a Javascript and Java implementation of a good CSPRNG
Nov
20
reviewed No Action Needed Proving correctness of a decryption of a homomorphically summed ciphertext?
Nov
20
reviewed Reviewed Availability of a simple limited PRNG algorithm
Nov
20
comment Availability of a simple limited PRNG algorithm
A PRNG is always repeatable given the same seed, whether or not it is cryptographic. What cryptographic means that if you don't know the seed, the output is indistinguishable from random (even if you are given the rest of the details of how the PRNG works)
Nov
19
reviewed Reviewed AES - Encrypting multiple blocks of files
Nov
19
revised AES - Encrypting multiple blocks of files
Removed apologies for the English; did English fix-ups
Nov
19
reviewed No Action Needed Where have all the cypherpunks gone?
Nov
18
comment Elliptic curve trapdoor function without modular arithmetic?
The other potential issue would be how real-based elliptic curves behave. If (say) the x-coordinate of $dG$ was approximately $c a^d$ for some values $c, d$, this would imply an efficient way to do logs (I almost wrote 'discrete logs'...)
Nov
18
awarded  Reviewer
Nov
18
comment Elliptic curve trapdoor function without modular arithmetic?
Real numbers don't work real well in crypto, because we typically hope to be able to express the values we use, and almost all real numbers cannot be expressed, even with an unbounded number of bits.
Nov
18
reviewed No Action Needed CP-ABE: structure of the secret key SK
Nov
18
reviewed Reviewed RSA Proof of Correctness
Nov
18
comment proving the security of 1 out of 2 oblivious transfer using AND function
Is the question on how to do OT using an AND function, or is it how to construct an AND function using OT? Your second paragraph says the latter; your first paragraph (and the title) says the former (and, BTW: both are possible; constructing AND out of OT is a lot more straight-forward).
Nov
18
comment Malicious DH groups
I can give one partial negative answer: we can show that the values of $g$ of the same order are equivalent, as far as the DLOG and cDH problems; if you can solve either the DLOG or the cDH problems with respect to one $g$, you can solve it for any other $g$ of the same order (with at most a polynomial number of queries). Hence, if there is a way to find a malicious group, the magic is in selecting $p$ and $q$.
Nov
17
reviewed No Action Needed what does rsaSha512Sign do?