1 |
W. Stallings, Cryptography and Network Security: Principles and Practice, 2nd Edition, New Jersey, Prentice Hall Inc., 1999.
|
2 |
D. E. Knuth, The Art of Computer Programming: Semi-numerical Algorithms, Addison-Wesley, 3rd ed. Reading, MA, 1998.
|
3 |
J. Guo, and C. Wang, “Systolic Array Implementation of Euclidian's Algorithm for Inversion and Division in GF,” IEEE Trans. Computers, Vol.47, No.10, Oct., pp.1161-1167, 1998.
DOI
ScienceOn
|
4 |
C.-H. Kim, S.-H. Kwon, J.-J. Kim, and C.-P. Hong, “A Compact and Fast Division Architecture for a Finite Field,” Proc. ICCSA2003, LNCS, Vol.2667, pp.855-864, Aug., 2003.
DOI
|
5 |
N. Sklavos, K. Papadomanolakis, P. Kitsos and O. Koufopavlou, “Euclidean Algorithm VLSI Implementations,” Proc.IEEE-ICECS'02, Vol. II, pp. 557-560, Sep., 2002.
|
6 |
H. Brunner, A. Curiger, and M. Hofstetter, “On Computing Multiplicative Inverses in GF( ),” IEEE Trans. on Computers, Vol.42, No.8, pp.1010-1015, Aug., 1993.
DOI
ScienceOn
|
7 |
R. Kannan, G. Miller, and L. Rudolph, “Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers,” SIAM Journal on Computing, Vol.16, No.1, pp.7-16, 1987.
DOI
ScienceOn
|
8 |
Sidi Mohamed Sedjelmaci, “A Parallel Extended GCD Algorithm,” J. of Discrete Algorithms, Vol.6, No.3, pp.526-538, 2008.
DOI
ScienceOn
|
9 |
A. Daly, W. P. Marnane, T. Kerins, and E. Popovici, “Fast Modular Division for Application in ECC on Reconfigurable Logic,” 13th International Conference FPL 2003, pp.786-795, Sep., 2003.
DOI
|
10 |
G. M. de Dormale, P. Bulens, and J.-J. Quisquater, “Efficient Modular Division Implementation (ECC over GF(p) Affine Coordinates Application),” 14th International Conference FPL 2004, 23-240, Aug., 2004.
|
11 |
Certicom Research, “SEC2: Recommended Elliptic Curve Cryptography Domain Parameters,” 1999.
|