4 search results - page 1 / 1 » Factoring Unbalanced Moduli with Known Bits |
ICISC
2009
13 years 2 months ago
2009
CHES
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. Efficient implementations of RSA on computationally limited devices, such as smartcards, often use the CRT technique in combination with Garner’s algorithm in order to ...
CRYPTO
2007
Springer
13 years 11 months ago
2007
Springer
Coppersmith described at Eurocrypt 96 an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction. A simpler algorithm was later pro...
FCCM
2005
IEEE
13 years 10 months ago
2005
IEEE
The security of the most popular asymmetric cryptographic scheme RSA depends on the hardness of factoring large numbers. The best known method for factorization large integers is ...