Claus-Peter Schnorr

International Association for Cryptologic Research

Claus-Peter Schnorr Search web for home page

Program Committees

1	2005	PKC	pc
2	2004	PKC	pc
3	2001	Eurocrypt	pc
4	2001	PKC	pc
5	1999	Eurocrypt	pc
6	1997	Eurocrypt	pc
7	1996	Eurocrypt	pc
8	1993	Eurocrypt	pc
9	1991	Eurocrypt	pc
10	1987	Eurocrypt	pc
11	1986	Crypto	pc
12	1984	Eurocrypt	pc

Publications

	year	title	booktitle	pages
1	2001	Cryptoanalysis of Two Sparse Polynomial Based Public Key Cryptosystems	pkc	153-164
2	2000	Stronger Security Proofs for RSA and Rabin Bits	jofc	221-244
3	2000	Security of Signed ElGamal Encryption	asiacrypt	73-89
4	1998	Almost All Discrete Log Bits Are Simultaneously Secure	eprint	online
5	1998	The Black-Box Model for Cryptographic Primitives	jofc	125-140
6	1997	Stronger Security Proofs for RSA and Rabin Bits	eurocrypt	267-279
7	1996	Security of $2^t$-Root Identification and Signatures	crypto	143-156
8	1995	Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction	eurocrypt	1-12
9	1994	Black Box Cryptoanalysis of Hash Networks Based on Multipermutations	eurocrypt	47-57
10	1993	Parallel FFT-Hashing	fse	149-156
11	1992	FFT-Hash II, Efficient Cryptographic Hashing	eurocrypt	45-54
12	1992	Local Randomness in Candidate One-Way Functions	eurocrypt	408-419
13	1991	Efficient, Perfect Polynomial Random Number Generators	jofc	157-172
14	1991	Efficient Signature Generation by Smart Cards	jofc	161-174
15	1991	Factoring Integers and Computing Discrete Logarithms via Diophantine Approximations	eurocrypt	281-293
16	1990	Fast Signature Generation With a Fiat Shamir-Like Scheme	eurocrypt	432-440
17	1989	Efficient Identification and Signatures for Smart Cards	crypto	239-252
18	1989	Efficient Identification and Signatures for Smart Cards (Abstract)	eurocrypt	688-689
19	1988	On the Construction of Random Number Generators and Random Function Generators	eurocrypt	225-232
20	1988	Efficient, Perfect Random Number Generators	crypto	173-198
21	1984	RSA-Bits are 0.5 + epsilon Secure	eurocrypt	113-126
22	1984	Efficient Signature Schemes Based on Polynomial Equations	crypto	37-46
23	1983	Signatures through Approximate Representation by Quadratic Forms	crypto	117-131
24	1982	Is the RSA Scheme Safe?	eurocrypt	325-329
25	1982	Ein Effizienzvergleich der Factorisierungsverfahren von Morrison-Brillhart und Schroeppel	eurocrypt	331-351

Claus-Peter Schnorr Search web for home page

Program Committees

Publications

Coauthors of Claus-Peter Schnorr