Cryptography based on transcendental numbers

DOI10.1007/BFB0023291zbMATH Open1541.94058MaRDI QIDQ6570949FDOQ6570949

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

Publication date: 11 July 2024

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Factoring polynomials with rational coefficients
• Title not available (Why is that?)
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• Title not available (Why is that?)
• Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers
• Title not available (Why is that?)
• Leçons sur la théorie des fonctions. Deuxième édition.

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)