The Discrete Logarithm Hides $O(\log N)$ Bits

SIAM Journal on Computing - United States
doi 10.1137/0217021
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

Discrete Logarithm Based Protocols

English

The Discrete Logarithm Problem With Auxiliary Inputs

English

An O(N Log N) Algorithm for Shape Modeling.

Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
1996English

On the Discrete Logarithm Problem for Plane Curves

Journal de Theorie des Nombres de Bordeaux
Number TheoryAlgebra
2012English

An O(log N) Dynamic Router-Table Design

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
2004English

On the Discrete Logarithm Problem in Elliptic Curves II

Algebra and Number Theory
Number TheoryAlgebra
2013English

An $O(n^2 \Log N)$ Time Algorithm for the Minmax Angle Triangulation

SIAM Journal on Scientific and Statistical Computing
1992English

RANDOMIZATION YIELDS SIMPLE O(n Log⋆ N) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS

International Journal of Computational Geometry and Applications
GeometryApplied MathematicsComputational TheoryComputational MathematicsMathematicsTheoretical Computer ScienceTopology
1992English

An Improved Pseudo-Random Generator Based on the Discrete Logarithm Problem

Journal of Cryptology
Applied MathematicsComputer Science ApplicationsSoftware
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy