Results 11 to 20 of about 124 (95)
Remarks on the Schoof-Elkies-Atkin algorithm [PDF]
Mathematics of Computation, 1998 Schoof’s algorithm computes the number m m of points on an elliptic curve E E defined over a finite field F q {\Bbb F}_q . Schoof determines m m modulo small primes ℓ \ell using the characteristic equation of ...
openaire +2 more sources
Data Prevention Technique For Securing The Data [PDF]
, 2021 The main aim of this paper is to safeguard information through data security and is considered convergence, exploration, infiltration, and footprint. Cloud computing can be a computer-based type of computer that provides numerous PCs and devices looking ...
et. al., Christy A,
core +1 more source
Efficient Implementation of Schoof’s Algorithm in Case of Characteristic 2 [PDF]
, 2000 In order to choose a secure elliptic curve for Elliptic Curve Cryptosystems, it is necessary to count the order of a randomly selected elliptic curve. Schoof’s algorithm and its variants by Elkies and Atkin are known as efficient methods to count the orders of elliptic curves.
Tetsuya Izu +2 more
openaire +1 more source
Modular equations for hyperelliptic curves [PDF]
, 2005 We define modular equations describing the l-torsion subgroups of the Jacobian of a hyperelliptic curve. Over a finite base field, we prove factorization properties that extend the well-known results used in Atkin's improvement of Schoof's genus 1 point ...
Gaudry, Pierrick, Schost, Eric
core +3 more sources
Construction of secure random curves of genus 2 over prime fields
, 2004 International audienceFor counting points of Jacobians of genus 2 curves defined over large prime fields, the best known method is a variant of Schoof's algorithm.
Gaudry, Pierrick, Schost, Eric
core +3 more sources
A Review on Elliptic Curve Cryptography for Embedded Systems [PDF]
, 2011 Importance of Elliptic Curves in Cryptography was independently proposed by Neal Koblitz and Victor Miller in 1985.Since then, Elliptic curve cryptography or ECC has evolved as a vast field for public key cryptography (PKC) systems. In PKC system, we use
Afreen, Rahat, Mehrotra, S. C.
core +2 more sources
Security Analysis of Elliptic Curves over Sextic Extension of Small Prime Fields [PDF]
, 2022 In this report we investigate how to generate secure elliptic curves over sextic extension of prime fields of size roughly 64 bits to achieve 128-bit security. In particular, we present one of such curves over a 64-bit prime field, which we named Cheetah,
Robin Salen +2 more
core
Geophysical Research Letters, Volume 53, Issue 1, 16 January 2026.Abstract Coupled climate‐ice‐sheet modeling is still in its developing stage, and feedback processes between ice sheets and climate are still not yet fully understood. Here, we use simulations with a coupled climate‐ice‐sheet model to investigate teleconnections between Northern Hemispheric ice sheets and the Antarctic ice sheet (AIS) without direct ...
Pierre Testorf +3 more
wiley +1 more source
Multi‐Year Ice Dynamics at Køge Bugt Central Glacier Controlled by Bed Topography
Geophysical Research Letters, Volume 52, Issue 20, 28 October 2025.Abstract Køge Bugt Central (KBC) is Greenland's fourth largest outlet glacier in terms of ice discharge. However, the drivers behind its substantial multi‐year variations in ice dynamics remain unknown. In this study, we use remotely sensed data sets of ice surface velocity, ice surface elevation, ice discharge, and terminus position, in combination ...
H. J. Picton, P. W. Nienow
wiley +1 more source
Computing Zeta Functions of Hyperelliptic Curves over Finite Fields of Characteristic 2 [PDF]
, 2002 We present an algorithm for computing the zeta function of an arbitrary hyperelliptic curve over a finite field Fq of characteristic 2, thereby extending the algorithm of Kedlaya for small odd characteristic. For a genus g hyperelliptic curve over n ,
Frederik Vercauteren
core +1 more source