Results 51 to 60 of about 124 (95)
Implementação eficiente em software de criptossistemas de curvas elipticas [PDF]
, 2018 Orientador: Ricardo DahabTese (doutorado) - Universidade Estadual de Campinas, Instituto de ComputaçãoResumo: A criptografia de chave-pública é, reconhecidamente, uma ferramenta muito útil para prover requisitos de segurança tais como confidencialidade ...
López Hernández, Julio César, 1961-
core
Calcul de représentations galoisiennes modulaires [PDF]
, 2014 It was conjectured in the late 60's by J.-P. Serre and proved in the early 70's by P.Deligne that to each newform f = q +Σn ⩾2 anqn 2 Sk(N; "), k ⩾2, and each primel of the number field Kf = Q(an; n ⩾ 2), is attached an l-adic Galois representationPf;l :
Mascot, Nicolas
core +2 more sources
Schoofův algoritmus pro Weierstrassovy křivky
, 2023 Schoof's algorithm is the starting point for the most efficient methods for determining the number of rational points on an elliptic curve defined over a finite field.
Zvoníček, Václav
core
Schoof's algorithm for Weierstrass curves
, 2023 Schoof's algorithm is the starting point for the most efficient methods for determining the number of rational points on an elliptic curve defined over a finite field.
Zvoníček, Václav
core
Isogenies for point counting on genus two hyperelliptic curves with maximal real multiplication
, 2017 Schoof's classic algorithm allows point-counting for elliptic curves over finite fields in polynomial time. This algorithm was subsequently improved by Atkin, using factorizations of modular polynomials, and by Elkies, using a theory of explicit ...
Ballentine, Sean +9 more
core +2 more sources
Counting points on elliptic curves over finite fields [PDF]
Elliptic curves play an important role in number theory and cryptography. This report explores essential aspects of elliptic curves, such as their group structure and their torsion subgroup and isogenies - with particular emphasis on the Frobenius map ...
BARIL BOUDREAU, Félix, Welter, Ben
core
Elliptic Gau{\ss} sums and Schoof's algorithm
, 2016 We present a new approach to handling the case of Atkin primes in Schoof's algorithm for counting points on elliptic curves over finite fields. Our approach is based on the theory of polynomially cyclic algebras, which we recall as far as necessary. We then proceed to describe our method, which essentially relies on transferring costly computations in ...
openaire +1 more source
New methods for finite field arithmetic [PDF]
We describe novel methods for obtaining fast software implementations of the arithmetic operations in the finite field GF(p) and GF(p[superscript k]). In GF(p) we realize an extensive speedup in modular addition and subtraction routines and some small ...
Yanik, Tuğrul
core +1 more source
, 2013 The plum curculio (Conotrachelus nenuphar Herbst) (Coleoptera: Curculionidae) is an economically and ecologically important pest in North America but is understudied despite having a long history in the scientific literature.
Crane, Samuel N
core
Counting the points on elliptic curves over finite fields
, 2018 The goal of this thesis is to explain and implement Schoof's algorithm for counting points on elliptic curves over finite fields. We start by defining elliptic curve as a set of points satisfying certain equation and then proceeding to define an ...
Eržiak, Igor
core