Computing Isogenies Between Montgomery Curves Using the Action of (0, 0)-Reference-Cited by-同舟云学术

Computing Isogenies Between Montgomery Curves Using the Action of (0, 0)

Published:2018 Issue: Volume: Page:229-247
ISSN:0302-9743
Container-title:Post-Quantum Cryptography
language:
Short-container-title:

Author:

Renes Joost

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-79063-3_11

Reference27 articles.

1. Accredited Standards Committee X9. American National Standard X9.62-1999, Public key cryptography for the financial services industry: the elliptic curve digital signature algorithm (ECDSA). Technical report, ANSI (1999)

2. Lecture Notes in Computer Science;DJ Bernstein,2015

3. Bernstein, D.J., Duif, N., Lange, T., Schwabe, P., Yang, B.-Y.: High-speed high-security signatures. J. Cryptogr. Eng. 2(2), 77–89 (2012)

4. Lecture Notes in Computer Science;DJ Bernstein,2006

5. Bröker, R.: Constructing supersingular elliptic curves. J. Comb. Number Theory 1(3), 269–273 (2009)

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

1. ISH: Isogeny-based Secret Handshakes with friendly communication costs;Computer Standards & Interfaces;2025-01

2. Montgomery curve arithmetic revisited;Journal of Cryptographic Engineering;2024-05-13

3. Computing 2-isogenies between Kummer lines;IACR Communications in Cryptology;2024-04-09

4. Faster Cryptographic Hash Function from Supersingular Isogeny Graphs;Lecture Notes in Computer Science;2024

5. Revisiting Meet-in-the-Middle Cryptanalysis of SIDH/SIKE with Application to the $IKEp182 Challenge;Lecture Notes in Computer Science;2024