Sciweavers

178 search results - page 2 / 36
» On the Implementation of a Fast Prime Generation Algorithm
Sort
View
DAC
2005
ACM
13 years 7 months ago
Prime clauses for fast enumeration of satisfying assignments to boolean circuits
Finding all satisfying assignments of a propositional formula has many applications in the design of hardware and software. An approach to this problem augments a clause-recording...
HoonSang Jin, Fabio Somenzi
PC
1998
132views Management» more  PC 1998»
13 years 4 months ago
Parallel Linear Congruential Generators with Prime Moduli
Linear congruential generators (LCGs) remain the most popular method of pseudorandom number generation on digital computers. Ease of implementation has favored implementing LCGs wi...
Michael Mascagni
AAECC
2003
Springer
165views Algorithms» more  AAECC 2003»
13 years 9 months ago
Fast Point Multiplication on Elliptic Curves through Isogenies
Elliptic curve cryptosystems are usually implemented over fields of characteristic two or over (large) prime fields. For large prime fields, projective coordinates are more suitabl...
Eric Brier, Marc Joye
CRYPTO
2003
Springer
124views Cryptology» more  CRYPTO 2003»
13 years 10 months ago
Primality Proving via One Round in ECPP and One Iteration in AKS
On August 2002, Agrawal, Kayal and Saxena announced the first deterministic and polynomial time primality testing algorithm. For an input n, the AKS algorithm runs in heuristic t...
Qi Cheng
CSREASAM
2009
13 years 6 months ago
Tantra: A Fast PRNG Algorithm and its Implementation
Tantra 1 is a novel Pseudorandom number generator (PRNG) design that provides a long sequence high quality pseudorandom numbers at very high rate both in software and hardware impl...
Mahadevan Gomathisankaran, Ruby Lee