Random Euclidean Addition Chain Generation and Its Application to Point Multiplication-Reference-Cited by-同舟云学术

Random Euclidean Addition Chain Generation and Its Application to Point Multiplication

Published:2010 Issue: Volume: Page:238-261
ISSN:0302-9743
Container-title:Progress in Cryptology - INDOCRYPT 2010
language:
Short-container-title:

Author:

Herbaut Fabien,Liardet Pierre-Yvan,Méloni Nicolas,Téglia Yannick,Véron Pascal

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-17401-8_18

Reference42 articles.

1. Bernstein, D.J., Lange, T.: Explicit-formulas database, http://hyperelliptic.org/EFD

2. Lecture Notes in Computer Science;D.J. Bernstein,2007

3. Bos, J.W., Kaihara, M.E., Kleinjung, T., Lenstra, A.K., Montgomery, P.L.: On the security of 1024-bit rsa and 160-bit elliptic curve cryptography. Technical report, EPFL IC LACAL and Alcatel-Lucent Bell Laboratories and Microsoft Research (2009)

4. Boyko, V., Peinado, M., Venkatesan, R.: Speeding up discrete log and factoring based schemes via precomputations (1998)

5. Lecture Notes in Computer Science;E. Brier,2002

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. New Versions of Miller-loop Secured Against Side-Channel Attacks;Arithmetic of Finite Fields;2023

2. Compact Variable-base ECC Scalar Multiplication using Euclidean Addition Chains;Proceedings of the 18th International Conference on Security and Cryptography;2021

3. Euclidean addition chains scalar multiplication on curves with efficient endomorphism;Journal of Cryptographic Engineering;2018-05-17

4. Evolutionary programming for the length minimization of addition chains;Engineering Applications of Artificial Intelligence;2015-01

5. Efficient Self-pairing on Ordinary Elliptic Curves;Lecture Notes in Computer Science;2013