Scaling Efficient Code-Based Cryptosystems for Embedded Platforms

Free registration required

Executive Summary

QUANTUM computers, should they become a technological reality, will pose a threat to public-key cryptosystems based on certain intractability assumptions, like the integer factorization problem, or IFP (like RSA), and the discrete logarithm problem, or DLP (like Diffie-Hellman or DSA, in their elliptic curve version or otherwise). To face this scenario, several cryptosystems have been proposed that apparently resist attacks mounted with the help of quantum computers. The security of these so-called post-quantum cryptosystems stems from quite distinct computational intractability assumptions.

  • Format: PDF
  • Size: 159.23 KB