Some remarks on Lucas-based cryptosystems

DOI10.1007/3-540-44750-4_31MaRDI QIDQ4343411zbMATH OpenFDO

Authors Daniel Bleichenbacher, Wieb Bosma, Arjen K. Lenstra

Publication date 14 August 1997

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44750-4_31

zbMATH Keywords

LUCLucas sequencesLucas-based cryptosystems

Mathematics Subject Classification ID

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

Recommendations

• A public-key cryptosystem and a digital signature system based on the Lucas function analogue to discrete logarithms
• A public-key cryptosystem based on Lucas sequences
• Lucas sequence and cryptography
• On the security of the Lucas function

Cited in

(28)

• Aitken and Neville inverse interpolation methods for the Lucas logarithm problem
• A traceable group signature scheme.
• Lucas sequence and cryptography
• A method for computing Lucas sequences
• An efficient probabilistic public-key cryptosystem over quadratic fields quotients
• Polynomial representations of the Lucas logarithm
• A research on new public-key encryption schemes
• A public-key cryptosystem based on Lucas sequences
• Public-key cryptography based on a cubic extension of the Lucas functions
• Common modulus and chosen-message attacks on public-key schemes with linear recurrence relations
• Relationship between Fibonacci and Lucas sequences and their application in symmetric cryptosystems
• Computing Lucas functions using addition chains.
• scientific article; zbMATH DE number 5139182 (Why is no real title available?)
• Parallel computation for LUC cryptosystems on distributed memory multiprocessor machine
• A cryptanalytic attack on the LUC cryptosystem using continued fractions
• Critical remarks on “Critical Remarks on Some Public-Key Cryptosystems” by T. Herlestam
• scientific article; zbMATH DE number 30326 (Why is no real title available?)
• scientific article; zbMATH DE number 43650 (Why is no real title available?)
• A public-key cryptosystem and a digital signature system based on the Lucas function analogue to discrete logarithms
• A new and optimal chosen-message attack on RSA-type cryptosystems
• scientific article; zbMATH DE number 1113951 (Why is no real title available?)
• Efficient computation of terms of linear recurrence sequences of any order
• On the security of some variants of the RSA signature scheme
• (Verifiable) delay functions from Lucas sequences
• On the security of the Lucas function
• A chosen message attack on Demytko's elliptic curve cryptosystem
• On the generic complexity of the discrete logarithm problem in Lucas sequences
• On integer sequences in cryptography

This page was built for publication: Some remarks on Lucas-based cryptosystems

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