Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation

doi 10.1007/3-540-46416-6_24
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Springer Berlin Heidelberg

Related search

A New Digital Signature Scheme Based on Factoring and Discrete Logarithms

Journal of Mathematics and Statistics
MathematicsStatisticsProbability
2008English

Factoring Integers Using SIMD Sieves

English

Diophantine Approximation

2004English

Diophantine Approximation

Lecture Notes in Mathematics
Number TheoryAlgebra
1991English

Speeding Up Discrete Log and Factoring Based Schemes via Precomputations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

Linear Independence of -Logarithms Over the Eisenstein Integers

International Journal of Mathematics and Mathematical Sciences
Mathematics
2010English

Billiard and Diophantine Approximation

Acta Arithmetica
Number TheoryAlgebra
2008English

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

English

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

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
2001English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy