Results 21 to 30 of about 159 (153)
A Postquantum Linkable Ring Signature Scheme from Coding Theory
Linkable ring signatures (LRSs) are ring signatures with the extended property that a verifier can detect whether two messages were signed by the same ring member. LRSs play an important role in many application scenarios such as cryptocurrency and confidential transactions. The first code‐based LRS scheme was put forward in 2018.
Xindong Liu, Li-Ping Wang, Shadab Alam
wiley +1 more source
With the rapid development of Internet of Things (IoT), designing a secure two‐factor authentication scheme for IoT is becoming increasingly demanding. Two‐factor protocols are deployed to achieve a higher security level than single‐factor protocols.
Behnam Zahednejad +4 more
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
Practical isogeny-based cryptography
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
Batching CSIDH Group Actions using AVX-512
Commutative Supersingular Isogeny Diffie-Hellman (or CSIDH for short) is a recently-proposed post-quantum key establishment scheme that belongs to the family of isogeny-based cryptosystems.
Hao Cheng +4 more
doaj +1 more source
Highly Vectorized SIKE for AVX-512
It is generally accepted that a large-scale quantum computer would be capable to break any public-key cryptosystem used today, thereby posing a serious threat to the security of the Internet’s public-key infrastructure.
Hao Cheng +3 more
doaj +1 more source
Improvement of the square-root Vélu's formulas for isogeny-based cryptography
Summary: Isogeny-based cryptography is a promising candidate for post-quantum cryptography. Speeding up the isogeny computation of large prime degrees up to several thousands is a main research topic in isogeny-based cryptography. The currently most efficient method for computing isogenies is the square-root Vélu's formulas.
Otsuki, Saki +2 more
openaire +2 more sources
Guest Editorial: Guest Editorial on Cryptanalysis of (NIST PQC) post‐quantum proposals
IET Information Security, Volume 17, Issue 2, Page 159-160, March 2023.
Ayoub Otmani +2 more
wiley +1 more source
CTIDH: faster constant-time CSIDH
This paper introduces a new key space for CSIDH and a new algorithm for constant-time evaluation of the CSIDH group action. The key space is not useful with previous algorithms, and the algorithm is not useful with previous key spaces, but combining the ...
Gustavo Banegas +7 more
doaj +1 more source
Constructing elliptic curve isogenies in quantum subexponential time
Given two ordinary elliptic curves over a finite field having the same cardinality and endomorphism ring, it is known that the curves admit a nonzero isogeny between them, but finding such an isogeny is believed to be computationally difficult.
Childs Andrew +2 more
doaj +1 more source

