A public key cryptosystem as hard as factorisation

zbMATH Open0734.94011MaRDI QIDQ3363232FDOQ3363232

Mark C. W. Jones

Publication date: 1990

zbMATH Keywords

public key cryptosystemsfactorisation of integers

Mathematics Subject Classification ID

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

Cited In (3)

• Public-key cryptosystem design based on factoring and discrete logarithms
• Factorizations in the elementary abelian \(p\)-group and their cryptographic significance
• PUBLIC KEY CRYPTOSYSTEM USING A RECIPROCAL NUMBER WITH THE SAME INTRACTABILITY AS FACTORING A LARGE NUMBER

   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 👍 👎
• Title not available (Why is that?) 👍 👎

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)