Efficient computation of full Lucas sequences

Joye, M.;Quisquater, Jean-Jacques
(1996) Electronics Letters — Vol. 32, n° 6, p. 537-538 (1996)

Files

No attached file found for this publication.

Details

Authors
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 V-k. The authors generalise their method to any type of Lucas sequence, and extend it to the 'sister' Lucas sequence, U-k. As an application, the order of an elliptic curve over GF(2(m)) is computed quickly.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Joye, M., & Quisquater, J.-J. (1996). Efficient computation of full Lucas sequences. Electronics Letters, 32(6), 537-538. https://doi.org/10.1049/el:19960359 (Original work published 1996)