A public key cryptosystem as hard as factorisation

MaRDI QIDQ3363232zbMATH OpenFDO

Authors Mark C. W. Jones

Publication date 1990

zbMATH Keywords

factorisation of integerspublic key cryptosystems

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Factorization (11Y05) Cryptography (94A60)

Recommendations

• SOME PUBLIC-KEY CRYPTO-FUNCTIONS AS INTRACTABLE AS FACTORIZATION
• Some Public-Key Crypto-Functions as Intractable as Factorization
• A public-key cryptosystem utilizing cyclotomic fields
• A key distribution system equivalent to factoring
• scientific article; zbMATH DE number 3898760

Cited in

(13)

• A key distribution system equivalent to factoring
• Factorizations in the elementary abelian \(p\)-group and their cryptographic significance
• Breaking RSA may be as difficult as factoring
• scientific article; zbMATH DE number 4200134 (Why is no real title available?)
• scientific article; zbMATH DE number 3898760 (Why is no real title available?)
• scientific article; zbMATH DE number 3939411 (Why is no real title available?)
• Some Public-Key Crypto-Functions as Intractable as Factorization
• SOME PUBLIC-KEY CRYPTO-FUNCTIONS AS INTRACTABLE AS FACTORIZATION
• PUBLIC KEY CRYPTOSYSTEM USING A RECIPROCAL NUMBER WITH THE SAME INTRACTABILITY AS FACTORING A LARGE NUMBER
• scientific article; zbMATH DE number 42878 (Why is no real title available?)
• Public-key cryptosystem design based on factoring and discrete logarithms
• Groups, Factoring, and Cryptography
• Coding and Cryptography

This page was built for publication: A public key cryptosystem as hard as factorisation

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