scientific article; zbMATH DE number 4214160

zbMATH Open0734.11072MaRDI QIDQ3360979FDOQ3360979

Authors: Carl Pomerance 

Publication date: 1990

Title of this publication is not available (Why is that?)

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

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)

Cited In (8)

• Title not available (Why is that?)
• New number-theoretic cryptographic primitives
• Computational Cryptography
• Komplexitätstheorie und Kryptologie
• Title not available (Why is that?)
• Number theory in science and communication. With applications in cryptography, physics, digital information, computing, and self-similarity.
• Title not available (Why is that?)
• Primes and consecutive sums in arithmetic progressions

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)