Some Public-Key Crypto-Functions as Intractable as Factorization

DOI10.1007/3-540-39568-7_7MaRDI QIDQ3739049zbMATH OpenOpenAlexFDO

Authors Hugh C. Williams

Publication date 1985

Published in Advances in cryptology. Proceedings of CRYPTO '84 (a workshop on the theory and application of cryptographic techniques held at the University of California, Santa Barbara, August 19--22, 1984) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-39568-7_7

zbMATH Keywords

factorizationpublic-key encryption

Mathematics Subject Classification ID

Cryptography (94A60) Factorization (11Y05)

Recommendations

• SOME PUBLIC-KEY CRYPTO-FUNCTIONS AS INTRACTABLE AS FACTORIZATION
• A public key cryptosystem as hard as factorisation
• A modification of the RSA public-key encryption procedure (Corresp.)
• A public-key cryptosystem utilizing cyclotomic fields
• scientific article; zbMATH DE number 1303131

Cited in

(9)

• Breaking RSA may be as difficult as factoring
• FACTORING VIA SUPERENCYRPTION
• scientific article; zbMATH DE number 5139182 (Why is no real title available?)
• Security analysis and improvement of a double-trapdoor encryption scheme
• Public key authentication scheme over quaternions
• A public key cryptosystem as hard as factorisation
• PUBLIC KEY CRYPTOSYSTEM USING A RECIPROCAL NUMBER WITH THE SAME INTRACTABILITY AS FACTORING A LARGE NUMBER
• Proof Checking the RSA Public Key Encryption Algorithm
• SOME PUBLIC-KEY CRYPTO-FUNCTIONS AS INTRACTABLE AS FACTORIZATION

This page was built for publication: Some Public-Key Crypto-Functions as Intractable as Factorization

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