Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 21 - 30
of
669
On Pseudorandom Generators with 0 ⋆ Linear Stretch in NC
"... Abstract. We consider the question of constructing cryptographic pseudorandom generators (PRGs) in NC 0, namely ones in which each bit of the output depends on just a constant number of input bits. Previous constructions of such PRGs were limited to stretching a seed of n bits to n + o(n) bits. This ..."
Abstract
- Add to MetaCart
Abstract. We consider the question of constructing cryptographic pseudorandom generators (PRGs) in NC 0, namely ones in which each bit of the output depends on just a constant number of input bits. Previous constructions of such PRGs were limited to stretching a seed of n bits to n + o(n) bits
A Collection of Selected Pseudorandom Number Generators with Linear Structures
, 1997
"... This is a collection of selected linear pseudorandom number that were implemented in commercial software, used in applications, and some of which have extensively been tested. The quality of these generators is examined using scatter plots and the spectral test. In addition, the spectral test is app ..."
Abstract
-
Cited by 14 (2 self)
- Add to MetaCart
This is a collection of selected linear pseudorandom number that were implemented in commercial software, used in applications, and some of which have extensively been tested. The quality of these generators is examined using scatter plots and the spectral test. In addition, the spectral test
Strong Designated Verifier Signature Schemes with Undeniable Property and Their Applications
"... Most of the strong designated verifier signature (SDVS) schemes cannot tell the real signature generator when the signer and the designated verifier dispute on a signature. In other words, most of the SDVS schemes do not have the undeniability property. In this paper, we propose two SDVS schemes wh ..."
Abstract
- Add to MetaCart
Most of the strong designated verifier signature (SDVS) schemes cannot tell the real signature generator when the signer and the designated verifier dispute on a signature. In other words, most of the SDVS schemes do not have the undeniability property. In this paper, we propose two SDVS schemes
Applications of Pseudorandom Binary Sequences Generated by One-dimensional Discrete-time Maps
"... Abstract: Inspired by recently reported applications of chaotic dynamical systems in encryption and asynchronous DS-CDMA systems [1], as well as our prior study of properties of non-linear maps [2], we present two new improved methods for generation of error-correction codes by iteration of one-dime ..."
Abstract
- Add to MetaCart
Abstract: Inspired by recently reported applications of chaotic dynamical systems in encryption and asynchronous DS-CDMA systems [1], as well as our prior study of properties of non-linear maps [2], we present two new improved methods for generation of error-correction codes by iteration of one
Pseudorandom walks on regular digraphs and the RL vs. L problem
- In Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC ‘06
, 2006
"... We revisit the general RL vs. L question, obtaining the following results. 1. Generalizing Reingold’s techniques to directed graphs, we present a deterministic, log-space algorithm that given a regular (or, more generally, Eulerian) directed graph G and two vertices s and t, finds a path between s a ..."
Abstract
-
Cited by 20 (2 self)
- Add to MetaCart
s and t if one exists. 2. If we restrict ourselves to directed graphs that are regular and consistently labelled, then we are able to produce pseudorandom walks for such graphs in logarithmic space (this result already found an independent application). 3. We prove that if (2) could be generalized to all regular
An application of finite field: Design and implementation of 128-bit instruction-based fast pseudorandom number generator
, 2007
"... (1) SIMD-oriented Mersenne Twister (SFMT) is a new pseudorandom number generator (PRNG) which uses 128-bit Single Instruction Multiple Data (SIMD) operations. SFMT is designed and implemented on C language with SIMD extensions and also implemented on standard C without SIMD. (2) Properties of SFMT a ..."
Abstract
-
Cited by 10 (0 self)
- Add to MetaCart
(1) SIMD-oriented Mersenne Twister (SFMT) is a new pseudorandom number generator (PRNG) which uses 128-bit Single Instruction Multiple Data (SIMD) operations. SFMT is designed and implemented on C language with SIMD extensions and also implemented on standard C without SIMD. (2) Properties of SFMT
An Efficient Pseudo-Random Generator with Applications to Public-Key Encryption and Constant-Round Multiparty Computation
, 2001
"... We present a pseudo-random bit generator expanding a uniformly random bitstring r of length k/2, where k is the security parameter, into a pseudo-random bit-string of length 2k - log 2 (k) using one modular exponentiation. In contrast to all previous high expansion-rate pseudo-random bit genera ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
generators, no hashing is necessary. The security of the generator is proved relative to Paillier's composite degree residuosity assumption. As a first application of our pseudo-random bit generator we exploit its e#ciency to optimise Paillier's crypto-system by a factor of (at least) 2 in both
Run Test of Pseudo-Random Numbers Generated by Chaotic Maps
"... Pseudo-random numbers are useful for wide-ranging ap-plications [1][2]. However, it is not easy to generate truely random numbers. There are several tests to investigate the randomness of limited amount of numbers; the frequency test, ..."
Abstract
- Add to MetaCart
Pseudo-random numbers are useful for wide-ranging ap-plications [1][2]. However, it is not easy to generate truely random numbers. There are several tests to investigate the randomness of limited amount of numbers; the frequency test,
Lamar: A New Pseudorandom Number Generator Evolved by means of Genetic Programming
"... Abstract. Pseudorandom number generation is a key component of many Computer Science algorithms, including mathematical modeling, stochastic processes, Monte Carlo simulations, and most cryptographic primitives and protocols. To date, multiple approaches that use Evolu-tionary Computation (EC) techn ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
) techniques have been proposed for design-ing useful Pseudorandom Number Generators (PRNGs) for certain non-cryptographic applications. However, none of the proposals have been secure nor efficient enough to be of interest for the much more demand-ing crypto world. In this work, we present a general scheme
Pseudo-Random Modulation of a Laser Diode for Generation Ultrasonic
- Longitudinal Waves,” 26 th Annual Review of Progress in Qualitative Nondestructive Evaluation
, 1999
"... INTRODUCTION Laser generated ultrasound systems have historically been more complicated and expensive than conventional piezoelectric based systems, and this fact has relegated the acceptance of laser based systems to niche applications for which piezoelectric based systems are less suitable. Loweri ..."
Abstract
-
Cited by 4 (3 self)
- Add to MetaCart
INTRODUCTION Laser generated ultrasound systems have historically been more complicated and expensive than conventional piezoelectric based systems, and this fact has relegated the acceptance of laser based systems to niche applications for which piezoelectric based systems are less suitable
Results 21 - 30
of
669
