A non-redundant and efficient architecture for Karatsuba-Ofman algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3650 LNCS, Issue , 2005, Pages 288-299

  Chang, Nam Su ^a   Kim, Chang Han ^b   Park, Young Ho ^c   Lim, Jongin ^a  

^a Korea University   (South Korea)

^b Semyung University   (South Korea)

^c Sejong Cyber University   (South Korea)

Author keywords

Hardware Architecture; Karatsuba Ofman Algorithm; Non Redundant Karatsuba Ofman Algorithm; Polynomial Multiplication

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER HARDWARE; ELECTRON MULTIPLIERS; REDUNDANCY;

HARDWARE ARCHITECTURE; KARATSUBA-OFMAN ALGORITHM; NON-REDUNDANT KARATSUBA-OFMAN ALGORITHM; POLYNOMIAL MULTIPLICATION;

COMPUTER ARCHITECTURE;

EID: 33645985781     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11556992_21     Document Type: Conference Paper

References (15)

1. ANSI X9.62, Public key cryptography for the financial services industry: The Elliptic Curve Digital Signature Algorithm (ECDSA), (available from the ANSI X9 catalog), 1999.
2. H. Cohen, A Course in Computational Algebric Number Theory, Springer-Verlag, Berlin, Heidelberg, 1993.
3. m) Yielding Small Complexity Arithmetic circuit, IEEE Trans. on Computers, vol 47, 1998, 353-356.
4. n), In Workshop on Cryptographic Hardware and Embedded Systems(CHES'02), LNCS2523, (2002), 381-399.
5. IEEE 1363, Standard Specifications For Public Key Cryptography, http://grouper.ieee.org/groups/1363/,2000.
6. K.O. Geddes,S.R. Czapor, and G.Labahn, Algorithms for Computer Algebra, Kluwer Academic Publishers, 1992.
7. C.K. Koc, and B. Sunar, Low-Complexity Bit-Parallel Canonical and Normal Basis Multipliers for a Class of Finite Fields, Proceeding of 1998 IEEE International Symposium on Information Theory, MIT, Cambridge, Massachusetts, August 16-21, 1998, 294-294.
8. N. Koblitz, Elliptic Curve Cryptosystems, Mathematics of Computation, vol. 48, 1987, 203-209.
9. M. Leone, A New Low Complexity Parallel Multiplier for a Class of Finite Fields, In Workshop on Cryptographic Hardware and Embedded Systems(CHES'01), LNCS2162, (2001), 160-170.
10. V. Miller, Use of Elliptic Curve Cryptosystems", Advances in Cryptology, CRYPTO'85, LNCS 218, H. C. Williams, Ed., Springer-Verlag, 1986, 417-426.
11. C. Paar, Efficient VLSI Architecture for Bit-Parallel Computation in Galois Fields, PhD thesis, (Engl. transl.), Institute for Experimental Mathematics, University of Essen, Essen, Germany, June 1994.
12. 4) based on special types of primitive polynomials, In 1994 IEEE International Symposium on Information Theory, Trondheim, Norway, June 27-July 1 1994.
13. C. Paar, A new architecture for a parallel finite fields multiplier with Low Complexity Based on Composite. Fields, IEEE Trans. on Computers, vol45, no. 7, July 1996, 846-861.
14. n), IEEE Transactions on Computers, vol. 47, no. 2, February 1998, 162-170.
15. m), Proceedings of the International Conference on Computer Science and Technology - CST 2003, Acta Press, Cancun, Mexico, May 2003, 405-410.