Kameswari, P.A.; Jyotsna, L. An Attack Bound for Small Multiplicative Inverse of φ(N) mod e with a Composed Prime Sum p+q Using Sublattice Based Techniques. Cryptography2018, 2, 36.
Kameswari, P.A.; Jyotsna, L. An Attack Bound for Small Multiplicative Inverse of φ(N) mod e with a Composed Prime Sum p+q Using Sublattice Based Techniques. Cryptography 2018, 2, 36.
Kameswari, P.A.; Jyotsna, L. An Attack Bound for Small Multiplicative Inverse of φ(N) mod e with a Composed Prime Sum p+q Using Sublattice Based Techniques. Cryptography2018, 2, 36.
Kameswari, P.A.; Jyotsna, L. An Attack Bound for Small Multiplicative Inverse of φ(N) mod e with a Composed Prime Sum p+q Using Sublattice Based Techniques. Cryptography 2018, 2, 36.
Abstract
In this paper, we gave an attack on RSA when Euler function has small multiplicative inverse modulo "e" and the prime sum p+q is of the form p+q=2^nk_0+k_1 where n is a given positive integer and k_0 and k_1 are two suitably small unknown integers using sublattice reduction techniques and Coppersmith's methods for finding small roots of modular polynomial equations. When we compare this method with an approach using lattice based techniques, this procedure slightly improves the bound and reduces the lattice dimension.
Computer Science and Mathematics, Algebra and Number Theory
Copyright:
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
