1 |
N. Koblitz, "Elliptic curve cryptosystems," Mathematics of Computation, vol.48, no.177, pp. 203-209, 1987. DOI: 10.1090/S0025-5718-1987-0866109-5
DOI
|
2 |
National Institute of Standards and Technology (NIST), Digital Signature Standard (DSS), FIPS 186-3, 2009.
|
3 |
SECG SEC1, Elliptic Curve Cryptography, Standards for Efficient Cryptography Group, ver.2, 2009, http://www.secg.org/download/aid-780/sec1-v2.pdf.
|
4 |
V. Gayoso Martinez, F. Hernandez A lvarez, L. Hernandez Encinas and C. Sanchez A vila, "A comparison of the standardized versions of ECIES," 2010 Sixth International Conference on Information Assurance and Security, Atlanta, pp.1-4, 2010. DOI:10.1109/ISIAS.2010.5604194
|
5 |
K. Rabah, "Elliptic Curve ElGamal Encryption and Signature Schemes," Information Technology Journal, vol.4, no.3, pp.299-306, 2005. DOI: 10.3923/itj.2005.299.306
DOI
|
6 |
T. ElGamal, "A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms," IEEE Transactions on Information Theory, vol.31, no.4, pp.469-472, 1985. DOI: 10.1109/TIT.1985.1057074
DOI
|
7 |
W. Trappe, and L. C. Washington. Introduction to Cryptography with Coding Theory. 2nd Edition, Prentice Hall, 2006.
|
8 |
Z. E. Dawahdeh, S. N. Yaakob and A. M. Sagheer, "Modified ElGamal Elliptic Curve Cryptosystem using Hexadecimal Representation," Indian Journal of Science and Technology, vol.8, No.15, pp.1-7, 2015. DOI: 10.17485/ijst/2015/v8i15/64749
|
9 |
E. Bach and K. Huber, "Note on Taking Square-Roots Modulo N," IEEE Transactions on Information Theory, vol.45, no.2, pp.807-809, 1999. DOI: 10.1109/18.749034
DOI
|
10 |
B. King, "Mapping an Arbitrary Message to an Elliptic Curve when Defined over GF(2^n)," International Journal of Network Security, vol.8, no.2, pp.169-176, 2009. DOI: 10.1016/j.jnca.2015.11.011
|
11 |
"Computing square roots mod p,"http://cours e1.winona.edu/eerrthum/13Spring/SquareRoots.pdf
|
12 |
D. Shanks, "Five Number-Theoretic Algorithms," Proceedings of the Second Manitoba Conference on Numerical Mathematics, Congressus Numerantium, no.VII, pp.51-70, 1973.
|
13 |
G. Tornaria, "Square roots modulo p," in LATIN 2002: Theoretical Informatics, S. Rajsbaum, Ed. Berlin, Germany: Springer, pp.430-434, 2002. DOI: 10.1007/3-540-45995-2_38
|
14 |
G. Adj and F. Rodríguez-Henríquez, "Square Root Computation over Even Extension Fields," IEEE Transactions on Computers, vol.63, no.11, pp.2829-2841, 2014. DOI: 10.1109/TC.2013.145
|
15 |
S. H. Lee and K. W. Shin, "An Areaefficient Design of ECC Processor Supporting Multiple Elliptic Curves over GF() and GF()," Proceedings of Conference on Korea Information and Communication Engineering, vol.23, no.1, pp.254-256, 2019. DOI: 10.1109/ACCESS.2019.2958491
|