Improved methods to perform threshold RSA

DOI10.1007/3-540-44448-3_27MaRDI QIDQ2707431zbMATH OpenFDO

Authors Brian R. King

Publication date 3 April 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44448-3_27

zbMATH Keywords

Abelian groupcryptographycyclotomic polynomialsRSAsecret sharingthreshold scheme

Mathematics Subject Classification ID

Finite abelian groups (20K01) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• New threshold RSA cryptosystems
• An ideal and robust threshold RSA
• scientific article; zbMATH DE number 1894959
• Algorithms to speed up computations in threshold RSA
• A simplified approach to threshold and proactive RSA
• Information Security and Privacy
• An improved binary algorithm for RSA
• scientific article; zbMATH DE number 2048539
• Simplified Threshold RSA with Adaptive and Proactive Security
• Threshold key-recovery systems for RSA

Cited in

(11)

• A threshold decryption scheme without session keys
• Stronger security proofs for RSA and Rabin bits.
• A new construction of threshold cryptosystems based on RSA
• An improved binary algorithm for RSA
• New threshold RSA cryptosystems
• Algorithms to speed up computations in threshold RSA
• scientific article; zbMATH DE number 1894959 (Why is no real title available?)
• Information Security and Privacy
• Information Security and Privacy
• Improvements to RSA key generation and CRT on embedded devices
• Optimal resilient threshold GQ signatures

This page was built for publication: Improved methods to perform threshold RSA

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2707431)