Results 1 
8 of
8
A Generalized Birthday Problem
 In CRYPTO
, 2002
"... We study a kdimensional generalization of the birthday problem: given k lists of nbit values, nd some way to choose one element from each list so that the resulting k values xor to zero. For k = 2, this is just the extremely wellknown birthday problem, which has a squareroot time algorithm ..."
Abstract

Cited by 93 (0 self)
 Add to MetaCart
We study a kdimensional generalization of the birthday problem: given k lists of nbit values, nd some way to choose one element from each list so that the resulting k values xor to zero. For k = 2, this is just the extremely wellknown birthday problem, which has a squareroot time algorithm with many applications in cryptography.
Tamagawa numbers of diagonal cubic surfaces, numerical evidence
, 2000
"... A refined version of Manin’s conjecture about the asymptotics of points of bounded height on Fano varieties has been developed by Batyrev and the authors. We test numerically this refined conjecture for some diagonal cubic surfaces. ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
A refined version of Manin’s conjecture about the asymptotics of points of bounded height on Fano varieties has been developed by Batyrev and the authors. We test numerically this refined conjecture for some diagonal cubic surfaces.
A Generalized Birthday Problem (extended abstract)
 In Advances in Cryptology – CRYPTO 2002
, 2002
"... We study a kdimensional generalization of the birthday problem: given k lists of nbit values, and some way to choose one element from each list so that the resulting k values xor to zero. For k = 2, this is just the extremely wellknown birthday problem, which has a squareroot time algorithm with ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We study a kdimensional generalization of the birthday problem: given k lists of nbit values, and some way to choose one element from each list so that the resulting k values xor to zero. For k = 2, this is just the extremely wellknown birthday problem, which has a squareroot time algorithm with many applications in cryptography. In this paper, we show new algorithms for the case k > 2: we show a cuberoot time algorithm for the case of k = 4 lists, and we give an algorithm with subexponential running time when k is unrestricted.
What Is the Value of Taxicab(6)?
"... Abstract: For almost 350 years it was known that 1729 is the smallest integer which can be expressed as the sum of two positive cubes in two different ways. Motivated by a famous story involving Hardy and Ramanujan, a class of numbers called Taxicab Numbers has been defined: Taxicab(k, j, n) is the ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract: For almost 350 years it was known that 1729 is the smallest integer which can be expressed as the sum of two positive cubes in two different ways. Motivated by a famous story involving Hardy and Ramanujan, a class of numbers called Taxicab Numbers has been defined: Taxicab(k, j, n) is the smallest number which can be expressed as the sum of jkth powers in n different ways. So, Taxicab(3, 2, 2) = 1729; Taxicab(4, 2, 2) = 635318657. Computing Taxicab Numbers is challenging and interesting, both from mathematical and programming points of view. The exact value of Taxicab(6) = Taxicab(3, 2, 6) is not known; however, recent results announced by Rathbun [R2002] show that Taxicab(6) is in the interval [10 18, 24153319581254312065344]. In this note we show that with probability greater
BIMONOTONE ENUMERATION
, 2009
"... Solutions of a diophantine equation f(a, b)=g(c, d), with a, b, c, d in some finite range, can be efficiently enumerated by sorting the values of f and g in ascending order and searching for collisions. This article considers functions f: N×N → Z that are bimonotone in the sense that f(a, b) ≤ f(a ..."
Abstract
 Add to MetaCart
Solutions of a diophantine equation f(a, b)=g(c, d), with a, b, c, d in some finite range, can be efficiently enumerated by sorting the values of f and g in ascending order and searching for collisions. This article considers functions f: N×N → Z that are bimonotone in the sense that f(a, b) ≤ f(a ′,b ′) whenever a ≤ a ′ and b ≤ b ′. A twovariable polynomial with nonnegative coefficients is a typical example. The problem is to efficiently enumerate all pairs (a, b) such that the values f(a, b) appear in increasing order. We present an algorithm that is memoryefficient and highly parallelizable. In order to enumerate the first n values of f, the algorithm only builds up a priority queue of length at most √ 2n + 1. In terms of bitcomplexity this ensures that the algorithm takes time O(nlog 2 n) and requires memory O ( √ nlog n), which considerably improves on the memory bound Θ(nlog n) provided by a naïve approach, and extends the semimonotone enumeration algorithm previously considered by R.L. Ekl and D.J. Bernstein.
CONTENTS
, 2000
"... ABSTRACT. We consider diagonal cubic surfaces defined by an equation of the form ax 3 + by 3 + cz 3 + dt 3 = 0. Numerically, one can find all rational points of height � B for B in the range of up to 10 5, thanks to a program due to D. J. Bernstein. On the other hand, there are precise conjectures c ..."
Abstract
 Add to MetaCart
ABSTRACT. We consider diagonal cubic surfaces defined by an equation of the form ax 3 + by 3 + cz 3 + dt 3 = 0. Numerically, one can find all rational points of height � B for B in the range of up to 10 5, thanks to a program due to D. J. Bernstein. On the other hand, there are precise conjectures concerning the constants in the asymptotics of rational points of bounded height due to Manin, Batyrev and the authors. Changing the coefficients one can obtain cubic surfaces with rank of the Picard group varying between 1 and 4. We check that numerical data are compatible with the above conjectures. In a previous paper we considered cubic surfaces with Picard groups of rank one with or without BrauerManin obstruction to weak approximation. In this paper, we test the conjectures for diagonal cubic surfaces with Picard groups of higher rank.