## page was copied from DnsTemplate ##master-page:HelpTemplate <> <> Fermat Attack on RSA https://fermatattack.secvuln.info/ 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. }}} == history == {{{ }}} ---- CategoryDns CategoryWatch CategoryTemplate