caa a22 4500 475807502 CHVBK 20180406123751.0 cr unu---uuuuu 170329e20000301xx s 000 0 eng 10.1023/A:1008306223194 doi (NATIONALLICENCE)springer-10.1023/A:1008306223194 Solinas Jerome National Security Agency, 20755, Ft. Meade, MD, USA aut Efficient Arithmetic on Koblitz Curves [Elektronische Daten] [Jerome Solinas] It has become increasingly common to implement discrete-logarithm based public-key protocols on elliptic curves over finite fields. The basic operation is scalar multiplication: taking a given integer multiple of a given point on the curve. The cost of the protocols depends on that of the elliptic scalar multiplication operation. Koblitz introduced a family of curves which admit especially fast elliptic scalar multiplication. His algorithm was later modified by Meier and Staffelbach. We give an improved version of the algorithm which runs 50 than any previous version. It is based on a new kind of representation of an integer, analogous to certain kinds of binary expansions. We also outline further speedups using precomputation and storage. Kluwer Academic Publishers, 2000 elliptic curves nationallicence exponentiation nationallicence public-key cryptography nationallicence Designs, Codes and Cryptography Kluwer Academic Publishers 19/2-3(2000-03-01), 195-249 0925-1022 19:2-3<195 2000 19 10623 https://doi.org/10.1023/A:1008306223194 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1023/A:1008306223194 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Solinas Jerome National Security Agency, 20755, Ft. Meade, MD, USA aut NATIONALLICENCE 773 0- Designs, Codes and Cryptography Kluwer Academic Publishers 19/2-3(2000-03-01), 195-249 0925-1022 19:2-3<195 2000 19 10623 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer