On Exponential Sums and Group Generators for Elliptic Curves over Finite Fields-Reference-Cited by-同舟云学术

On Exponential Sums and Group Generators for Elliptic Curves over Finite Fields

Published:2000 Issue: Volume: Page:395-404
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Kohel David R.,Shparlinski Igor E.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/10722028_24

Reference20 articles.

1. Bach, E., Shallit, J.: Algorithmic Number Theory. MIT Press, Cambridge (1996)

2. Bombieri, E.: On exponential sums in finite fields. Amer. J. Math. 88, 71–105 (1966)

3. Chalk, J.H.H.: Polynomial congruences over incomplete residue systems modulo k. Proc. Kon. Ned. Acad. Wetensch. A92, 49–62 (1989)

4. Cohen, H.: A Course in Computational Algebraic Number Theory. Springer, Heidelberg (1997)

5. Elkies, N.: Elliptic and modular curves over finite fields and related computational issues. Computational perspectives on number theory (Chicago, IL, 1995), Stud. Adv. Math., 7, 21–76. Amer. Math. Soc., Providence, RI (1998)

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

1. Group structure of elliptic curves over ℤ/Nℤ;Journal of Mathematical Cryptology;2024-01-01

2. Linear complexity of some sequences derived from hyperelliptic curves of genus 2;Cryptography and Communications;2021-08-20

3. On the elliptic curve endomorphism generator;Designs, Codes and Cryptography;2017-07-03

4. Two-Source Randomness Extractors for Elliptic Curves for Authenticated Key Exchange;Codes, Cryptology and Information Security;2017

5. A new approach to decrease the computational complexity of e‐voting protocols;Transactions on Emerging Telecommunications Technologies;2016-12-23