Sciweavers

36781 search results - page 96 / 7357
» Parameterizing by the Number of Numbers
Sort
View
FSE
2008
Springer
110views Cryptology» more  FSE 2008»
13 years 12 months ago
How to Encrypt with a Malicious Random Number Generator
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 ...
Seny Kamara, Jonathan Katz
DLT
2010
13 years 11 months ago
On the Average Number of States of Partial Derivative Automata
The partial derivative automaton (Apd) is usually smaller than other non-deterministic finite automata constructed from a regular expression, and it can be seen as a quotient of th...
Sabine Broda, António Machiavelo, Nelma Mor...
CSC
2006
13 years 11 months ago
Parallel Computations Reveal Hidden Errors of Commonly Used Random Number Generators
This paper reports that in parallel Monte-Carlo simulations of the 2D Ising-Model, commonly used pseudo-random number generators (PRNG) lead to manifestly erroneous results. When ...
Hyo Ashihara, Ai Kuramoto, Isaku Wada, Makoto Mats...
SODA
2004
ACM
89views Algorithms» more  SODA 2004»
13 years 11 months ago
The number of bit comparisons used by Quicksort: an average-case analysis
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and...
James Allen Fill, Svante Janson
FC
2010
Springer
196views Cryptology» more  FC 2010»
13 years 11 months ago
Secure Computation with Fixed-Point Numbers
Abstract. Secure computation is a promising approach to business problems in which several parties want to run a joint application and cannot reveal their inputs. Secure computatio...
Octavian Catrina, Amitabh Saxena