932 search results - page 3 / 187 » Uniform Random Number Generators |
FSE
2008
Springer
13 years 8 months ago
2008
Springer
Chosen-plaintext attacks on private-key encryption schemes are currently modeled by giving an adversary access to an oracle that encrypts a given message m using random coins that ...
CPC
2006
13 years 6 months ago
2006
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a c...
ECMDAFA
2009
Springer
14 years 28 days ago
2009
Springer
The size and the number of models is drastically increasing, preventing organizations from fully exploiting Model Driven Engineering benefits. Regarding this problem of scalabilit...
RSA
2008
13 years 5 months ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
NORDSEC
2009
Springer
14 years 27 days ago
2009
Springer
In our paper, we analyze possibilities to generate true random data in mobile devices such as mobile phones or pocket computers. We show how to extract arguably true random data w...