Breaking a Cryptographic Protocol with Pseudoprimes

13 years 10 months ago

Download www.iacr.org

The Miller-Rabin pseudo primality test is widely used in cryptographic libraries, because of its apparent simplicity. But the test is not always correctly implemented. For example the pseudo primality test

Daniel Bleichenbacher

Real-time Traffic

Cryptography | Miller-Rabin Pseudo Primality | PKC 2005 | Pseudo Primality Test |

claim paper

» A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardnes...

» Reversible Logic to Cryptographic Hardware A New Paradigm

» On the Robustness of Some Cryptographic Protocols for Mobile Agent Protection

» Cryptography in the BoundedQuantumStorage Model

» Limits of Constructive Security Proofs

» A Traceability Attack against ePassports

» UniformlySwitching Logic for Cryptographic Hardware

» Experimental performance comparison of Byzantine FaultTolerant protocols for data centers

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	PKC
Authors	Daniel Bleichenbacher

Comments (0)

Sciweavers

Breaking a Cryptographic Protocol with Pseudoprimes

Cryptography | Miller-Rabin Pseudo Primality | PKC 2005 | Pseudo Primality Test |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers