Computing Discrete Logarithms in High-Genus Hyperelliptic Jacobians in Provably Subexponential Time

Mathematics of Computation - United States
doi 10.1090/s0025-5718-01-01363-1
Full Text
Abstract

Available in full text

Date
Authors
Publisher

American Mathematical Society (AMS)

Related search

Ordinary Pairing-Friendly Genus 2 Hyperelliptic Curves With Absolutely Simple Jacobians

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation

English

The Rank of Hyperelliptic Jacobians in Families of Quadratic Twists

Journal de Theorie des Nombres de Bordeaux
Number TheoryAlgebra
2006English

Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms

English

Computing Theta Functions in Quasi-Linear Time in Genus Two and Above

LMS Journal of Computation and Mathematics
Computational TheoryMathematics
2016English

Solving Discrete Logarithms From Partial Knowledge of the Key

English

High Adaptive Fault Tolerance in Real Time Cloud Computing

IOSR Journal of Engineering
2014English

A Family of Jacobians Suitable for Discrete Log Cryptosystems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1990English

A New Digital Signature Scheme Based on Factoring and Discrete Logarithms

Journal of Mathematics and Statistics
MathematicsStatisticsProbability
2008English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy