Results 1  10
of
24
Synthesizers and Their Application to the Parallel Construction of PseudoRandom Functions
, 1995
"... A pseudorandom function is a fundamental cryptographic primitive that is essential for encryption, identification and authentication. We present a new cryptographic primitive called pseudorandom synthesizer and show how to use it in order to get a parallel construction of a pseudorandom function. ..."
Abstract

Cited by 42 (10 self)
 Add to MetaCart
A pseudorandom function is a fundamental cryptographic primitive that is essential for encryption, identification and authentication. We present a new cryptographic primitive called pseudorandom synthesizer and show how to use it in order to get a parallel construction of a pseudorandom function. We show several NC¹ implementations of synthesizers based on concrete intractability assumptions as factoring and the DiffieHellman assumption. This yields the first parallel pseudorandom functions (based on standard intractability assumptions) and the only alternative to the original construction of Goldreich, Goldwasser and Micali. In addition, we show parallel constructions of synthesizers based on other primitives such as weak pseudorandom functions or trapdoor oneway permutations. The security of all our constructions is similar to the security of the underlying assumptions. The connection with problems in Computational Learning Theory is discussed.
Cyclicity of elliptic curves modulo p and elliptic curve analogues of Linnik’s problem
, 2001
"... 1 Let E be an elliptic curve defined over Q and of conductor N. For a prime p ∤ N, we denote by E the reduction of E modulo p. We obtain an asymptotic formula for the number of primes p ≤ x for which E(Fp) is cyclic, assuming a certain generalized Riemann hypothesis. The error terms that we get are ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
1 Let E be an elliptic curve defined over Q and of conductor N. For a prime p ∤ N, we denote by E the reduction of E modulo p. We obtain an asymptotic formula for the number of primes p ≤ x for which E(Fp) is cyclic, assuming a certain generalized Riemann hypothesis. The error terms that we get are substantial improvements of earlier work of J.P. Serre and M. Ram Murty. We also consider the problem of finding the size of the smallest prime p = pE for which the group E(Fp) is cyclic and we show that, under the generalized Riemann hypothesis, pE = O � (log N) 4+ε � if E is without complex multiplication, and pE = O � (log N) 2+ε � if E is with complex multiplication, for any 0 < ε < 1. 1
Limits to List Decodability of Linear Codes
 In Proc. 34th ACM Symp. on Theory of Computing
, 2002
"... We consider the problem of the best possible relation between the list decodability of a binary linear code and its minimum distance. We prove, under a widelybelieved numbertheoretic conjecture, that the classical "Johnson bound" gives, in general, the best possible relation between the ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
We consider the problem of the best possible relation between the list decodability of a binary linear code and its minimum distance. We prove, under a widelybelieved numbertheoretic conjecture, that the classical "Johnson bound" gives, in general, the best possible relation between the list decoding radius of a code and its minimum distance. The analogous result is known to hold by a folklore random coding argument for the case of nonlinear codes, but the linear case is more subtle and has remained open.
On Hooley's Theorem With Weights
, 1995
"... We adapt Hooley's proof that the Generalized Riemann Hypothesis implies the Artin Conjecture for primitive roots to various other problems. We consider the sum p#x f (i p ) where i p is the index of 2 modulo p and f is a given function. In various cases we establish asymptotic formulas for su ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
We adapt Hooley's proof that the Generalized Riemann Hypothesis implies the Artin Conjecture for primitive roots to various other problems. We consider the sum p#x f (i p ) where i p is the index of 2 modulo p and f is a given function. In various cases we establish asymptotic formulas for such a sum and analyse the constants. While we claim no originality, we outline the method to approach this problem in a fairly general case.
Fast Elliptic Curve Point Counting Using Gaussian Normal Basis
 Proc. of ANTS V, Lecture Notes in Comput. Sci. 2369
, 2002
"... In this paper we present an improved algorithm for counting points on elliptic curves over finite fields. It is mainly based on SatohSkjernaa Taguchi algorithm [SST01], and uses a Gaussian Normal Basis (GNB) of small type t 4. In practice, about 42% (36% for prime N) of fields in cryptograph ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
In this paper we present an improved algorithm for counting points on elliptic curves over finite fields. It is mainly based on SatohSkjernaa Taguchi algorithm [SST01], and uses a Gaussian Normal Basis (GNB) of small type t 4. In practice, about 42% (36% for prime N) of fields in cryptographic context (i.e., for p = 2 and 160 < N < 600) have such bases. They can be lifted from F p N to Z p N in a natural way. From the specific properties of GNBs, e#cient multiplication and the Frobenius substitution are available. Thus a fast norm computation algorithm is derived, which runs in O(N log N) with O(N ) space, where the time complexity of multiplying two nbit objects is O(n ). As a result, for all small characteristic p, we reduced the time complexity of the SSTalgorithm ) and the space complexity still fits in O(N ). Our approach is expected to be applicable to the AGM since the exhibited improvement is not restricted to only [SST01].
THE GENERALIZED ARTIN CONJECTURE AND ARITHMETIC ORBIFOLDS
"... Let K be a number field with positive unit rank, and let OK denote the ring of integers of K. A generalization of Artin’s primitive root conjecture is that that O × K is a primitive root set for infinitely many prime ideals. We prove this with additional conjugacy conditions in the case when K is G ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Let K be a number field with positive unit rank, and let OK denote the ring of integers of K. A generalization of Artin’s primitive root conjecture is that that O × K is a primitive root set for infinitely many prime ideals. We prove this with additional conjugacy conditions in the case when K is Galois with unit rank greater than three. This was previously known under the assumption of the Generalized Riemann Hypothesis. From our result, we deduce a topological corollary about the structure of quotients of PSL2(OK).
Compatible systems of mod p Galois representations II
"... Compatible systems of ndimensional, mod p representations of absolute Galois groups of number fields were considered by Serre in his study of openness of images of adelic Galois representations arising from elliptic curves in [S2]. ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Compatible systems of ndimensional, mod p representations of absolute Galois groups of number fields were considered by Serre in his study of openness of images of adelic Galois representations arising from elliptic curves in [S2].
CONJECTURES INVOLVING ARITHMETICAL SEQUENCES
"... Abstract. We pose thirty conjectures on arithmetical sequences, most of which are about monotonicity of sequences of the form ( n √ an)n�1 or the form ( n+1 √ an+1 / n √ an)n�1, where (an)n�1 is a numbertheoretic or combinatorial sequence of positive integers. This material might stimulate further ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We pose thirty conjectures on arithmetical sequences, most of which are about monotonicity of sequences of the form ( n √ an)n�1 or the form ( n+1 √ an+1 / n √ an)n�1, where (an)n�1 is a numbertheoretic or combinatorial sequence of positive integers. This material might stimulate further research. 1.