scientific article; zbMATH DE number 4214160

MaRDI QIDQ3360979zbMATH OpenFDO

Authors Carl Pomerance

Publication date 1990

zbMATH Keywords

algorithmssurveycomputational complexityfactoringprimality testingcryptosystemsRSA cryptosystemknapsack cryptosystems

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16) Primality (11Y11)

Recommendations

• scientific article; zbMATH DE number 707175
• scientific article; zbMATH DE number 4057589
• scientific article; zbMATH DE number 193512
• scientific article; zbMATH DE number 4212179
• SOME PUBLIC-KEY CRYPTO-FUNCTIONS AS INTRACTABLE AS FACTORIZATION

Cited in

(8)

• scientific article; zbMATH DE number 707175 (Why is no real title available?)
• scientific article; zbMATH DE number 50041 (Why is no real title available?)
• New number-theoretic cryptographic primitives
• Computational Cryptography
• Komplexitätstheorie und Kryptologie
• scientific article; zbMATH DE number 3939411 (Why is no real title available?)
• Primes and consecutive sums in arithmetic progressions
• Number theory in science and communication. With applications in cryptography, physics, digital information, computing, and self-similarity.

This page was built for publication:

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