Relationship between Fibonacci and Lucas sequences and their application in symmetric cryptosystems

A. Luma, B. Raufi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Identification whether a certain number belongs to either Fibonacci or Lucas sequence is computationally intense task in the sense that the sequence itself need to be written from the beginning until the requested number. In this paper we present a method of detecting whether a certain number is of Lucas or Fibonacci sequence as well as introduce relationships between such sequences. This relationship is being used for creation of encryption/decryption methods by utilizing symmetrical key generated by elements of both Lucas and Fibonacci sequences. The strength of this symmetrical cryptosystem lies in the introduced mathematical operators called pentors and ultra pentors which are hard to generate and guess by brute force computation.

Original languageEnglish
Title of host publicationRecent Advances in Circuits, Systems, Signals - International Conference on Circuits, Systems, Signals, CSS
Pages146-150
Number of pages5
Publication statusPublished - 2010
Externally publishedYes
EventInternational Conference on Circuits, Systems, Signals, CSS - , Malta
Duration: 15 Sep 201017 Sep 2010

Publication series

NameInternational Conference on Circuits, Systems and Signals - Proceedings
ISSN (Print)1792-4324

Conference

ConferenceInternational Conference on Circuits, Systems, Signals, CSS
Country/TerritoryMalta
Period15/09/1017/09/10

Keywords

  • Cryptography
  • Fibonacci sequence
  • Key encryption
  • Lucas sequence

Fingerprint

Dive into the research topics of 'Relationship between Fibonacci and Lucas sequences and their application in symmetric cryptosystems'. Together they form a unique fingerprint.

Cite this