Finding Good Random Elliptic Curves for Cryptosystems Defined Over $$ \Mathbb{F}_{{\text{2}}^n } $$

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-69053-0_26
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

A Point Compression Method for Elliptic Curves Defined Over GF(2 N )

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

High Rank Elliptic Curves With Torsion Group $\Mathbb {Z}/(2\mathbb {Z})$

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
2003English

Elliptic Curve Cryptosystems

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1987English

A Family of Elliptic ℚ-Curves Defined Over Biquadratic Fields and Their Modularity

Acta Arithmetica
Number TheoryAlgebra
1999English

Global Bifurcation for Quasilinear Elliptic Equations on $\Mathbb{R}^{N}$

Mathematische Zeitschrift
Mathematics
2001English

$${\Text {Aut}}({\mathbb {F}}_5)$$ Aut ( F 5 ) Has Property (T)

Mathematische Annalen
Mathematics
2019English

Finding Elliptic Curves With a Subgroup of Prescribed Size

International Journal of Number Theory
Number TheoryAlgebra
2016English

Height Difference Bounds for Elliptic Curves Over Number Fields

Journal of Number Theory
Number TheoryAlgebra
2006English

Ranks of Elliptic Curves Over Function Fields

LMS Journal of Computation and Mathematics
Computational TheoryMathematics
2008English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy