Results 1 
4 of
4
Computational Alternatives to Random Number Generators
, 1999
"... In this paper, we present a simple method for generating randombased signatures when random number generators are either unavailable or of suspected quality (malicious or accidental). ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
In this paper, we present a simple method for generating randombased signatures when random number generators are either unavailable or of suspected quality (malicious or accidental).
Computational Alternatives to Random Number Generators
, 1998
"... In this paper, we present a simple method for generating randombased signatures when random number generators are either unavailable or of suspected quality (malicious or accidental). By opposition to all past statemachine models, we assume that the signer is a memoryless automaton that starts fro ..."
Abstract
 Add to MetaCart
In this paper, we present a simple method for generating randombased signatures when random number generators are either unavailable or of suspected quality (malicious or accidental). By opposition to all past statemachine models, we assume that the signer is a memoryless automaton that starts from some internal state, receives a message, outputs its signature and returns precisely to the same initial state; therefore, the new technique formally converts randomized signatures into deterministic ones. Finally, we show how to translate the random oracle concept required in security proofs into a realistic set of tamperresistance assumptions.
unknown title
"... followed by addition which is completed in one clock unit time. The DFT is computed using a systolic cell described in [15]. For IBA1 and IBA2 the computation of the common connection polynomial is done by processing rows or columns serially. The computations of the connection polynomials for indi ..."
Abstract
 Add to MetaCart
(Show Context)
followed by addition which is completed in one clock unit time. The DFT is computed using a systolic cell described in [15]. For IBA1 and IBA2 the computation of the common connection polynomial is done by processing rows or columns serially. The computations of the connection polynomials for individual rows or columns in the case of Blahut’s 2D burst error correction are done concurrently. Except for the MSTD, the BM algorithm works in the spectral domain. For the MSTD, the timedomain BM algorithm is employed and in this case all computations of the BM algorithm for rows or columns are done concurrently. To simplify the matters, conjugacy constraints and fast computation algorithms for DFT are not taken into account. Table I shows the complexity comparison. Both IBA1 and IBA2 show improvements in computational savings and decoding delay over BA1 and BA2, respectively. Relative improvement in the case of IBA1 is more apparent compared to
Computational Alternatives to Random Number Generators
"... In this paper, we present a simple method for generating randombased signatures when random number generators are either unavailable or of suspected quality (malicious or accidental). ..."
Abstract
 Add to MetaCart
In this paper, we present a simple method for generating randombased signatures when random number generators are either unavailable or of suspected quality (malicious or accidental).