AN EFFICIENT METHOD FOR IMPROVING THE COMPUTATIONAL PERFORMANCE OF THE CUBIC LUCAS CRYPTOSYSTEM

DOI10.1017/S000497271400001XMaRDI QIDQ5495473zbMATH OpenFDO

Authors Reza Naghizadeh Majid, Elankovan Sundararajan, Zulkarnain Ali M.D.

Publication date 4 August 2014

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

cryptographypublic key cryptosystemfast cryptographyLucas cryptosystem

Mathematics Subject Classification ID

Cryptography (94A60) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Recommendations

• Improved efficiency of a linearly homomorphic cryptosystem
• Public-key cryptography based on a cubic extension of the Lucas functions
• Improvement of lattice-based cryptography using CRT
• Analysis and improvement for the performance of Baptista's cryptographic scheme
• scientific article; zbMATH DE number 1418252
• Efficient algorithms for speeding up the computations of elliptic curve cryptosystems
• Improved efficiency of chosen ciphertext secure encryption from factoring
• scientific article; zbMATH DE number 1304091
• Cryptographic analysis in cubic time

Cites work

• A cubic analogue of the RSA cryptosystem
• A method for computing Lucas sequences
• A method for obtaining digital signatures and public-key cryptosystems
• Modern computer arithmetic
• RSA, Dickson, LUC and Williams: a study on four polynomial-type public-key cryptosystems

Cited in

(2)

• scientific article; zbMATH DE number 2037820 (Why is no real title available?)
• Public-key cryptography based on a cubic extension of the Lucas functions

This page was built for publication: AN EFFICIENT METHOD FOR IMPROVING THE COMPUTATIONAL PERFORMANCE OF THE CUBIC LUCAS CRYPTOSYSTEM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5495473)