Date: 2015-08-28 10:30:32Cryptography Integer factorization algorithms Computational hardness assumptions E-commerce RSA Quadratic sieve Lattice Integer factorization | | Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint ∗ Alexander May, Maike Ritzenhofen Horst Görtz Institute for IT-security Faculty of Mathematics Ruhr-University of Bochum, 44780 Bochum, GerAdd to Reading ListSource URL: www.cits.rub.deDownload Document from Source Website File Size: 335,81 KBShare Document on Facebook
|