On the Efficient Generation of Prime-Order Elliptic Curves-Reference-Cited by-同舟云学术

On the Efficient Generation of Prime-Order Elliptic Curves

Published:2009-03-31 Issue:3 Volume:23 Page:477-503
ISSN:0933-2790
Container-title:Journal of Cryptology
language:en
Short-container-title:J Cryptol

Author:

Konstantinou Elisavet,Kontogeorgis Aristides,Stamatiou Yannis C,Zaroliagis Christos

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,Software

Link

http://link.springer.com/content/pdf/10.1007/s00145-009-9037-2.pdf

Reference41 articles.

1. A.O.L. Atkin, F. Morain, Elliptic curves and primality proving. Math. Comput. 61, 29–67 (1993)

2. Lecture Notes in Computer Science;H. Baier,2001

3. H. Baier, Efficient algorithms for generating elliptic curves over finite fields suitable for use in cryptography. PhD Thesis, Dept. of Computer Science, Technical Univ. of Darmstadt, May 2002

4. Lecture Notes in Computer Science;H. Baier,2000

5. E.R. Berlekamp, Factoring polynomials over large finite fields. Math. Comput. 24, 713–735 (1970)

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

1. On Random Number Generation for Kernel Applications;Fundamenta Informaticae;2022-06-21

2. Evaluation of Computational Approaches of Short Weierstrass Elliptic Curves for Cryptography;Cybernetics and Information Technologies;2021-12-01

3. Genus 2 Hyperelliptic Curve Families with Explicit Jacobian Order Evaluation and Pairing-Friendly Constructions;Pairing-Based Cryptography – Pairing 2012;2013

4. Securing Embedded Computing Systems through Elliptic Curve Cryptography;Embedded Computing Systems