Fast Bit-Level, Word-Level and Parallel Arithmetic in Finite Fields for Elliptic Curve Cryptosystems

Fast Bit-Level, Word-Level and Parallel Arithmetic in Finite Fields for Elliptic Curve Cryptosystems (1998)

Cached

Download Links

by Alper Halbutogullar

BibTeX

@MISC{Halbutogullar98fastbit-level,,
    author = {Alper Halbutogullar},
    title = { Fast Bit-Level, Word-Level and Parallel Arithmetic in Finite Fields for Elliptic Curve Cryptosystems},
    year = {1998}
}

Bookmark

OpenURL

Abstract

Citations

1813	The Art of Computer Programming - Knuth - 1968
961	A public key cryptosystem and a signature scheme based on discrete logarithms - ElGamal - 1985
687	The arithmetic of elliptic curves - Silverman - 1985
559	Elliptic curve cryptosystem - Koblitz - 1987
445	H.: Finite fields - Lidl, Niederreiter - 1997
419	Uses of elliptic curves in cryptography - Miller - 1985
345	Finite Fields and their Applications - Lidl, Niederreiter - 1984
262	Elliptic Curve Public Key Cryptosystems - Menezes - 1993
243	Reducing elliptic curve logarithms to logarithms in a finite field - Menezes, Okamoto, et al. - 1993
234	New directions in cryptography - e, Hellman - 1976
212	Introduction to Elliptic Curves and Modular Forms - Koblitz - 1984
199	Factoring integers with elliptic curves - Lenstra - 1987
160	A Course in Number Theory and Cryptography - Koblitz - 1994
99	Finite Fields for Computer Scientists and Engineers - McEliece - 1987
96	Fast key exchange with elliptic curve systems - Schroeppel, Orman, et al. - 1995
86	Speeding up the computations on an elliptic curve using addition-subtraction chains - Morain, Olivos - 1990
76	S.: A fast algorithm for computing multiplicative inverses in GF(2 m ) using normal bases - Itoh, Tsujii - 1988
68	Lectures on Elliptic Curves - Cassels - 1991
61	Rational Points on Elliptic Curves - Silverman, Tate - 1992
58	Short programs for functions on curves,” unpublished manuscript - Miller - 1986
51	VLSI Architectures for Computation in Galois Fields - Mastrovito - 1991
50	Applications of Finite Fields - Menezes, Blake, et al.
44	A fast software implementation for arithmetic operation - Win, Bosselaers, et al.
40	An implementation for a fast public-key cryptosystem - Agnew, Mullin, et al. - 1991
38	New public-key schemes based on elliptic curves over the ring zn - Koyama, Maurer, et al.
36	Public-key cryptosystems with very small key lengths - Harper, Menezes, et al. - 1992
33	Mastrovito Multiplier for All Trinomials - Sunar, Koc - 1999
31	Montgomery multiplication - Koç, Acar - 1998
30	Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields - Koç, Sunar - 1998
27	Method and apparatus for public key exchange in a cryptographic system,” United States Patent 5,159,632 - Crandall - 1992
26	A Vanstone, “Elliptic curve cryptosystems and their implementation - Menezes, Scott - 2004
22	Modular Construction of Low Complexity Parallel Multipliers for a Class of Finite Fields GFð2mÞ - Hasan, Wang, et al. - 1992
21	Optimal normal bases - Gao, Lenstra - 1992
21	Optimal normal bases - Mullin, Onyszchuk, et al. - 1998
20	Discrete logarithms - Coppersmith, Odlyzko, et al.
18	Cryptographic key distribution and computation in class groups - McCurley, “Short - 1989
15	A VLSI Architecture for Fast Inversion in GF(2 m - Feng - 1989
15	Constructing elliptic curve cryptosystems in characteristic 2 - Koblitz - 1991
10	Primality testing - Lenstra
8	On the implementation of elliptic curve cryptosystems - Bender, Castagnoli - 1989
7	Almost All Primes Can be Quickly Certi ed - Goldwasser, Kilian - 1986
6	Fast evaluation of logarithms in elds of characteristic two - Coppersmith - 1984
6	Standard speci cations for public-key cryptography. Draft Version 7 - P1363 - 1998
5	An e cient digital signature scheme based on an elliptic curve over the ring zn - Okamoto, Fujioka, et al. - 1993
5	A VLSI design for computing exponentiations in GF (2 m ) and its application to generate pseudorandom number sequences - Wang, Pei - 1990
4	Counting points on elliptic curves over f 2 m - Menezes, Vanstone, et al. - 1993
3	Probabilistic algorithms in nite elds - Ben-Or - 1981
3	The number eld sieve - Lenstra, Lenstra, et al. - 1990
2	Fast computation of discrete logarithms in GF (q - Hellman, Reyneri - 1983
2	VLSI architectures for multiplication over nite eld GF (2 n - Mastrovito - 1988