Preprint Article Version 1 This version is not peer-reviewed

An Attack Bound for Small Multiplicative Inverse of Euler function of modulo "e" with a Composed Prime Sum p+q Using Sublattice Based Techniques

Version 1 : Received: 18 July 2018 / Approved: 20 July 2018 / Online: 20 July 2018 (11:07:00 CEST)

A peer-reviewed article of this Preprint also exists.

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. Cryptography 2018, 2, 36.

Journal reference: Cryptography 2018, 2, 36
DOI: 10.3390/cryptography2040036

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.

Subject Areas

RSA, Cryptanalysis, Lattices, LLL algorithm, Coppersmith’s method

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

Leave a public comment
Send a private comment to the author(s)
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.