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

30m
answered Length of prime number used in Pedersen Commitment
16h
comment Is chaotic encryption secure?
The proof of the pudding is in the eating, and the proof of the cryptosystem is in the cryptanalysis. Until I see a chaos-based system undergo cryptanalysis by someone who knows what they're doing, I don't see any reason to trust it.
21h
answered What does L_n is the bit length of the group order n states need for my calculation in ECDSA algorithm?
21h
answered Combining cascaded encryption keys into one key
1d
answered Is authentication length always a subset of encryption length?
1d
reviewed Leave Closed Is there any method to avoid the differential cryptanalysis?
1d
reviewed Leave Closed can you attack to this protocol?
1d
reviewed No Action Needed Vigenère, auto-correlation vs Kasiski examination
1d
reviewed No Action Needed Given a message and signature, find a public key that makes the signature valid (ECDSA)
1d
comment Key space vs Cardinality of 1024-bit RSA
Actually, the keyspace would be the set of prime pairs between $2^{511}$ and $2^{512}$. Actually, it's somewhat less, because we insist that the product be between $2^{1023}$ and $2^{1024}$. The set of prime pairs between $2^{511.5}$ and $2^{512}$ is one way to evaluate it.
1d
comment Key space vs Cardinality of 1024-bit RSA
Actually, for 1024-bit RSA, the primes generated will typically be 512 bits each...
1d
comment Are keys generated by the user or block cipher algorithms themselves?
How key generation is done is a very broad topic; there are lots of ways it can be done, and as far as the block cipher algorithm is concerned, it's done by someone else.
1d
reviewed Close Are keys generated by the user or block cipher algorithms themselves?
1d
reviewed Close Finding Vignere Cipher key
1d
reviewed Leave Open why are both ipad and opad required for HMAC?
1d
reviewed Leave Open Why is the call to RSA_generate_key_ex() failing sometimes?
1d
comment Why is the call to RSA_generate_key_ex() failing sometimes?
Why isn't "even exponents don't work" an adequate explination? Also, why is using a fixed exponent of 65537 considered a "workaround"? It's what a lot of real RSA implementations actually use.
2d
reviewed Delete Interpretation of the results of NIST (p)NRG suite
2d
reviewed No Action Needed How do I control an access code safely?
2d
reviewed No Action Needed EC based password authenticated key exchange protocol