Post-Quantum Cryptography: From Theoretical Foundations to Practical Deployments

A special issue of Cryptography (ISSN 2410-387X).

Deadline for manuscript submissions: closed (30 June 2020) | Viewed by 11008

Special Issue Editor

Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC 27606, USA
Interests: applied cryptography; computer architectures; hardware security

Special Issue Information

Dear Colleagues,

There is a major vulnerability at the heart of the digital world. Existing public-key encryption schemes, such as key-exchange protocols used by TLS/HTTPS connections, RSA/ECDSA signatures used by certification authorities, and transactions used by cryptocurrencies, among others, are all vulnerable to quantum cryptanalysis. Indeed, the majority of such encryption systems rely on the difficulty of integer factorization or discrete logarithm problems that can be solved by a quantum computer in polynomial time. Therefore, there is a critical need to develop, analyze, and implement new encryption pillars to secure the future of electronic systems. Post-quantum cryptography seeks such cryptographic solutions. The ongoing NIST’s post-quantum encryption standardization process calls an urgent effort in all aspects of realizing these systems. Theoretical security of post-quantum systems should be evaluated both in the quantum and classical case, higher-level protocols based on these encryptions should be developed, hardware/software efficiency and implementation security of their unique arithmetic structures should be analyzed on a multitude of platforms, and, at the same time, mistakes of prior public-key encryption standards should be avoided while foreseeing potential difficulties for transitioning to a new one.  Given the space of existing proposals, there is also a need for a fair, comprehensive, and comparative analysis of potential solutions. This special edition targets all these aspects. We invite submissions from cryptographers, cryptographic engineers, standardization bodies, and developers working with existing standards.

Prof. Dr. Aydin Aysu
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Cryptography is an international peer-reviewed open access quarterly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • Post-quantum cryptography
  • Quantum and classical cryptanalysis
  • Higher-level protocols using post-quantum encryption
  • Hardware and software acceleration
  • Implementation attacks: fault attacks and side-channel analysis
  • Cryptographic standardization challenges

Published Papers (2 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

13 pages, 379 KiB  
Article
Optimized CSIDH Implementation Using a 2-Torsion Point
by Donghoe Heo, Suhri Kim, Kisoon Yoon, Young-Ho Park and Seokhie Hong
Cryptography 2020, 4(3), 20; https://0-doi-org.brum.beds.ac.uk/10.3390/cryptography4030020 - 29 Jul 2020
Cited by 2 | Viewed by 2943
Abstract
The implementation of isogeny-based cryptography mainly use Montgomery curves, as they offer fast elliptic curve arithmetic and isogeny computation. However, although Montgomery curves have efficient 3- and 4-isogeny formula, it becomes inefficient when recovering the coefficient of the image curve for large degree [...] Read more.
The implementation of isogeny-based cryptography mainly use Montgomery curves, as they offer fast elliptic curve arithmetic and isogeny computation. However, although Montgomery curves have efficient 3- and 4-isogeny formula, it becomes inefficient when recovering the coefficient of the image curve for large degree isogenies. Because the Commutative Supersingular Isogeny Diffie-Hellman (CSIDH) requires odd-degree isogenies up to at least 587, this inefficiency is the main bottleneck of using a Montgomery curve for CSIDH. In this paper, we present a new optimization method for faster CSIDH protocols entirely on Montgomery curves. To this end, we present a new parameter for CSIDH, in which the three rational two-torsion points exist. By using the proposed parameters, the CSIDH moves around the surface. The curve coefficient of the image curve can be recovered by a two-torsion point. We also proved that the CSIDH while using the proposed parameter guarantees a free and transitive group action. Additionally, we present the implementation result using our method. We demonstrated that our method is 6.4% faster than the original CSIDH. Our works show that quite higher performance of CSIDH is achieved while only using Montgomery curves. Full article
11 pages, 239 KiB  
Article
An Improved Identity-Based Multivariate Signature Scheme Based on Rainbow
by Le Van Luyen
Cryptography 2019, 3(1), 8; https://0-doi-org.brum.beds.ac.uk/10.3390/cryptography3010008 - 17 Mar 2019
Cited by 6 | Viewed by 7001
Abstract
Multivariate Public Key Cryptography (MPKC) is one of the main candidates for post-quantum cryptography, especially in the area of signature schemes. In this paper, we instantiate a certificate Identity-Based Signature (IBS) scheme based on Rainbow, one of the most efficient and secure multivariate [...] Read more.
Multivariate Public Key Cryptography (MPKC) is one of the main candidates for post-quantum cryptography, especially in the area of signature schemes. In this paper, we instantiate a certificate Identity-Based Signature (IBS) scheme based on Rainbow, one of the most efficient and secure multivariate signature schemes. In addition, we revise the previous identity-based signature scheme IBUOV based on the Unbalanced Oil and Vinegar (UOV) scheme on the security and choice of parameters and obtain that our scheme is more efficient than IBUOV in terms of key sizes and signature sizes. Full article
Show Figures

Figure 1

Back to TopTop