NewHope for ARM - An Efficient Implementation of the Post-Quantum Ephemeral Key Exchange NewHope for the ARMv6-M and ARMv7M Architecture

Add to your list(s) Download to your calendar using vCal

• Philipp Jakubeit (Birmingham)
• Thursday 05 October 2017, 11:00-12:00
• Computer Science, The Sloman Lounge (UG).

If you have a question about this talk, please contact Dr Garfield Benjamin.

This presentation starts by sketching the relevance of quantum resistant cryptography in the near future. It gives a short overview of potential mathematical problems to build upon. After this introduction, it dives into the mathematical background information and details of our ARM implementation of the post-quantum key exchange NewHope. NewHope was designed and published in 2015 by Alkim, Ducas, Pöppelmann and Schwabe. It bases its security claims on lattice problems, the ring-learning-with-errors problem which is reducible to the shortest vector problem. No quantum algorithm is known which could solve them in polynomial time.

Actors like the NIST , the NSA or the Tor project have recognized the relevance of post-quantum cryptography. Key exchanges prove relevant as they form the basis of forward secrecy in a world with large-scale quantum computers at the horizon. These key exchanges must be designed and proven to be efficiently implementable. We performed an implementation of NewHope on the embedded ARMv6M and ARMv7M architecture.

This talk is part of the Computer Security Seminars series.

This talk is included in these lists:

• Computer Science Departmental Series
• Computer Science Distinguished Seminars
• Computer Science, The Sloman Lounge (UG)
• Computer Security Seminars
• computer sience

Note that ex-directory lists are not shown.