DATA ENCRYPTION AND DECRYPTION USING ANZL ALGORITHM

Artan Luma, Nderim Zeqiri

2008

Abstract

What is the ANZL Algorithm? It is a genuine result of our work which is theoretically and practically proved. By using the ANZL Algorithm, we can test whether a given number x belongs to Lucas’s series. It can also be used to find a sequence of Lucas’s numbers, starting from any number x. If a given number x, completes the relation 5∙x^2±4=λ^2, we can say that it is a Lucas number and we mark it as L_n=x. From the pair of numbers (L_n,λ), we can find the preceding L_(n-1) and the succeeding L_(n+1) e L_n. Based on these three elements of Lucas’s series, we can create the key for data encryption and decryption.

Paper Citation

in Harvard Style

Luma A. and Zeqiri N. (2008). DATA ENCRYPTION AND DECRYPTION USING ANZL ALGORITHM . In Proceedings of the Tenth International Conference on Enterprise Information Systems - Volume 3: ICEIS, ISBN 978-989-8111-38-8, pages 220-223. DOI: 10.5220/0001688102200223

in Bibtex Style

@conference{iceis08,
author={Artan Luma and Nderim Zeqiri},
title={DATA ENCRYPTION AND DECRYPTION USING ANZL ALGORITHM},
booktitle={Proceedings of the Tenth International Conference on Enterprise Information Systems - Volume 3: ICEIS,},
year={2008},
pages={220-223},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001688102200223},
isbn={978-989-8111-38-8},
}

in EndNote Style

TY - CONF
JO - Proceedings of the Tenth International Conference on Enterprise Information Systems - Volume 3: ICEIS,
TI - DATA ENCRYPTION AND DECRYPTION USING ANZL ALGORITHM
SN - 978-989-8111-38-8
AU - Luma A.
AU - Zeqiri N.
PY - 2008
SP - 220
EP - 223
DO - 10.5220/0001688102200223