8 search results - page 1 / 2 » Construction of Large Families of Pseudorandom Subsets of th... |
IJNSEC
2010
12 years 11 months ago
2010
Pseudo-random subsets of the set {1, 2, . . . , N} have many applications in the fields of network security, cryptography and other security issues. Recently, Dartyge and S
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...
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
A family of subsets C of [n] def = {1, . . . , n} is (r, t)exclusive if for every S ⊂ [n] of size at least n − r, there exist S1, . . . , St ∈ C with S = S1∪S2∪· · · ...
ASAP
2004
IEEE
13 years 8 months ago
2004
IEEE
Binary finite fields GF(2n ) are very commonly used in cryptography, particularly in publickey algorithms such as Elliptic Curve Cryptography (ECC). On word-oriented programmable ...
FCT
2005
Springer
13 years 10 months ago
2005
Springer
We understand selection by intersection as distinguishing a single element of a set by the uniqueness of its occurrence in some other set. More precisely, given two sets A and B, i...