Algorithms to speed up computations in threshold RSA

DOI10.1007/10718964_36MaRDI QIDQ2721174zbMATH OpenFDO

Authors Brian R. King

Publication date 1 July 2001

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

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

zbMATH Keywords

cyclotomic polynomialsthreshold secret sharing

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Improved methods to perform threshold RSA
• scientific article; zbMATH DE number 503341
• Information Security and Privacy
• Efficient algorithms for speeding up the computations of elliptic curve cryptosystems
• scientific article; zbMATH DE number 1894959
• scientific article; zbMATH DE number 1950337
• scientific article; zbMATH DE number 2127886
• Speeding up the computations of elliptic curves cryptoschemes
• scientific article; zbMATH DE number 2219412

Cited in

(2)

• Improved methods to perform threshold RSA
• scientific article; zbMATH DE number 503341 (Why is no real title available?)

This page was built for publication: Algorithms to speed up computations in threshold RSA

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