Next Article in Journal
Deterministic Authenticated Encryption Scheme for Memory Constrained Devices
Previous Article in Journal
Forward-Secure Linkable Ring Signatures from Bilinear Maps
Article Menu

Export Article

Open AccessArticle
Cryptography 2018, 2(4), 36; https://doi.org/10.3390/cryptography2040036

An Attack Bound for Small Multiplicative Inverse of φ(N) mod e with a Composed Prime Sum p + q Using Sublattice Based Techniques

Department of Mathematics, Andhra University, Visakhapatnam, Andhra Pradesh 530003, India
*
Author to whom correspondence should be addressed.
Received: 18 July 2018 / Revised: 1 November 2018 / Accepted: 11 November 2018 / Published: 22 November 2018
Full-Text   |   PDF [388 KB, uploaded 28 November 2018]   |  

Abstract

In this paper, we gave an attack on RSA (Rivest–Shamir–Adleman) Cryptosystem when φ ( N ) has small multiplicative inverse modulo e and the prime sum p + q is of the form p + q = 2 n k 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. Employing the previous tools, we provide a new attack bound for the deciphering exponent when the prime sum p + q = 2 n k 0 + k 1 and performed an analysis with Boneh and Durfee’s deciphering exponent bound for appropriately small k 0 and k 1 . View Full-Text
Keywords: RSA; Cryptanalysis; lattices; LLL (Lenstra–Lenstra–Lovász) algorithm; Coppersmith’s method RSA; Cryptanalysis; lattices; LLL (Lenstra–Lenstra–Lovász) algorithm; Coppersmith’s method
Figures

Figure 1

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 (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

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.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Cryptography EISSN 2410-387X Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top