ANTS 2006 - PDF Preprint Papers

ANTS 2006 International Algorithmic Number Theory Symposium

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ANTS-2006 Paper

click to vote

ANTS
2006
Springer

139views Algorithms» more ANTS 2006»

Hard Instances of the Constrained Discrete Logarithm Problem

14 years 4 months ago

Download research.microsoft.com

The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent x belongs to a set known to the attacker. The complexity of generic algorithms f...

Ilya Mironov, Anton Mityagin, Kobbi Nissim

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	139	Hard Instances of the Constrained Discrete Logarithm Problem	claim
2	136	On the Randomness of Bits Generated by Sufficiently Smooth Functions	claim
3	132	20 Years of ECM	claim
4	127	Doubly-Focused Enumeration of Pseudosquares and Pseudocubes	claim
5	125	Arithmetic of Generalized Jacobians	claim
6	125	Heegner Point Computations Via Numerical p-Adic Integration	claim
7	123	Computing CM Points on Shimura Curves Arising from Cocompact Arithmetic Triangle Groups	claim
8	122	The Mertens Conjecture Revisited	claim
9	118	Computation of Locally Free Class Groups	claim
10	118	Construction of Rational Points on Elliptic Curves over Finite Fields	claim
11	114	The Pseudosquares Prime Sieve	claim
12	105	Determined Sequences, Continued Fractions, and Hyperelliptic Curves	claim
13	105	A Modular Method for Computing the Splitting Field of a Polynomial	claim
14	101	High Security Pairing-Based Cryptography Revisited	claim
15	100	LLL on the Average	claim
16	99	The Asymptotics of Points of Bounded Height on Diagonal Cubic and Quartic Threefolds	claim
17	95	Computing Pro-P Galois Groups	claim
18	95	Constructing Pairing-Friendly Elliptic Curves with Embedding Degree 10	claim
19	94	Fast Bounds on the Distribution of Smooth Numbers	claim
20	93	Testing Equivalence of Ternary Cubics	claim
21	93	Classification of Genus 3 Curves in Special Strata of the Moduli Space	claim
22	91	Practical Lattice Basis Sampling Reduction	claim
23	79	Computing a Lower Bound for the Canonical Height on Elliptic Curves over Q	claim
24	78	Hidden Pairings and Trapdoor DDH Groups	claim
25	75	Symmetric Powers of Elliptic Curve L-Functions	claim
26	73	The Elliptic Curve Database for Conductors to 130000	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers