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, Ger

First Page		Document Content
Date: 2015-08-28 10:30:32 Cryptography 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, Ger Add to Reading List Source URL: www.cits.rub.de Download Document from Source Website File Size: 335,81 KB Share Document on Facebook