2237 search results - page 184 / 448 » On the Security of Random Sources |
178
click to vote
EUROGP
2001
Springer
15 years 11 months ago
2001
Springer
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...
182
click to vote
ICMCS
1998
IEEE
15 years 11 months ago
1998
IEEE
Current video compression formats optimize for either compression or editing. For example, motion-JPEG (MJPEG) provides excellent random access and moderate overall compression, w...
223
click to vote
CRYPTO
2010
Springer
15 years 8 months ago
2010
Springer
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
155
click to vote
CTRSA
2003
Springer
16 years 7 days ago
2003
Springer
We present extremely simple ways of embedding a backdoor in the key generation scheme of RSA. Three of our schemes generate two genuinely random primes p and q of a given size, to...
196
Voted
CRYPTO
1997
Springer
15 years 11 months ago
1997
Springer
Consider a situation in which the transmission of encrypted messages is intercepted by an adversary who can later ask the sender to reveal the random choices and also the secret ...