76 search results - page 2 / 16 » Pseudorandom Generators for Group Products |
DCC
2007
IEEE
14 years 4 months ago
2007
IEEE
Let p be a prime and let E(IFp) be an elliptic curve defined over the finite field IFp of p elements. For a given point G E(IFp) the linear congruential genarator on elliptic curv...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
The paper develops a novel approach to stream cipher design: Both the state update function and the output function of the corresponding pseudorandom generators are compositions of...
RECOMB
2007
Springer
14 years 5 months ago
2007
Springer
Our group has recently developed a compact, universal protein binding microarray (PBM) that can be used to determine the binding preferences of transcription factors (TFs) [1]. Thi...
IJAC
2007
13 years 5 months ago
2007
In this article we show that every group with a finite presentation satisfying one or both of the small cancellation conditions C (1/6) and C (1/4) − T (4) has the property that...
EUROCRYPT
2005
Springer
13 years 11 months ago
2005
Springer
We prove, under the strong RSA assumption, that the group of invertible integers modulo the product of two safe primes is pseudo-free. More specifically, no polynomial time algor...