Breaking a Cryptographic Protocol with Pseudoprimes

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

• Type: Conference
• Year: 2005
• Where: PKC
• Authors: Daniel Bleichenbacher
• Keywords: Cryptography, Miller-Rabin Pseudo Primality, PKC 2005, Pseudo Primality Test