On the Security of Cryptosystems with Quadratic Decryption: The Nicest Cryptanalysis

Provided by: University of Verona
Topic: Security
Format: PDF
The authors totally break a large class of cryptosystems based on imaginary quadratic field arithmetic, whose main interest was the quadratic complexity of the secret operation. This polynomial time attack shows that skep and the kernel problem are not suited to build cryptosystems and lessen the number of public-key cryptosystems with quadratic decryption time. The adaptation of nice recently proposed in [JSW08] in the very different setting of real quadratic fields, seems to resist to their attack.

Find By Topic