Efficient factoring based on partial information

Abuses in cryptography and how to fight them

CRYPTO '88 Proceedings on Advances in cryptology

The discrete log is very discreet

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing

The Bit Security of Modular Squaring Given Partial Factorization of the Modulos

CRYPTO '85 Advances in Cryptology

Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits

ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology

Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint

Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09

Finding a small root of a bivariate integer equation; factoring with high bits known

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques

Factoring with an oracle

EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques

Application of bio-inspired algorithm to the problem of integer factorisation

International Journal of Bio-Inspired Computation

Correcting errors in RSA private keys

CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology

Factoring unbalanced moduli with known bits

ICISC'09 Proceedings of the 12th international conference on Information security and cryptology

Speeding up bipartite modular multiplication

WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields

Implicit factoring with shared most significant and middle bits

PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography

Factoring RSA modulus using prime reconstruction from random known bits

AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa

The leakage-resilience limit of a computational problem is equal to its unpredictability entropy

ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security

Generalized security analysis of the random key bits leakage attack

WISA'11 Proceedings of the 12th international conference on Information Security Applications