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

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?
Nov
16
comment Checking both Quadratic residuosity and Jacobi symbol simultaneously and efficiently
Yes, our answers are pretty close; we both provide ways to do it, given a little bit of help from the key generator. With you, the help is an example value of $s$; with mine, it's asking him to ensure $p \equiv q \equiv 3 \bmod 4$ (and with that, we can find a value of $s$ ourselves)
Nov
16
reviewed No Action Needed Why is Poly1305 popular given its 'sudden death' properties?
Nov
16
reviewed No Action Needed Why sorting is needed for Meet-in-the-middle attack
Nov
16
reviewed No Action Needed Secure symmetric encryption algorithm for any-size base62 data
Nov
16
reviewed No Action Needed Decrypting A Cipher Text without knowing the key or plaintext
Nov
16
reviewed No Action Needed Block cipher to encrypt 8 bytes/64 bits - Use 64 or 128 bit cipher?
Nov
16
reviewed No Action Needed fully homomorphic encryption (FHE)
Nov
16
reviewed No Action Needed Block cipher to encrypt 8 bytes/64 bits - Use 64 or 128 bit cipher?
Nov
16
comment Why sorting is needed for Meet-in-the-middle attack
@IlmariKaronen: Minor note: we can do rather better than $O(n \log n)$ comparisons (!); the data we're sorting on is uniformly distributed, and for data like that, approaches such as radix sorting have better asymptotic complexity.
Nov
16
answered Checking both Quadratic residuosity and Jacobi symbol simultaneously and efficiently
Nov
15
comment Complexity to find an preimage of a hash function
Because they said $E_{m_i}()$ denoted the encryption of an ideal block cipher; block ciphers are, by definition, invertable. What MD hashes use in practice is $H_i = H_{i-1} \oplus E_{m_i}(H_{i-1})$; xoring in $H_{i-1}$ prevents invertibility
Nov
14
reviewed Looks OK Why we can't implement AES 512 key size?