Faith
Reputation
Top tag
Next privilege 125 Rep.
Vote down
Badges
4
Newest
Impact
~5k people reached

• 0 posts edited
• 0 helpful flags
• 0 votes cast

# 21 Actions

 Jan14 awarded Popular Question Jul2 awarded Curious Aug24 asked Quadratic residue problem on composite integers Aug22 comment RSA random prime generator Thanks. Is there a specific pseudo-random number generator that cryptographic community believe to best fit for RSA or any other cryptosystems? Aug21 asked RSA random prime generator Aug18 comment Relationship between Elliptic Curve Discrete Log, Integer Discrete Log, and Integer Factorization Thanks a lot, I tried to find a paper or sort of notes on such mapping between GF(p^k) and GF(p), but could not find any. Could you provide me with a reference. Aug17 asked Relationship between Elliptic Curve Discrete Log, Integer Discrete Log, and Integer Factorization Aug9 asked why AKS is so slow in practice? Aug5 asked Discrete log problem with modulus prime Aug3 asked Why Elliptic curve cryptography are not popular in practice Jul23 asked Reduction of Integer factorization to Discrete logarithm problem Jul21 comment Quadratic residuosity problem reduction to integer factorization How would Chinese reminder theorem will computer the quadratic root of the full modulus given the solutions of mod p and mod q? Jul21 comment Quadratic residuosity problem reduction to integer factorization So, solving the quadratic residuosity problem for a prime modulus is easy. It is hard when the mod is a composite number n = p x q. Finding the factors, solving the problem for independently for each factor p and q yields a solution to the problem mod n. Please correct me if I am wrong. Jul20 awarded Custodian Jul20 reviewed Approve Quadratic residuosity problem reduction to integer factorization Jul20 asked Quadratic residuosity problem reduction to integer factorization Jul16 awarded Student Jul15 comment Primality testing (deterministic vs. non-deterministic) Thanks Maeher and Thomas, could you please clarify the answer in a bit more details? Thanks Jul15 asked Primality testing (deterministic vs. non-deterministic) Jul2 comment can permutation matrix be found in parallel processing technique? Let us think of this as a condition statement and need to find some permuation matrix M. Regardless of how it is determined, is it possible to split the permutation generator so that each process work on portion of the all permutation possibilities? For example, searching for RSA modulo factor, one can take 10 processes so that each searches an interval. Thanks