Results 21 to 30 of about 22,173,063 (167)
Transactions on Cryptographic Hardware and Embedded Systems, 2022 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
Optimized CSIDH Implementation Using a 2-Torsion Point
Cryptography, 2020 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
A multi‐device user authentication mechanism for Internet of Things
IET Networks, Volume 12, Issue 5, Page 229-249, September 2023., 2023 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
Secure post‐quantum group key exchange: Implementing a solution based on Kyber
IET Communications, Volume 17, Issue 6, Page 758-773, April 2023., 2023 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
Transactions on Cryptographic Hardware and Embedded Systems, 2023 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
IET Information Security, Volume 17, Issue 2, Page 171-209, March 2023., 2023 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
IET Information Security, Volume 17, Issue 2, Page 227-243, March 2023., 2023 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
Drinfeld modules may not be for isogeny based cryptography [PDF]
, 2020 Elliptic curves play a prominent role in cryptography. For instance, the hardness of the elliptic curve discrete logarithm problem is a foundational assumption in public key cryptography.
Anand Kumar Narayanan, Antoine Joux
core +1 more source
A Comparison of Security and its Performance for Key Agreements in Post-Quantum Cryptography
IEEE Access, 2020 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
Practical isogeny-based cryptography
, 2021 This thesis aims at providing efficient and side-channel protected implementations of isogeny-based primitives, and at their application in threshold protocols. It is based on a sequence of academic papers. Chapter 3 reviews the original variable-time implementation of CSIDH and introduces several optimizations, e.g.
openaire +2 more sources