Searching for authors named Daniel Bleichenbacher – sorted by Relevance.
-
Efficiency and Security of Cryptosystems Based on Number Theory
- , 44 equivalent, 48 admissible, 19 associated, 48 binary addition chain, 45 binary method, 43, 63 Carmichael function, 4 Carmichael number, 16, 29 Chinese Remainder Theorem, 5 complex extension, 3 conjugate, 3 CRT, 5 Dickson polynomials, 11 doubling step, 63 dual, 48 Fermat test, 15, 16 graph reduce
- Cited by 11 (0 self) – Add To MetaCart
-
Generating ElGamal signatures without knowing the secret key
- Generating ElGamal signatures without knowing the secret key ? ?? Daniel Bleichenbacher ETH
- Cited by 34 (0 self) – Add To MetaCart
-
Chosen Ciphertext Attacks Against Protocols Based on the RSA Encryption Standard PKCS1
- Chosen Ciphertext Attacks Against Protocols Based on the RSA Encryption Standard PKCS #1 Daniel
- Cited by 151 (1 self) – Add To MetaCart
-
On the Efficiency of One-time Digital Signatures
- On the Efficiency of One-time Digital Signatures Daniel Bleichenbacher 1 and Ueli Maurer 2 1
- Cited by 20 (0 self) – Add To MetaCart
-
Generating ElGamal signatures without knowing the secret key
- Generating ElGamal signatures without knowing the secret key ? ?? Daniel Bleichenbacher ETH
- Add To MetaCart
-
The Continuous Postage Problem
- The continuous postage problem Daniel Bleichenbacher September 26, 2003 Abstract In analogy
- Add To MetaCart
-
SOBER cryptanalysis
- SOBER cryptanalysis Daniel Bleichenbacher and Sarvar Patel fbleichen,sarvarg@(email omitted); Bell
- Cited by 1 (0 self) – Add To MetaCart
-
Noisy Polynomial Interpolation and Noisy Chinese Remaindering
- Noisy Polynomial Interpolation and Noisy Chinese Remaindering Daniel Bleichenbacher 1 and Phong Q
- Cited by 32 (2 self) – Add To MetaCart
-
Optimal Tree-based One-time Digital Signature Schemes
- Optimal Tree-based One-time Digital Signature Schemes Daniel Bleichenbacher and Ueli M. Maurer
- Cited by 15 (1 self) – Add To MetaCart
-
A New and Optimal Chosen-Message Attack on RSA-Type Cryptosystems
- and Optimal Chosen-message Attack on RSA-type Cryptosystems Daniel Bleichenbacher 1 , Marc Joye 2 and Jean
- Cited by 5 (2 self) – Add To MetaCart

