Authors:
Artan Luma
and
Nderim Zeqiri
Affiliation:
CST, SEE University, Macedonia, The Former Yugoslav Republic of
Keyword(s):
Cryptography, Algorithm, Security, ANZL.
Related
Ontology
Subjects/Areas/Topics:
Enterprise Information Systems
;
Formal Methods
;
Information Systems Analysis and Specification
;
Methodologies and Technologies
;
Operational Research
;
Security
;
Simulation and Modeling
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.