Contents
RSA 暗号で使われる素数組の生成に問題があった場合の脆弱性。
What is Fermat's factorization algorithm?
a product of two large primes can always be written as N=(a-b)(a+b) If the primes are close then a is close to the square root of N.
Contents
RSA 暗号で使われる素数組の生成に問題があった場合の脆弱性。
What is Fermat's factorization algorithm?
a product of two large primes can always be written as N=(a-b)(a+b) If the primes are close then a is close to the square root of N.
MoinQ: Security/RSA (last edited 2022-06-25 02:01:33 by ToshinoriMaeno)