Results 31 to 40 of about 306 (153)
Hyperelliptic Curves and Cryptography [PDF]
, 2003 In 1989, Koblitz proposed using the jacobian of a hyperelliptic curve de ned over a nite eld to implement discrete logarithm cryptographic protocols.
Andreas Stein +3 more
core +1 more source
Distortion maps for supersingular genus two curves
Journal of Mathematical Cryptology, 2009 Distortion maps are a useful tool for pairing based cryptography. Compared with elliptic curves, the case of hyperelliptic curves of genus g > 1 is more complicated, since the full torsion subgroup has rank 2g.
Galbraith Steven D. +3 more
doaj +1 more source
Fast genus 2 arithmetic based on Theta functions
Journal of Mathematical Cryptology, 2007 In 1986, D. V. Chudnovsky and G. V. Chudnovsky proposed to use formulae coming from Theta functions for the arithmetic in Jacobians of genus 2 curves.
Gaudry P.
doaj +1 more source
Fast FPGA Implementations of Diffie-Hellman on the Kummer Surface of a Genus-2 Curve
Transactions on Cryptographic Hardware and Embedded Systems, 2018 We present the first hardware implementations of Diffie-Hellman key exchange based on the Kummer surface of Gaudry and Schost’s genus-2 curve targeting a 128-bit security level.
Philipp Koppermann +3 more
doaj +1 more source
Constructing hyperelliptic curves of genus 2 suitable for cryptography [PDF]
Mathematics of Computation, 2002 In this article we show how to generalize the CM-method for elliptic curves to genus two. We describe the algorithm in detail and discuss the results of our implementation.
openaire +1 more source
Mayfly optimistic hyperelliptic curve cryptosystem
Frontiers in Computer ScienceVarious applications use asymmetric cryptography to secure communications between both parties, and it raises the main issue of generating vast amounts of computation and storage.
Ramireddy Nava Teja Reddy +7 more
doaj +1 more source
Hardware/Software Co-design for Hyperelliptic Curve Cryptography (HECC) on the 8051 μP [PDF]
, 2005 Implementing public-key cryptography on platforms with limited resources, such as microprocessors, is a challenging task. Hardware/software co-design is often the only answer to implement the computationally intensive operations with limited memory and power at an acceptable speed.
Lejla Batina +4 more
openaire +1 more source
Enhanced Biometric Recognition for Secure Authentication Using Iris Preprocessing and Hyperelliptic Curve Cryptography [PDF]
Wireless Communications and Mobile Computing, 2020 Biometrics combined with cryptography can be employed to solve the conceptual and factual identity frauds in digital authentication. Biometric traits are proven to provide enhanced security for detecting crimes because of its interesting features such as accuracy, stability, and uniqueness.
Vani Rajasekar, J. Premalatha, K. Sathya
openaire +1 more source
Mathematika, Volume 72, Issue 2, April 2026.Abstract In this paper, we study traces of Hecke operators on Drinfeld modular forms of level 1 in the case A=Fq[T]$A = \mathbb {F}_q[T]$. We deduce closed‐form expressions for traces of Hecke operators corresponding to primes of degree at most 2 and provide algorithms for primes of higher degree.
Sjoerd de Vries
wiley +1 more source
Siegel–Veech constants for cyclic covers of generic translation surfaces
Journal of the London Mathematical Society, Volume 113, Issue 1, January 2026.Abstract We compute the asymptotic number of cylinders, weighted by their area to any nonnegative power, on any cyclic branched cover of any generic translation surface in any stratum. Our formulae depend only on topological invariants of the cover and number‐theoretic properties of the degree: in particular, the ratio of the related Siegel–Veech ...
David Aulicino +4 more
wiley +1 more source