Cryptography based on transcendental numbers

DOI10.1007/BFB0023291MaRDI QIDQ6570949zbMATH OpenFDO

Authors Josef Pieprzyk, Hossein Ghodosi, Chris Charnes, Reihaneh Safavi-Naini

Publication date 11 July 2024

Mathematics Subject Classification ID

Cryptography (94A60) Transcendence (general theory) (11J81)

Recommendations

• Exploiting randomness on continuous sets
• An encryption algorithm based on the decimal expansion of irrationals
• scientific article; zbMATH DE number 176069
• Generating and testing cryptographically secure random numbers
• scientific article; zbMATH DE number 17389

Cites work

• scientific article; zbMATH DE number 3872537 (Why is no real title available?)
• scientific article; zbMATH DE number 3750146 (Why is no real title available?)
• scientific article; zbMATH DE number 3465382 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 486633 (Why is no real title available?)
• Factoring polynomials with rational coefficients
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• Leçons sur la théorie des fonctions. Deuxième édition.
• Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers

This page was built for publication: Cryptography based on transcendental numbers

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