• DocumentCode
    795522
  • Title

    Efficient computation of full Lucas sequences

  • Author

    Joye, M. ; Quisquater, J.-J.

  • Author_Institution
    Dept. of Math., Louvain Univ., Belgium
  • Volume
    32
  • Issue
    6
  • fYear
    1996
  • fDate
    3/14/1996 12:00:00 AM
  • Firstpage
    537
  • Lastpage
    538
  • Abstract
    Recently, Yen and Laih (see IEE Poc. Comput. Digit. Tech., vol. 142, no. 2, p. 165-9, 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
    cryptography; number theory; sequences; digital signatures; elliptic curve order; full Lucas sequences; sequence computation;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el:19960359
  • Filename
    490457
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=795522