Fast rebalanced RSA signature scheme with typical prime generation

DOI10.1016/j.tcs.2020.04.024zbMath1456.94126OpenAlexW3021923440MaRDI QIDQ2182709

Kim Gyu-Chol, Hwang Hak-Chol, Li Su-Chol

Publication date: 26 May 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.04.024

zbMATH Keywords

signatureprime generationpublic exponentrebalanced RSA

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Revisiting prime power RSA
• Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
• Cryptanalysis of `less short' RSA secret exponents
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Small CRT-exponent RSA revisited
• Generalized cryptanalysis of small CRT-exponent RSA
• How to Generalize RSA Cryptanalyses
• The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
• Cryptanalysis of Variants of RSA with Multiple Small Secret Exponents
• Cryptanalysis of short RSA secret exponents
• A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073
• Cryptanalysis of RSA and Its Variants
• A method for obtaining digital signatures and public-key cryptosystems
• Cryptanalysis of RSA with private key d less than N/sup 0.292/
• Cryptanalysis of RSA with Multiple Small Secret Exponents
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
• Information Security and Privacy
• Small CRT-Exponent RSA Revisited
• Public Key Cryptography - PKC 2006

This page was built for publication: Fast rebalanced RSA signature scheme with typical prime generation