Sciweavers

Share
CRYPTO
1995
Springer

Some Remarks on Lucas-Based Cryptosystems

11 years 10 months ago
Some Remarks on Lucas-Based Cryptosystems
We review the well-known relation between Lucas sequences and exponentiation. This leads to the observation that certain public-key cryptosystems that are based on the use of Lucas sequences have some elementary properties their re-inventors were apparently not aware of. In particular, we present a chosen-message forgery for ‘LUC’ (cf. [21; 25]), and we show that ‘LUCELG’and ‘LUCDIF’ (cf. [22, 261) are vulnerable to subexponential time attacks.This provesthat various claimsthat were made about Lucas-based cryptosystems are incorrect.
Daniel Bleichenbacher, Wieb Bosma, Arjen K. Lenstr
Added 25 Aug 2010
Updated 25 Aug 2010
Type Conference
Year 1995
Where CRYPTO
Authors Daniel Bleichenbacher, Wieb Bosma, Arjen K. Lenstra
Comments (0)
books