Reducing the Complexity in the Distributed Computation of Private RSA Keys

DOI10.1007/978-3-642-02620-1_18zbMath1284.94090OpenAlexW1521419442MaRDI QIDQ3634497

Peter Lory

Publication date: 25 June 2009

Published in: Information Security and Privacy (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02620-1_18

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
• How to share a secret
• A method for obtaining digital signatures and public-key cryptosystems
• Secure Hash-and-Sign Signatures Without the Random Oracle
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reducing the Complexity in the Distributed Computation of Private RSA Keys