Solving simultaneous modular equations of low degree
SIAM Journal on Computing - Special issue on cryptography
Handbook of theoretical computer science (vol. A)
Fast RSA-Type Cryptosystem Modulo pkq
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Finding Small Roots of Univariate Modular Equations Revisited
Proceedings of the 6th IMA International Conference on Cryptography and Coding
ESIGN: an efficient digital signature implementation for smart cards
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Design and Analysis of Fast Provably Secure Public-Key Cryptosystems Based on a Modular Squaring
ICISC '01 Proceedings of the 4th International Conference Seoul on Information Security and Cryptology
A Generalized Takagi-Cryptosystem with a modulus of the form prqs
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
Approximate Integer Common Divisors
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
The Two Faces of Lattices in Cryptology
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
On the Security of Cryptosystems with Quadratic Decryption: The Nicest Cryptanalysis
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Factoring pq2 with Quadratic Forms: Nice Cryptanalyses
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Factoring unbalanced moduli with known bits
ICISC'09 Proceedings of the 12th international conference on Information security and cryptology
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Speeding up bipartite modular multiplication
WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
Paillier's cryptosystem modulo p2q and its applications to trapdoor commitment schemes
Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
On the randomness of bits generated by sufficiently smooth functions
ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
Privately retrieve data from large databases
ISPEC'06 Proceedings of the Second international conference on Information Security Practice and Experience
A tool kit for finding small roots of bivariate polynomials over the integers
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Generalized security analysis of the random key bits leakage attack
WISA'11 Proceedings of the 12th international conference on Information Security Applications
| Hi-index | 0.00 |
We present an algorithm for factoring integers of the form N = prq for large r. Such integers were previously proposed for various cryptographic applications. When r ≅ log p our algorithm runs in polynomial time (in log N). Hence, we obtain a new class of integers that can be efficiently factored. When r ≅ log p the algorithm is asymptotically faster than the Elliptic Curve Method. Our results suggest that integers of the form N = prq should be used with care. This is especially true when r is large, namely r greater than √log p.