Quantum-Resistant Cryptography

Mattsson, John; Smeets, Ben; Thormarker, Erik

doi:10.48550/arxiv.2112.00399

Cited by 3 publications

(3 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the computing power of current quantum computers is not sufficiently strong [9,10], therefore there are still has many problems to overcome.…”

Section: Quantum Computermentioning

confidence: 99%

Maintaining Secure Level on Symmetric Encryption under Quantum Attack

et al. 2023

View full text Add to dashboard Cite

Quantum computing is currently being researched in many countries, and if implemented in the near future, it may pose a threat to existing encryption standards. In the quantum computer environment, asymmetric encryption can be solved by Shor’s Algorithm in polynomial time, and the difficulty of breaking symmetric encryption using brute force is reduced from N times to square root N times by Grover’s Algorithm. We take the Advanced Encryption Standard as the theme and increase the key length from the original standard 192 bits and 256 bits to 384 bits and 512 bits, respectively, in order to maintain the security level of AES 192/256 under the environment of quantum computing, so we propose the key schedule of AES 384/512, and write the software in C++ on FPGA. The experimental results show that our scheme can achieve Level III and Level V security levels in a quantum computer attack environment. In addition to increasing the length of the key, we use the LUT method in the process of writing SubBytes to replace the array and speed up the computation to optimize the execution speed. In addition, the proposed scheme is still based on 128-bit computing blocks, rather than computing blocks in larger blocks.

show abstract

“…However, the computing power of current quantum computers is not sufficiently strong [9,10], therefore there are still has many problems to overcome.…”

Section: Quantum Computermentioning

confidence: 99%

Maintaining Secure Level on Symmetric Encryption under Quantum Attack

et al. 2023

View full text Add to dashboard Cite

show abstract

“…Recently, J. P. Mattsson, B. Smeets, and E. Thormarker [39] have provided an excellent survey for the NIST quantum computer-resistant cryptography standardization effort, the migration to quantum-resistant public-key cryptography, and the relevance of QKD as a complement to conventional cryptography. In particular, these algorithms of quantum-resistant public-key cryptography can execute completely in software on classical computers, in contrast to e.g., QKD which requires very expensive custom hardware.…”

Section: Explanation Of Symbolsmentioning

confidence: 99%

Digest of Quantum Stream Cipher based on Holevo-Yuen Theory

Sohma¹,

Hirota²

2022

Preprint

View full text Add to dashboard Cite

So far, quantum key distribution (QKD) has been the main subject in the field of quantum cryptography, but that is not quantum cryptographic communication, it is only the ability to send keys for cryptographic purposes. To complete cryptographic communication, a technique for encrypting data is necessary, and the conventional cryptographic technique of mathematical symmetric key cipher or One Time Pad (OTP) is adopted in the discussion so far. However, OTP is not the ultimate cipher for data encryption, because it does not satisfy security conditions in the modern cryptology. Around 2000, a new quantum stream cipher was proposed as a technique to challenge the possibility of overcoming drawbacks of OTP in practical use. Recently, we have published some review papers on it in Entropy (Open access journal) [1], and others [2,3]. This paper introduces an overview and a back ground of our paper that is entitled Quantum stream cipher based on Holevo-Yuen theory.

show abstract

“…Although the most prominent effort to identify and examine secure algorithms for post-quantum cryptography (PQC) is the National Institute of Standards and Technology (NIST)’s standardization process ( NIST, 2022 ), institutions and organizations such as European Telecommunications Standards Institute, Internet Engineering Task Force, American National Standards Institute, and International Organization for Standardization are also actively working on to be ready for the post-quantum epoch. In addition, many studies have been carried out on analyzing the security of the constructed proposal using different techniques and current technologies ( Fernández-Caramés, 2019 ; Mattsson, Smeets & Thormarker, 2021 ; Joshi, Bhole & Vaswani, 2022 ; Radanliev, Roure & Santos, 2023 ). Up-to-date studies show that lattice-based schemes are at the forefront of post-quantum secure protocol design due to their strong security assumptions and worst-case hardness properties ( Peikert et al, 2016 ).…”

Section: Introductionmentioning

confidence: 99%

A new lattice-based password authenticated key exchange scheme with anonymity and reusable key

Seyhan,

Akleylek

2024

PeerJ Computer Science

View full text Add to dashboard Cite

In this article, we propose a novel bilateral generalization inhomogenous short integer solution (BiGISIS)-based password-authenticated key exchange (PAKE) scheme for post-quantum era security. The hardness assumption of the constructed PAKE is based on newly proposed hard lattice problem, BiGISIS. The main aim of this article is to provide a solution for the post-quantum secure PAKE scheme, which is one of the open problems in the literature. The proposed PAKE is the first BiGISIS-based PAKE that satisfies anonymity and reusable key features. The bilateral-pasteurization (BiP) approach is used to obtain the reusable key, and anonymity is achieved thanks to the additional identity components and hash functions. The reusable key structure reduces the time in the key generation, and anonymity prevents illegal user login attempts. The security analysis is done by following the real-or-random (RoR) model assumptions. As a result of security examinations, perfect forward secrecy (PFS) and integrity are satisfied, and the resistance against eavesdropping, manipulation-based attack (MBA), hash function simulation, impersonation, signal leakage attack (SLA), man-in-the-middle (MitM), known-key security (KKS), and offline password dictionary attack (PDA) is captured. According to the comparison analysis, the proposed PAKE is the first SLA-resistant lattice-based PAKE with reusable key and anonymity properties.

show abstract

Quantum-Resistant Cryptography

Cited by 3 publications

References 0 publications

Maintaining Secure Level on Symmetric Encryption under Quantum Attack

Maintaining Secure Level on Symmetric Encryption under Quantum Attack

Digest of Quantum Stream Cipher based on Holevo-Yuen Theory

A new lattice-based password authenticated key exchange scheme with anonymity and reusable key

Contact Info

Product

Resources

About