Koblitz curves and integer equivalents of frobenius expansions

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

Volumn 4876 LNCS, Issue , 2007, Pages 126-137

  Brumley, Billy Bob ^a   Järvinen, Kimmo ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

Digital signatures; Elliptic curve cryptography; Koblitz curves

Indexed keywords

COMPUTATIONAL METHODS; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; RANDOM PROCESSES; SECURITY OF DATA;

ELLIPTIC CURVE CRYPTOGRAPHY; KOBLITZ CURVES;

CRYPTOGRAPHY;

EID: 38549165100     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77360-3_9     Document Type: Conference Paper

References (14)

1. Koblitz, N.: CM-curves with good cryptographic properties. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 279-287. Springer, Heidelberg (1992)
2. Meier, W., Staffelbach, O.: Efficient multiplication on certain nonsupersingular elliptic curves. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 333-344. Springer, Heidelberg (1993)
3. Solinas, J.A.: An improved algorithm for arithmetic on a family of elliptic curves. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp.357-371. Springer, Heidelberg (1997)
4. Solinas, J.A.: Efficient arithmetic on Koblitz curves. Des. Codes Cryptogr. 19(2-3), 195-249 (2000)
5. Lange, T., Shparlinski, I.: Collisions in fast generation of ideal classes and points on hyperelliptic and elliptic curves. Appl. Algebra Engrg. Comm. Comput. 15(5), 329-337 (2005)
6. Lange, T., Shparlinski, I.E.: Certain exponential sums and random walks on elliptic curves. Canad. J. Math. 57(2), 338-350 (2005)
7. Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Information Theory IT-22(6), 644-654 (1976)
8. ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 10-18. Springer, Heidelberg (1985)
9. National Institute of Standards and Technology (NIST): Digital signature standard (DSS). Federal Information Processing Standard, FIPS PUB 186-2 (2000)
10. Lange, T.: Koblitz curve cryptosystems. Finite Fields Appl. 11(2), 200-229 (2005)
11. Järvinen, K., Forsten, J., Skyttä, J.: Efficient circuitry for computing τ-adic non-adjacent form. In: ICECS 2006. Proc. of the IEEE Int'l. Conf. on Electronics, Circuits and Systems, Nice, France, pp. 232-235 (2006)
12. Dimitrov, V.S., Järvinen, K.U., Jacobson, J.M.J., Chan, W.F., Huang, Z.: FPGA implementation of point multiplication on Koblitz curves using Kleinian integers. In: Goubin, L., Matsui, M. (eds.) CHES 2006. LNCS, vol. 4249, pp. 445-459. Springer, Heidelberg (2006)
13. Lutz, J., Hasan, M.A.: High performance FPGA based elliptic curve cryptographic co-processor. In: Goubin, L., Matsui, M. (eds.) ITCC 2004. International Conference on Information Technology: Coding and Computing, vol. 02, pp. 486-492. IEEE Computer Society Press, Los Alamitos (2004)
14. Standaert, F.X., Peeters, E., Rouvroy, G., Quisquater, J.J.: An overview of power analysis attacks against field programmable gate arrays. Proc. IEEE 94(2), 383-394 (2006)