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

Issue title: Cryptology in Progress: 10th Central European Conference on Cryptology, Będlewo Poland, 2010

Article type: Research Article

Authors: Roettger, Eric | Williams, Hugh C.

Affiliations: Dept. of General Education, Mount Royal University, Canada. eroettger@mtroyal.ca | Dept. of Mathematics and Statistics, University of Calgary, Canada. williams@math.ucalgary.ca

Note: [] Address for correspondence: Dept. of General Education, Mount Royal University, Canada

Note: [] The second author was supported by NSERC of Canada and iCORE of Alberta.

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.

Keywords: linear recurrence, Lucas functions, public-key, cryptography

DOI: 10.3233/FI-2012-633

Journal: Fundamenta Informaticae, vol. 114, no. 3-4, pp. 325-344, 2012