A cubic analogue of the RSA cryptosystem

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...

Full description

Bibliographic Details
Main Authors: Md Said, Mohamad Rushdan, Loxton, John
Format: Article
Language:English
Published: Australian Mathematical Publishing Association 2003
Online Access:http://psasir.upm.edu.my/id/eprint/116101/
http://psasir.upm.edu.my/id/eprint/116101/1/116101.pdf
_version_ 1848866928234332160
author Md Said, Mohamad Rushdan
Loxton, John
author_facet Md Said, Mohamad Rushdan
Loxton, John
author_sort Md Said, Mohamad Rushdan
building UPM Institutional Repository
collection Online Access
description 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 factorisation but the systems do not seem to be mathematically equivalent.
first_indexed 2025-11-15T14:28:23Z
format Article
id upm-116101
institution Universiti Putra Malaysia
institution_category Local University
language English
last_indexed 2025-11-15T14:28:23Z
publishDate 2003
publisher Australian Mathematical Publishing Association
recordtype eprints
repository_type Digital Repository
spelling upm-1161012025-03-19T07:29:41Z http://psasir.upm.edu.my/id/eprint/116101/ A cubic analogue of the RSA cryptosystem Md Said, Mohamad Rushdan Loxton, John 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 factorisation but the systems do not seem to be mathematically equivalent. Australian Mathematical Publishing Association 2003 Article PeerReviewed text en http://psasir.upm.edu.my/id/eprint/116101/1/116101.pdf Md Said, Mohamad Rushdan and Loxton, John (2003) A cubic analogue of the RSA cryptosystem. Bulletin of the Australian Mathematical Society, 68 (1). pp. 21-38. ISSN 0004-9727; eISSN: 0004-9727 https://www.cambridge.org/core/journals/bulletin-of-the-australian-mathematical-society/article/cubic-analogue-of-the-rsa-cryptosystem/3FA6443EA74EB8F5A6AB17C3A7A976B1 10.1017/s0004972700037382
spellingShingle Md Said, Mohamad Rushdan
Loxton, John
A cubic analogue of the RSA cryptosystem
title A cubic analogue of the RSA cryptosystem
title_full A cubic analogue of the RSA cryptosystem
title_fullStr A cubic analogue of the RSA cryptosystem
title_full_unstemmed A cubic analogue of the RSA cryptosystem
title_short A cubic analogue of the RSA cryptosystem
title_sort cubic analogue of the rsa cryptosystem
url http://psasir.upm.edu.my/id/eprint/116101/
http://psasir.upm.edu.my/id/eprint/116101/
http://psasir.upm.edu.my/id/eprint/116101/
http://psasir.upm.edu.my/id/eprint/116101/1/116101.pdf