A binary redundant scalar point multiplication in secure elliptic curve cryptosystems

International Journal of Network Security

Volumn 3, Issue 2, 2006, Pages 132-137

  Moon, Sangook ^a  

^a Mokwon University   (South Korea)

Author keywords

Elliptic curve cryptosystem; Galois field; Scalar point multiplication

Indexed keywords

BOOTH'S ALGORITHM; ELLIPTIC CURVE CRYPTOSYSTEM; ELLIPTIC CURVE CRYPTOSYSTEMS; FAST CALCULATIONS; GALOIS FIELDS; REDUNDANT RECODING; SCALAR POINT MULTIPLICATION; SECURITY APPLICATION;

AD HOC NETWORKS; COMPUTER HARDWARE DESCRIPTION LANGUAGES; CRYPTOGRAPHY; ELECTRONIC CRIME COUNTERMEASURES;

ALGORITHMS;

EID: 37249074273     PISSN: 1816353X     EISSN: 18163548     Source Type: Journal    
DOI: None     Document Type: Article

References (9)

1. E. R. Berlekamp, " Bit-serial reed-solomon encoders," IEEE Transactions on Information Theory, vol. IT28, no. 6, pp. 869-874, nov. 1982.
2. Certicom research, SEG2: Recommended Elliptic Curve Domain Parameters, Oct. 1999.
3. D. Hankerson, J. L. Hernandez, and A. Menezes, " Software implementation of elliptic curve cryptography over binary fields" , in Crypto95, pp. 1-24, 1995.
4. N. Koblitz, " Elliptic curve cryptosystems" , Mathematics of Computation, vol. 48 no. 177, pp. 203-209, 1987.
5. N. Koblitz, A Course in Number Theory and Cryptography, Springer-Verlag, pp. 150-179, 1991.
6. I. Koren, Computer Arithmetic Algorithms, Section 6, pp. 99-106, Prentice Hall International, 1993.
7. E. Mastrovito, VLSI Architectures for Computation in Galois Fields, PhD thesis, Dept. of Electrical Eng., Lin-koping University, Sweden, 1991.
8. C. Paar, P. Fleischmann, and P. S-Rodriguez, " Fast arithmetic for public-key algorithms in galois fields with com-posite exponents," IEEE Transactions on Computers, vol. 48, no. 10, pp. 1025-1034, Oct. 1999.
9. R. L. Rivest, A. Shamir, and L. M. Adleman, " A method for obtaining digital signatures and publickey crypto-systems" , Communications of the ACM, vol. 21, pp. 120-126, Feb. 1978.