A small secret exponent attack on cryptosystems using Dickson polynomials

DOI10.14495/jsiaml.7.41zbMath1408.94956OpenAlexW945489353MaRDI QIDQ3121388

Shigenori Uchiyama, Yukihiro Uchida, Akihiko Onishi

Publication date: 18 March 2019

Published in: JSIAM Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.14495/jsiaml.7.41

zbMATH Keywords

RSADickson polynomialLLL-algorithmsmall inverse problem

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)

Cites Work

• Finding a Small Root of a Univariate Modular Equation
• Cryptanalysis of short RSA secret exponents
• Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA
• Cryptanalysis of RSA with Private Key d Less than N 0.292
• Unnamed Item
• Unnamed Item
• Unnamed Item