Which new RSA-signatures can be computed from certain given RSA- signatures!

DOI10.1007/BF00191320zbMath0748.94004OpenAlexW2050622926MaRDI QIDQ1184507

Eugène van Heyst, Jan-Hendrik Evertse

Publication date: 28 June 1992

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00191320

zbMATH Keywords

signature schemescryptographic protocolsRSA-algorithmRSA- signaturesRSA-roots

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate formulas for some functions of prime numbers
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• Computational Complexity of Probabilistic Turing Machines
• A method for obtaining digital signatures and public-key cryptosystems
• On factorisation, with a suggested new approach

This page was built for publication: Which new RSA-signatures can be computed from certain given RSA- signatures!