Reputation
37,555
Next tag badge:
99/100 score
25/20 answers
Badges
1 35 79
Impact
~551k people reached

Feb
6
comment Can you exchange a shared key without any hardness assumptions?
Does Quantum Key Distribution count?
Feb
5
reviewed No Action Needed compression with codebook and Cryptography
Feb
5
reviewed No Action Needed Sage Vs C++(with NTL) for implementing cryptosystems
Feb
5
reviewed No Action Needed Noisiest RF band for random number generation
Feb
4
reviewed Reviewed Difference between encrypting something and hashing something
Feb
4
reviewed No Action Needed Does using modulo (%) affect quality of randomness?
Feb
4
revised How fast would a polynomial time factoring algorithm compute?
edited tags
Feb
4
answered How fast would a polynomial time factoring algorithm compute?
Feb
3
comment Using Permutation polynomial to compute a MAC
@user13676: So, you compute $Mac_i$ only once (for a specific $i, k$ pair)? If so, why don't you use the simpler construction $a_i \cdot y_i + b_i \bmod p$, for secret $a_i, b_i$?
Feb
3
answered Using Permutation polynomial to compute a MAC
Feb
3
answered How do you derive the lambda and beta values for endomorphism on the secp256k1 curve?
Feb
3
reviewed Close What is the difference between a hash function and a pseudorandom function?
Feb
2
reviewed Close Kryptos K2 keyword derivation
Feb
2
reviewed Leave Closed Decrypt a message which is encrypted using XOR?
Feb
2
reviewed Leave Closed Decrypt a message which is encrypted using XOR?
Feb
2
comment Generation of a cyclic group of prime order
@MortenSalte: as long as we're talking about a subgroup of $Z_p^*$, any subgroup's order will be a (not necessarily proper) divisor of $p-1$. So, if you know the factorization of $p-1$, you can just check either $g^q \equiv 1$ for various factors $q$ of $p-1$.
Feb
1
answered Generation of a cyclic group of prime order
Jan
31
answered Do any stream ciphers with aperiodic keystreams exist?
Jan
31
answered Proof that $gcd(e, \lambda(N)) = 1 \hspace{1mm} \Longleftrightarrow \hspace{1mm} gcd(e, \varphi(N)) = 1$
Jan
31
revised One time pad probability
added 208 characters in body