Quadrinomial modular arithmetic using modified polynomial basis

International Conference on Information Technology: Coding and Computing, ITCC

Volumn 1, Issue , 2005, Pages 550-555

  Negre, Christophe ^a,b  

^a LIRMM   (France)

^b UNIVERSITÉ DE PERPIGNAN   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FINITE ELEMENT METHOD; POLYNOMIALS;

FINITE ELEMENT ARITHMETIC; NAOP MODULAR ARITHMETIC; NEARLY ALL ONE POLYNOMIAL (NAOP); SPACE COMPLEXITY;

PARALLEL PROCESSING SYSTEMS;

EID: 24744469007     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/itcc.2005.236     Document Type: Conference Paper

References (10)

1. E. Berlekamp. Bit-serial Reed-Solomon encoder. IEEE Transaction on Information Theory, IT-28(6), 1982.
2. S. Gao and H. W. L. Jr. Optimal Normal Bases. Designs, Codes and Cryptography, 2(4):315-323, 1992.
3. M. Hasan, M. Wang, and V. Bhargava. A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields. IEEE Transaction on Computeur, 42(10):1278-1280, 1993.
4. R. Katti and J. Brennan. Low Complexity Multiplication in Finite Field Using Ring Representation. IEEE Transaction on Computers, 52(4), May 2003.
5. N. Koblitz. Elliptic curve cryptosystems. Mathematics of Computation, 48(177):203-209, 1987.
6. C. Koc and B. Sunar. An Efficient Optimal Normal Basis Type II Multiplier. IEEE Transaction on Computers, 50(1):83-87, January 2001.
7. E. Mastrovito. VLSI architectures for computations in Galois fields. PhD thesis, Dep. Elec. Eng.,Linkoping Univ, 1991.
8. V. Miller. Use of elliptic curves in cryptography. Advances in Cryptology, proceeding's of CRYPTO'85, 218:417-426, 1986.
9. F. Rodriguez-Henriquez and C. Koc. Parallel Multipliers based on Special Irreducible Pentanomials. IEEE Transaction on Computers, 52(12):1535-1542, December 2003.
10. N). In CHES'99, LNCS, volume 1717, pages 122-134. Springer Verlag, 1999.