Efficient computation of full Lucas sequences
- 1 January 1996
- journal article
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 32 (6), 537-538
- https://doi.org/10.1049/el:19960359
Abstract
Recently, Yen and Laih (1995) proposed an algorithm to compute LUC digital signatures quickly. This signature is based on a special type of Lucas sequence Vk. The authors generalise their method to any type of Lucas sequence, and extend it to the ‘sister’ Lucas sequence, Uk. As an application, the order of an elliptic curve over GF(2m) is computed quickly.Keywords
This publication has 5 references indexed in Scilit:
- Fast algorithms for LUC digital signature computationIEE Proceedings - Computers and Digital Techniques, 1995
- Common-multiplicand multiplication and its applications to public key cryptographyElectronics Letters, 1993
- Elliptic Curve Public Key CryptosystemsPublished by Springer Science and Business Media LLC ,1993
- IntroductionPublished by Springer Science and Business Media LLC ,1991
- Prime Numbers and Computer Methods for FactorizationPublished by Springer Science and Business Media LLC ,1985