Efficient computation of full Lucas sequences (1996)
by
Marc Joye
,
Jean-Jacques Quisquater
,
J. -j. Quisquater
,
Where D P
,
Uk (p Q
| Citations: | 4 - 1 self |
BibTeX
@MISC{Joye96efficientcomputation,
author = {Marc Joye and Jean-Jacques Quisquater and J. -j. Quisquater and Where D P and Uk (p Q},
title = {Efficient computation of full Lucas sequences},
year = {1996}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
F48.93> (P; Q) = ff k + fi k : (2) It can easily be shown that the numbers U i and V i satisfy the following relations: U i+j = U i V j \Gamma Q j U i\Gammaj ; (3) V i+j = V i V j \Gamma Q j V i\Gammaj : (4) Fast algorithm for Lucas sequences: Assume you have to compute Uk (P; Q) and Vk (P; Q). If we use the binary expansion of k, it can be expressed as k = K0 , where K j = n\Gam
Citations
| 262 | Elliptic Curve Public Key Cryptosystems - Menezes - 1993 |
| 64 | Prime Numbers and Computer Methods for Factorization - Riesel - 1994 |
| 25 | User’s Guide to PARI/GP - Batut, Belabas, et al. - 2000 |
| 22 | The little book of big primes - Ribenboim - 1991 |
| 15 | The pseudoprimes to 25 - Pomerance, Selfridge, et al. - 1980 |
| 3 | Fast algorithms for LUC digital signature computation - YEN, LAIH - 1995 |
| 3 | Common-multiplicand multiplication and its applications to public key cryptography - YEN, LAIH - 1993 |
| 1 | JR.: `The pseudoprimes to 25 \Delta 10 9 - POMERANCE, SELFRIDGE, et al. |
