Efficient computation of full Lucas sequences

Electronics Letters

Volumn 32, Issue 6, 1996, Pages 537-538

  Joye, M ^a   Quisquater, J J ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Cryptography; Number theory

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL METHODS; CRYPTOGRAPHY; ITERATIVE METHODS; NUMBER THEORY;

ELLIPTIC CURVE; LUCAS SEQUENCE;

ALGORITHMS;

EID: 0030104610     PISSN: 00135194     EISSN: None     Source Type: Journal    
DOI: 10.1049/el:19960359     Document Type: Article

References (8)

1. YEN, S.-M., and LAIH, C.-S.: 'Fast algorithms for LUC digital signature computation', IEE Proc., Comput. Digit. Tech., 1995, 142, (2), pp. 165-169
2. RIESEL, H.: 'Prime numbers and computers methods for factorization' in 'Progress in mathematics - 57' (Birkhäuser, 1985)
3. RIBENBOIM, P.: 'The little book of big primes' (Springer, 1991)
4. BATUT, C., BERNARDI, D., COHEN, H., and OLIVER, M.: 'User's guide to PARI-GP', January 1995
5. YEN, S.-M., and LAIH, C.-S.: 'Common-multiplicand multiplication and its applications to public key cryptography', Electron. Lett., 1993, 29, (17), pp. 1583-1584
6. 9', Math. Comput., 1980, 35, (151), pp. 1003-1026
7. MENEZES, A.J.: 'Elliptic curve public key cryptosystems' (Kluwer Academic Publishers, 1993)
8. MENEZES, A., QU, M., and VANSTONE, S.: Draft of IEEE P1363, November 1995, Chap. 6