Simplification of the Lattice Based Attack of Boneh and Durfee for RSA Cryptoanalysis

Yoshinori Aono ()
Additional contact information
Yoshinori Aono: NICT

A chapter in Computer Mathematics, 2014, pp 15-32 from Springer

Abstract: Abstract We present a new formulation and its simpler analysis of the lattice-based attack of Boneh and Durfee for the RSA cryptography [1]. We follow the same approach as theirs, however, we propose a new way of defining a lattice with which we can achieve the same solvable key bound $$d

Keywords: Lattice-based Attacks; Lower Triangle; Three-variable Polynomial; Lattice Reduction Algorithm; Canonical Replacement (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-662-43799-5_3

Ordering information: This item can be ordered from
http://www.springer.com/9783662437995

DOI: 10.1007/978-3-662-43799-5_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().