General Bounds for Small Inverse Problems and Its Applications to Multi-Prime RSA-Reference-Cited by-同舟云学术

General Bounds for Small Inverse Problems and Its Applications to Multi-Prime RSA

Published:2017 Issue:1 Volume:E100.A Page:50-61
ISSN:0916-8508
Container-title:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
language:en
Short-container-title:IEICE Trans. Fundamentals

Author:

TAKAYASU Atsushi¹²,KUNIHIRO Noboru¹

Affiliation:

1. The University of Tokyo

2. National Institute of Industrial Science and Technology (AIST)

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Applied Mathematics,Electrical and Electronic Engineering,Computer Graphics and Computer-Aided Design,Signal Processing

Link

https://www.jstage.jst.go.jp/article/transfun/E100.A/1/E100.A_50/_pdf

Reference37 articles.

1. [1] Y. Aono, “A new lattice construction for partial key exposure attack for RSA,” Proc. PKC 2009, LNCS 5443, pp.34-53, Springer, 2009.

2. [2] Y. Aono, “Minkowski sum based lattice construction for multivariate simultaneous coppersmith's technique and applications to RSA,” Information Security and Privacy, Lecture Notes in Computer Science, vol.7959, pp.88-103, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013.

3. [3] Y. Aono, M. Agrawal, T. Satoh, and O. Watanabe, “On the optimality of lattices for the coppersmith technique,” Information Security and Privacy, Lecture Notes in Computer Science, vol.7372, pp.376-389, Springer Berlin Heidelberg, Berlin, Heidelberg, 2012.

4. [4] H.M. Bahig, A. Bhery, and D.I. Nassr, “Cryptanalysis of multi-prime RSA with small prime difference,” Information and Communications Security, Lecture Notes in Computer Science, vol.7618, pp.33-44, Springer Berlin Heidelberg, Berlin, Heidelberg, 2012.

5. [5] A. Bauer and A. Joux, “Toward a rigorous variation of coppersmith's algorithm on three variables,” Advances in Cryptology, EUROCRYPT 2007, Lecture Notes in Computer Science, vol.4515, pp.361-378, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Cryptanalysis of the RSA variant based on cubic Pell equation;Theoretical Computer Science;2021-10

2. Extended partial key exposure attacks on RSA: Improvement up to full size decryption exponents;Theoretical Computer Science;2020-11

3. Generalized cryptanalysis of small CRT-exponent RSA;Theoretical Computer Science;2019-11

4. Partial key exposure attacks on RSA: Achieving the Boneh–Durfee bound;Theoretical Computer Science;2019-02

5. Small CRT-Exponent RSA Revisited;Journal of Cryptology;2018-02-22