Public-Key Cryptography Based on a Cubic Extension of the Lucas Functions

Authors:
Eric Roettger;Hugh C. Williams
Affiliations:
(Correspd.) Dept. of General Education, Mount Royal University, Canada. eroettger@mtroyal.ca;(Supported by NSERC of Canada and iCORE of Alberta) Dept. of Mathematics and Statistics, University of Calgary, Canada. williams@math.ucalgary.ca
Venue:
Fundamenta Informaticae - Cryptology in Progress: 10th Central European Conference on Cryptology, Będlewo Poland, 2010
Year:
2012

Citing 8
Cited 0

LUC public key encryption: a secure alternative to RSA

Dr. Dobb's Journal
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
The XTR Public Key System

CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Doing More with Fewer Bits

ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
LUC: A New Public Key System

IFIP/Sec '93 Proceedings of the IFIP TC11, Ninth International Conference on Information Security: Computer Security
The GH Public-Key Cryptosystem

SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
A Public-Key Cryptosystem and a Digital Signature System BAsed on the Lucas Function Analogue to Discrete Logarithms

ASIACRYPT '94 Proceedings of the 4th International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
New directions in cryptography

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the goals of public-key cryptography is to securely exchange a key by use of a public channel without the users previously communicating with one another. In 1976 W. Diffie and M. Hellman had an idea how to do this by exploiting mathematically difficult one-way problems. Diffie-Hellman key exchange is based on the believed difficulty of the discrete log problem. This paper presents a new key exchange protocol based on functions that were developed to generalize the Lucas functions. Relevant results about this generalization of the Lucas functions are provided that provide the machinery for the Diffie-Hellman-like key exchange presented here. Lastly, there is a brief discussion about the efficiency of our system versus Diffie-Hellman key exchange and LUCDIF.