Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
865
On Stochastic Security of Pseudorandom Sequences
"... Abstract. Cryptographic primitives such as secure hash functions (e.g., SHA1, SHA2, and SHA3) and symmetric key block ciphers (e.g., AES and TDES) have been commonly used to design pseudorandom generators with counter modes (e.g., in NIST SP800-90A standards). It is assumed that if these primitives ..."
Abstract
- Add to MetaCart
are secure then the sequences generated by pseudorandom generators based on these primitives are indistinguishable from sequences from true random sources. How-ever, no systematic research and analysis have been done to support this assump-tion. Based on complexity theoretic results for pseudorandom
Pseudorandom Sequences From Elliptic Curves
, 2002
"... In this article we will generalize some known constructions to produce pseudorandom sequences with the aid of elliptic curves. We will make use of both additive and multiplicative characters on elliptic curves. Keywords are: Artin-Schreier extension, Kummer extension, elliptic curve, exponential sum ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
In this article we will generalize some known constructions to produce pseudorandom sequences with the aid of elliptic curves. We will make use of both additive and multiplicative characters on elliptic curves. Keywords are: Artin-Schreier extension, Kummer extension, elliptic curve, exponential
Elliptic Curve Pseudorandom Sequence Generators
, 1998
"... In this paper, we introduce a new approach to the generation of binary sequences by applying trace functions to elliptic curves over GF(2 m ). We call these sequences elliptic curve pseudorandom sequences (EC-sequence). We determine their periods, distribution of zeros and ones, and linear span ..."
Abstract
-
Cited by 14 (1 self)
- Add to MetaCart
In this paper, we introduce a new approach to the generation of binary sequences by applying trace functions to elliptic curves over GF(2 m ). We call these sequences elliptic curve pseudorandom sequences (EC-sequence). We determine their periods, distribution of zeros and ones, and linear
Bit-Fixing in Pseudorandom Sequences for Scan BIST
- IEEE Trans. Computer-Aided Design
, 2001
"... A low-overhead scheme for achieving complete (100%) fault coverage during built-in self test of circuits with scan is presented. It does not require modifying the function logic and does not degrade system performance (beyond using scan). Deterministic test cubes that detect the random-pattern-resis ..."
Abstract
-
Cited by 27 (2 self)
- Add to MetaCart
-pattern-resistant (r.p.r.) faults are embedded in a pseudorandom sequence of bits generated by a linear feedback shift register (LFSR). This is accomplished by altering the pseudorandom sequence by adding logic at the LFSR's serial output to "fix" certain bits. A procedure for synthesizing the bit
Study on Pseudorandom Sequences with Applications in Cryptography and Telecommunications
"... Abstract. Pseudorandom sequences have many applications in cryptography and spread spectrum communications. In this dissertation, on one hand we develop tools for assessing the randomness of a sequence, and on the other hand we propose new constructions of pseudorandom sequences. More precisely, we ..."
Abstract
- Add to MetaCart
Abstract. Pseudorandom sequences have many applications in cryptography and spread spectrum communications. In this dissertation, on one hand we develop tools for assessing the randomness of a sequence, and on the other hand we propose new constructions of pseudorandom sequences. More precisely, we
PSEUDORANDOM SEQUENCE GENERATION FORMISMATCH ANALOG COMPENSATION OF ADCS
"... This paper presents a low complexity 1-bit pseudorandom number generator used in a digital background calibration for ADCs. The pseudorandom sequence generator is based on a chain of accumulators, with time-varied coefficients, that obtain a 1-bit sequence with good statistical properties. Be-havior ..."
Abstract
- Add to MetaCart
This paper presents a low complexity 1-bit pseudorandom number generator used in a digital background calibration for ADCs. The pseudorandom sequence generator is based on a chain of accumulators, with time-varied coefficients, that obtain a 1-bit sequence with good statistical properties. Be
Pseudorandom Sequences obtained from Expansions of Irrational Numbers
, 1995
"... The main challenge in stream cipher design is to produce sequences that appear random. A number of keystream generators have been proposed and considered in the literature (several of those have been broken). The common characteristic of these keystream generators is that the obtained sequences are ..."
Abstract
- Add to MetaCart
are periodic. This paper proposes a novel method for the generation of pseudorandom sequences. The method is based on the expansion of irrational numbers. In contrast to previous methods, our method produces non-periodic sequences. It will be shown that binary sequences obtained from the expansions
Large families of pseudorandom sequences of k symbols and their complexity
- Part I, General Theory of Information Transfer and Combinatorics, eds. R. Ahlswede et al., LNCS 4123
, 2006
"... In earlier papers we introduced the measures of pseudorandomness of finite binary sequences [13], introduced the notion of f–complexity of families of binary sequences, constructed large families of binary sequences with strong PR (= pseudorandom) properties [6], [12], and we showed that one of the ..."
Abstract
-
Cited by 4 (2 self)
- Add to MetaCart
In earlier papers we introduced the measures of pseudorandomness of finite binary sequences [13], introduced the notion of f–complexity of families of binary sequences, constructed large families of binary sequences with strong PR (= pseudorandom) properties [6], [12], and we showed that one
DETECTION OF WEAKNESSES OF PSEUDORANDOM SEQUENCES WITH THE AID OF STATISTICAL TESTS *
"... Abstract: This work contains a summary of long term research into the statistical properties of sequences generated by least primitive roots of prime numbers. Extensive statistical tests were applied to sequences produced by linear congruential generators modulo a prime number with the generating el ..."
Abstract
- Add to MetaCart
Abstract: This work contains a summary of long term research into the statistical properties of sequences generated by least primitive roots of prime numbers. Extensive statistical tests were applied to sequences produced by linear congruential generators modulo a prime number with the generating
Pseudorandom Sequences in Spread-Spectrum Communications Generated by Cellular Automata
"... Dynamical systems methods have been recently used in spread-spectrum digital communication systems. The expansion of the spectrum using a pseudorandom sequence with a higher frequency than the information signal is the key feature for its robustness against the signal traveling interference through ..."
Abstract
- Add to MetaCart
Dynamical systems methods have been recently used in spread-spectrum digital communication systems. The expansion of the spectrum using a pseudorandom sequence with a higher frequency than the information signal is the key feature for its robustness against the signal traveling interference through
Results 1 - 10
of
865
