Computational Alternatives to Random Number Generators

Computational Alternatives to Random Number Generators (1999)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by David M'Raïhi , David Naccache , Published In S. Tavares , H. Meijer , Selected Areas In Cryptography

Citations:

3 - 3 self

BibTeX

@MISC{M'Raïhi99computationalalternatives,
    author = {David M'Raïhi and David Naccache and Published In S. Tavares and H. Meijer and Selected Areas In Cryptography},
    title = {Computational Alternatives to Random Number Generators},
    year = {1999}
}

Bookmark

OpenURL

Abstract

In this paper, we present a simple method for generating random-based signatures when random number generators are either unavailable or of suspected quality (malicious or accidental).

Citations

961	A public key cryptosystem and a signature scheme based on discrete logarithms - ElGamal - 1985
711	A digital signature scheme secure against adaptive chosenmessage attacks - Goldwasser, Micali, et al. - 1988
706	A.: How to prove yourself: Practical solutions to identification and signature problems - Fiat, Shamir - 1986
404	Keying hash functions for message authentication - Bellare, Canetti, et al. - 1996
356	signatures for untraceable payments - Chaum - 1983
261	Efficient Identification and Signatures for Smart Cards. CRYPTO - Schnorr - 1989
253	A public key cryptosystem and signature scheme based on the discrete logarithm - Gamal - 1985
244	How to construct pseudorandom permutations from pseudorandom functions - Luby, Rackoff - 1988
227	Security arguments for digital signatures and blind signatures - Pointcheval, Stern
206	The random oracle methodology, revisited - Canetti, Halevi
191	Security Proofs for Signature Schemes - Pointcheval, Stern - 1996
185	How to Time-Stamp a Digital Document - Haber, Stornetta - 1999
175	A Practical Zero-Knowledge Protocol Fitted to Security Microprocessors Minimizing Both Transmission and Memory - Guillou, Quisquater - 1988
142	Public-Key Cryptosystem Based on Algebraic Coding Tehory - McEliece - 1978
129	Timing Attacks on - Kocher - 1996
74	Universal Hash Functions - Carter, Wegman - 1979
60	Improving the efficiency and reliability of digital time-stamping - Bayer, Haber, et al. - 1993
37	Message authentication using hash functions— the HMAC construction - BELLARE, CANETTI, et al. - 1996
26	A simplified and generalized treatment of Luby-Rackoff pseudorandom permutation generators - Maurer - 1992
25	Provable security in block ciphers by decorrelation - Vaudenay - 1998
18	a theory of factorization and genera - number - 1971
10	A Simple Unpredictable Random Number Generator - Blum, Blum, et al. - 1986
10	cient identi cation and signatures for smart cards - Schnorr - 1989
7	Improving the Eciency And Reliability of Digital Time-Stamping - Bayer, Haber, et al. - 1992
6	Improving the E ciency and Reliability of Digital Time-Stamping - Bayer, Haber, et al. - 1993
4	Recherche de Performance dans l’Algorithmique des Corps Finis, Applications à la Cryptographie - Chabaud - 1996
4	A practical zero-knowledge protocol tted to security microprocessors minimizing both transmission and memory - Guillou, Quisquater - 1988
4	Timing Attacks on Cryptosystems - Kaliski - 1996
3	A Simplified and generalised treatment of Luby-Rackoff Pseudorandom Permutation Generators - Maurer - 1992
2	Universal hash functions, Journal of computer and system sciences - Carter - 1979
2	A public-key cryptosystem based on algebraic coding theory, dsn progress report 42-44, Jet propulsion laboratories, caltech - McEleice - 1978
2	Étude des Générateurs de Permutations Pseudo-aléatoires Basés sur le Schéma du DES - Patarin - 1991
1	A simpli ed and generalised treatment of Luby-Racko pseudo-random permutation generators - Maurer
1	Class number, a theory of factorisation, and genera - Shanks - 1971