| 2004 |
|---|
| 9 | EE | Erik Anderson,
Cheryl L. Beaver,
Timothy Draelos,
Richard Schroeppel,
Mark Torgerson:
ManTiCore: Encryption with Joint Cipher-State Authentication.
ACISP 2004: 440-453 |
| 2002 |
|---|
| 8 | EE | Richard Schroeppel,
Cheryl L. Beaver,
Rita Gonzales,
Russell Miller,
Timothy Draelos:
A Low-Power Design for an Elliptic Curve Digital Signature Chip.
CHES 2002: 366-380 |
| 2001 |
|---|
| 7 | EE | Niels Ferguson,
Richard Schroeppel,
Doug Whiting:
A Simple Algebraic Representation of Rijndael.
Selected Areas in Cryptography 2001: 103-111 |
| 1997 |
|---|
| 6 | | Nick Ogurtsov,
Hilarie K. Orman,
Richard Schroeppel,
Sean W. O'Malley,
Oliver Spatscheck:
Experimental Results of Covert Channel Limitation in One-Way Communication Systems.
NDSS 1997 |
| 1995 |
|---|
| 5 | EE | Richard Schroeppel,
Hilarie K. Orman,
Sean W. O'Malley,
Oliver Spatscheck:
Fast Key Exchange with Elliptic Curve Systems.
CRYPTO 1995: 43-56 |
| 1993 |
|---|
| 4 | | Hilarie K. Orman,
Sean W. O'Malley,
Edwin Menze III,
Larry L. Peterson,
Richard Schroeppel:
A Fast and General Implementation of Mach IPC in a Network.
USENIX MACH Symposium 1993: 75-88 |
| 1986 |
|---|
| 3 | | Don Coppersmith,
Andrew M. Odlyzko,
Richard Schroeppel:
Discrete Logarithms in GF(p).
Algorithmica 1(1): 1-15 (1986) |
| 1981 |
|---|
| 2 | | Richard Schroeppel,
Adi Shamir:
A T=O(2^(n/2)), S=O(2^(n/4)) Algorithm for Certain NP-Complete Problems.
SIAM J. Comput. 10(3): 456-464 (1981) |
| 1979 |
|---|
| 1 | | Richard Schroeppel,
Adi Shamir:
A T S^2 = O(2^n) Time/Space Tradeoff for Certain NP-Complete Problems
FOCS 1979: 328-336 |
