Results 21 to 30 of about 18,462 (179)
An efficient post-quantum KEM from CSIDH
The SIDH and CSIDH are now the two most well-known post-quantum key exchange protocols from the supersingular isogeny-based cryptography, which have attracted much attention in recent years and served as the building blocks of other supersingular isogeny-
Qi Mingping
doaj +1 more source
We present new side-channel attacks on SIKE, the isogeny-based candidate in the NIST PQC competition. Previous works had shown that SIKE is vulnerable to differential power analysis, and pointed to coordinate randomization as an effective countermeasure.
Luca De Feo +6 more
doaj +1 more source
A multi‐device user authentication mechanism for Internet of Things
The authors propose a secure user authentication mechanism supporting user access to an IoT environment from multiple devices. A novel One‐time Password (OTP) generation mechanism is presented to detect new device usage by a user. The integrity of the proposed scheme is affirmed using BAN logic, AVISPA tool, and informal security analysis. Besides, the
Raihan Dewon Eman +2 more
wiley +1 more source
Optimized CSIDH Implementation Using a 2-Torsion Point
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 ...
Donghoe Heo +4 more
doaj +1 more source
Secure post‐quantum group key exchange: Implementing a solution based on Kyber
In this article, the authors report on the implementation of a post‐quantum group key exchange protocol, which is proven secure in the so‐called Quantum Random Oracle Model. It is based on a two‐party design called Kyber, which is a finalist in the NIST standardization contest for post‐quantum cryptographic designs.
José Ignacio Escribano Pablos +1 more
wiley +1 more source
A New Isogeny Representation and Applications to Cryptography [PDF]
International audienceThis paper focuses on isogeny representations, defined as ways to evaluate isogenies and verify membership to the language of isogenous supersingular curves (the set of triples D, E1, E2 with a cyclic isogeny of degree D between E1 ...
Leroux, Antonin
core +1 more source
Strategies and their evaluations play important roles in speeding up the computation of large smooth-degree isogenies. The concept of optimal strategies for such computation was introduced by De Feo et al., and virtually all implementations of isogeny ...
Kittiphon Phalakarn +3 more
doaj +1 more source
Quantum algorithms for attacking hardness assumptions in classical and post‐quantum cryptography
Abstract In this survey, the authors review the main quantum algorithms for solving the computational problems that serve as hardness assumptions for cryptosystem. To this end, the authors consider both the currently most widely used classically secure cryptosystems, and the most promising candidates for post‐quantum secure cryptosystems.
J.‐F. Biasse +4 more
wiley +1 more source
Lattice‐based cryptosystems in standardisation processes: A survey
Abstract The current widely used public‐key cryptosystems are vulnerable to quantum attacks. To prepare for cybersecurity in the quantum era, some projects have been launched to call for post‐quantum alternatives. Due to solid security and desirable performance, lattice‐based cryptosystems are viewed as promising candidates in the upcoming ...
Anyu Wang, Dianyan Xiao, Yang Yu
wiley +1 more source
A Comparison of Security and its Performance for Key Agreements in Post-Quantum Cryptography
Nowadays, we are surrounded by devices collecting and transmitting private information. Currently, the two main mathematical problems that guarantee security on the Internet are the Integer Factorization Problem and the Discrete Logarithm Problem ...
Fabio Borges +2 more
doaj +1 more source

