On repeated squarings in binary fields

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

Volumn 5867 LNCS, Issue , 2009, Pages 331-349

  Järvinen, Kimmo U ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY FIELDS; DELAY OVERHEADS; EFFICIENT IMPLEMENTATION; ELLIPTIC CURVE CRYPTOGRAPHY; EXPONENTIATIONS; FINITE FIELDS; FPGA-BASED IMPLEMENTATION; KOBLITZ CURVES; LOOK UP TABLE; OPTIMUM CONSTRUCTION; POLYNOMIAL BASIS; SCALAR MULTIPLICATION; SIDE CHANNEL ATTACK;

COMPUTER SCIENCE; FIELD PROGRAMMABLE GATE ARRAYS (FPGA); TABLE LOOKUP;

CRYPTOGRAPHY;

EID: 70549099927     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-05445-7_21     Document Type: Conference Paper

References (21)

1. Miller, V.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417-426. Springer, Heidelberg (1986)
2. Koblitz, N.: Elliptic curve cryptosystems. Math. Comput. 48, 203-209 (1987)
3. m) using normal bases. Inf. Comput. 78, 171-177 (1988)
4. Guajardo, J., Paar, C.: Itoh-Tsujii inversion in standard basis and its application in cryptography and codes. Designs Codes Cryptogr. 25, 207-216 (2002)
5. Koblitz, N.: CM-curves with good cryptographic properties. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 279-287. Springer, Heidelberg (1992)
6. Järvinen, K., Skyttä, J.: Fast point multiplication on Koblitz curves: Parallelization method and implementations. Microprocess. Microsyst. 33, 106-116 (2009)
7. Rebeiro, C., Mukhopadhyay, D.: High speed compact elliptic curve cryptoproces-sor for FPGA platforms. In: Chowdhury, D.R., Rijmen, V., Das, A. (eds.) IN-DOCRYPT 2008. LNCS, vol. 5365, pp. 376-388. Springer, Heidelberg (2008)
8. Wollinger, T., Guajardo, J., Paar, C.: Security on FPGAs: State-of-the-art implementations and attacks. ACM Trans. Embedd. Comput. Syst. 3, 534-574 (2004)
9. Lutz, J., Hasan, A.: High performance FPGA based elliptic curve cryptographic co-processor. In: International Conference on Information Technology: Coding and Computing, vol. 2, pp. 486-492. IEEE Computer Society, Los Alamitos (2004)
10. National Institute of Standards and Technology (NIST): Digital signature standard (DSS). Federal Information Processing Standard, FIPS PUB 186-2 (2000)
11. Ahmadi, O., Hankerson, D., Rodríguez-Henríquez, F.: Parallel formulations of scalar multiplication on Koblitz curves. J. Univers. Comput. Sci. 14, 481-504 (2008)
12. Gordon, D.M.: A survey of fast exponentiation methods. J. Algorithms 27, 129-146 (1998)
13. Solinas, J.A.: Efficient arithmetic on Koblitz curves. Designs Codes Cryptogr. 19, 195-249 (2000)
14. m). In: Tavares, S., Meijer, H. (eds.) SAC 1998. LNCS, vol. 1556, pp. 201-212. Springer, Heidelberg (1999)
15. Kocher, P., Jaffe, J., Jun, B.: Differential power analysis. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 388-397. Springer, Heidelberg (1999)
16. Hasan, M.A.: Power analysis attacks and algorithmic approaches to their counter-measures for Koblitz curve cryptosystems. IEEE Trans. Comput. 50, 1071-1083 (2001)
17. Chelton, W.N., Benaissa, M.: Fast elliptic curve cryptography on FPGA. IEEE Trans. Very Large Scale Integr (VLSI) Syst. 16, 198-205 (2008)
18. Vuillaume, C., Okeya, K., Takagi, T.: Short-memory scalar multiplication for Koblitz curves. IEEE Trans. Comput. 57, 481-489 (2008)
19. Dimitrov, V.S., Järvinen, K.U., Jacobson, M.J., Chan, W.F., Huang, Z.: Provably sublinear point multiplication on Koblitz curves and its hardware implementation. IEEE Trans. Comput. 57, 1469-1481 (2008)
20. m) for all trinomials. IEEE Trans. Comput. 57, 471-480 (2008)
21. m). IEEE Trans. Comput. 51, 972-975 (2002)