On the representation of primes by binary quadratic forms, and elliptic curves
It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's algorithm, which counts the number of $\mathbb F_q$-points of an elliptic curve over a finite field $\mathbb F_q$. F...
Main Authors: | Elia, M, Pintore, F |
---|---|
格式: | Journal article |
出版: |
Pushpa Publishing House
2018
|
相似书籍
Concrete quantum cryptanalysis of binary elliptic curves
由: Gustavo Banegas, et al.
出版: (2020-12-01)
由: Gustavo Banegas, et al.
出版: (2020-12-01)
相似书籍
-
On the discrete logarithm problem for prime-field elliptic curves
由: Amadori, A, et al.
出版: (2018) -
On the Representation of Almost Primes by Sets of Quadratic Forms
由: Marasingha, G
出版: (2006) -
Improved algorithms of elliptic curve point multiplication over binary and prime fields using elliptic net
由: Muslim, Norliana
出版: (2022) -
The birational composition of arbitrary quadratic form with binary quadratic form
由: Alexandr A. Bondarenko
出版: (2022-04-01) -
On the Selmer groups of elliptic curves in quadratic twist families
由: Wong, Siman Yat-Fai
出版: (2007)