Sciweavers

13214 search results - page 3 / 2643
» Pseudorandomness for network algorithms
Sort
View
IMA
2009
Springer
131views Cryptology» more  IMA 2009»
14 years 4 months ago
An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm Problems
Gaudry and Schost gave a low-memory algorithm for solving the 2-dimensional discrete logarithm problem. We present an improvement to their algorithm and extend this improvement to ...
Steven D. Galbraith, Raminder S. Ruprai
ATS
2000
IEEE
149views Hardware» more  ATS 2000»
14 years 2 months ago
Efficient built-in self-test algorithm for memory
We present a new pseudorandom testing algorithm for the Built-In Self-Test (BIST) of DRAM. In this algorithm, test patterns are complemented to generate state-transitions that are...
Sying-Jyan Wang, Chen-Jung Wei
GECCO
2005
Springer
154views Optimization» more  GECCO 2005»
14 years 3 months ago
Genetic algorithms using low-discrepancy sequences
The random number generator is one of the important components of evolutionary algorithms (EAs). Therefore, when we try to solve function optimization problems using EAs, we must ...
Shuhei Kimura, Koki Matsumura
ACNS
2010
Springer
159views Cryptology» more  ACNS 2010»
14 years 2 months ago
A Message Recognition Protocol Based on Standard Assumptions
We look at the problem of designing Message Recognition Protocols (MRP) and note that all proposals available in the literature have relied on security proofs which hold in the ran...
Atefeh Mashatan, Serge Vaudenay