2003/08/01 by Mohamad Rushdan Md Said, Mohamad Rushdan Md. Said, John Loxton · 15 citations
Computer Science · Mathematics · #Algebra over a field #Algorithm #Arithmetic #Chaos-based Image/Signal Encryption #Coding theory and cryptography #Computer science #Cryptographic Implementations and Security #Cryptography #Cryptosystem #Discrete mathematics #Encryption #Euler's formula #Euler's totient function #Factorization #Mathematical analysis #Mathematics #Public key cryptosystem #Public-key cryptography #Pure mathematics
paper · pdf · doi:10.1017/s0004972700037382
published in Bulletin of the Australian Mathematical Society 68(1), 21-38 (Cambridge University Press)
openalex publication_date 2003/08/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/04
In this paper, we investigate a public key cryptosystem which is derived from a third order linear recurrence relation and is analogous to the RSA and LUC cryptosystems. The explicit formulation involves a generalisation of the rule for composition of powers and of the calculus of the Euler totient function which underlie the algebra of the RSA cryptosystem. The security of all these systems appears to be comparable and to depend on the intractability of factorization but the systems do not seem to be mathematically equivalent.