Representation of Natural Numbers as Sums of Fibonacci Numbers: An Application to Modern Cryptography

Piero Filipponi and Emilio Montolivo

A chapter in Applications of Fibonacci Numbers, 1990, pp 89-99 from Springer

Abstract: Abstract After giving some basic concepts of a cryptographic technique referred to as Stream Ciphering [7] (Sec. 2) we have a look at the translation of natural numbers into Fibonacci binary sequences (Sec. 3) and show that no two of the l’s occurring in these sequences are adjacent.

Date: 1990
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-009-1910-5_9

Ordering information: This item can be ordered from
http://www.springer.com/9789400919105

DOI: 10.1007/978-94-009-1910-5_9

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().