Forging 1024-bit RSA signatures in nearly SNFS time
- RSA 近 90 天出现 3 次
- 上一次：同一天稍早 · There's a new way to break RSA that's faster than anything we've seen before
发生了什么
Alternate title: Nearly SNFS-Speed Signature Forgery Sans Factoring N (NSNFSSSFSFN) Abstract. The security of RSA is generally understood to be based on the complexity of factoring, and key size parameters are extrapolated from the general number field sieve (GNFS). However, this may not accurately represent RSA security in practical scenarios. An under-appreciated 2007 algorithm of Joux, Naccache, and Thom´e allows…
摘要按规则整理自下方来源原文