Sciweavers

ANTS
2006
Springer
94views Algorithms» more  ANTS 2006»
13 years 8 months ago
Fast Bounds on the Distribution of Smooth Numbers
Let P(n) denote the largest prime divisor of n, and let (x, y) be the number of integers n x with P(n) y. In this paper we present improvements to Bernstein's algorithm, whi...
Scott T. Parsell, Jonathan Sorenson
ANTS
2006
Springer
100views Algorithms» more  ANTS 2006»
13 years 8 months ago
LLL on the Average
Despite their popularity, lattice reduction algorithms remain mysterious in many ways. It has been widely reported that they behave much more nicely than what was expected from the...
Phong Q. Nguyen, Damien Stehlé
ANTS
2006
Springer
139views Algorithms» more  ANTS 2006»
13 years 8 months ago
Hard Instances of the Constrained Discrete Logarithm Problem
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
ANTS
2006
Springer
78views Algorithms» more  ANTS 2006»
13 years 8 months ago
Hidden Pairings and Trapdoor DDH Groups
This paper suggests a new building block for cryptographic protocols and gives two instantiations of it. The concept is to generate two descriptions of the same group: a public des...
Alexander W. Dent, Steven D. Galbraith
ANTS
2006
Springer
79views Algorithms» more  ANTS 2006»
13 years 8 months ago
Computing a Lower Bound for the Canonical Height on Elliptic Curves over Q
Let E be an elliptic curve over the rationals. A crucial step in determining a Mordell-Weil basis for E is to exhibit some positive lower bound > 0 for the canonical height ^h ...
John Cremona, Samir Siksek
ANTS
2006
Springer
73views Algorithms» more  ANTS 2006»
13 years 8 months ago
The Elliptic Curve Database for Conductors to 130000
Abstract. Tabulating elliptic curves has been carried out since the earliest days of machine computation in number theory. After some historical remarks, we report on significant r...
John Cremona
ANTS
2006
Springer
101views Algorithms» more  ANTS 2006»
13 years 8 months ago
High Security Pairing-Based Cryptography Revisited
The security and performance of pairing based cryptography has provoked a large volume of research, in part because of the exciting new cryptographic schemes that it underpins. We ...
Robert Granger, Dan Page, Nigel P. Smart
ANTS
2006
Springer
93views Algorithms» more  ANTS 2006»
13 years 8 months ago
Classification of Genus 3 Curves in Special Strata of the Moduli Space
Abstract. We describe the invariants of plane quartic curves -- nonhyperelliptic genus 3 curves in their canonical model -- as determined by Dixmier and Ohno, with application to t...
Martine Girard, David R. Kohel
ANTS
2006
Springer
91views Algorithms» more  ANTS 2006»
13 years 8 months ago
Practical Lattice Basis Sampling Reduction
We propose a practical sampling reduction algorithm for lattice bases based on work by Schnorr [1] as well as two even more effective generalizations. We report the empirical behav...
Johannes Buchmann, Christoph Ludwig