RSA public key validation

MaRDI QIDQ2708636zbMATH OpenFDO

Authors Robert D. Silverman

Publication date 17 July 2001

zbMATH Keywords

primality of a discrete logarithmpublic key validationRSA public exponentstrong primeszero knowledge protocol

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 4055525
• RSA key generation with verifiable randomness
• Short certification of secure RSA modulus (transcript of discussion)
• scientific article; zbMATH DE number 1775456
• Efficient noninteractive certification of RSA moduli and beyond

Cited in

(8)

• Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms
• Public-key generation with verifiable randomness
• Public keys
• RSA key generation with verifiable randomness
• Protocols for issuing public-key certificates over the internet
• On the complexity of public-key certificate validation
• Short certification of secure RSA modulus (transcript of discussion)
• Certifying RSA

This page was built for publication: RSA public key validation

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