Split knowledge generation of RSA parameters

DOI10.1007/BFB0024452MaRDI QIDQ4400567zbMATH OpenFDO

Authors Clifford Cocks

Publication date 25 January 1999

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

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

zbMATH Keywords

primality testingRSA encryption systemsplit escrow schemes

Mathematics Subject Classification ID

Primality (11Y11) Cryptography (94A60)

Recommendations

• Generation of shared RSA keys by two parties
• Generation of an RSA scheme in resource-constrained environments
• Multiparty generation of an RSA modulus
• Multiparty generation of an RSA modulus
• Efficient generation of shared RSA keys
• Generating RSA moduli with a predetermined portion
• Improved reconstruction of RSA private-keys from their fraction
• Robust protocol for generating shared RSA parameters
• Factoring RSA modulus using prime reconstruction from random known bits
• scientific article; zbMATH DE number 1740041

Cited in

(6)

• Selected application of the Chinese remainder theorem in multiparty computation
• scientific article; zbMATH DE number 1583952 (Why is no real title available?)
• Efficient and robust two-party RSA key generation
• Two party RSA key generation. (Extended abstract)
• Multiparty generation of an RSA modulus
• Multiparty generation of an RSA modulus

This page was built for publication: Split knowledge generation of RSA parameters

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