Results 21 to 30 of about 2,168 (195)

Towards Green Computing Oriented Security: A Lightweight Postquantum Signature for IoE [PDF]

Sensors, 2021
Postquantum cryptography for elevating security against attacks by quantum computers in the Internet of Everything (IoE) is still in its infancy. Most postquantum based cryptosystems have longer keys and signature sizes and require more computations that
Rinki Rani, Sushil Kumar, Omprakash Kaiwartya, Ahmad M. Khasawneh, Jaime Lloret, Mahmoud Ahmad Al-Khasawneh, Marwan Mahmoud, Alaa Abdulsalm Alarood   +7 more
doaj   +2 more sources

Improvement of the square-root Vélu's formulas for isogeny-based cryptography

JSIAM Letters, 2023
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.
Saki Otsuki, Hiroshi Onuki, Tsuyoshi Takagi   +2 more
openalex   +4 more sources

Secure IoT in the Era of Quantum Computers—Where Are the Bottlenecks? [PDF]

Sensors, 2022
Recent progress in quantum computers severely endangers the security of widely used public-key cryptosystems and of all communication that relies on it.
Maximilian Schöffel, Frederik Lauer, Carl C. Rheinländer, Norbert Wehn   +3 more
doaj   +2 more sources

Finding Practical Parameters for Isogeny-based Cryptography [PDF]

IACR Communications in Cryptology
Isogeny-based schemes often come with special requirements on the field of definition of the involved elliptic curves. For instance, the efficiency of SQIsign, a promising candidate in the NIST signature standardisation process, requires a large power of two and a large smooth integer
Maria Corte-Real Santos, Jonathan Komada Eriksen, Michaël Meyer, Francisco Rodríguez‐Henríquez   +3 more
openalex   +2 more sources

Efficient Finite Field Multiplication for Isogeny Based Post Quantum Cryptography [PDF]

, 2016
Isogeny based post-quantum cryptography is one of the most recent addition to the family of quantum resistant cryptosystems. In this paper we propose an efficient modular multiplication algorithm for primes of the form \(p=2\cdot {2^a}3^b-1\) with b even, typically used in such cryptosystem.
Angshuman Karmakar, Sujoy Sinha Roy, Fréderik Vercauteren, Ingrid Verbauwhede   +3 more
openalex   +3 more sources

Pairing Optimizations for Isogeny-Based Cryptosystems

IET Information Security
In isogeny-based cryptography, bilinear pairings are regarded as a powerful tool in various applications, including key compression, public key validation, and torsion basis generation. However, in most isogeny-based protocols, the performance of pairing
Shiping Cai, Kaizhan Lin, Chang-An Zhao
doaj   +2 more sources

Finite Field Arithmetic Using AVX-512 For Isogeny-Based Cryptography

Anais do XVIII Simpósio Brasileiro de Segurança da Informação e de Sistemas Computacionais (SBSeg 2018), 2018
Isogeny-based cryptography introduces new candidates to quantum-resistant cryptographic protocols. The cost of finite field arithmetic dominates the cost of isogeny-based cryptosystems. In this work, we apply AVX-512 vector instructions to accelerate the finite field modular multiplication.
Gabriell Orisaka, Diego F. Aranha, Julio López   +2 more
openalex   +3 more sources

Advanced threshold signature schemes leveraging isogeny-based cryptography [PDF]

Global Journal of Engineering and Technology Advances
This paper investigates the use of threshold signature schemes in isogeny-based cryptosystems. By leveraging the distinct features of isogeny graphs, we propose a protocol that offers high security and practical efficiency, making it ideal for distributed ledger technologies and secure multi-party computations.
Mohammed El Baraka, Siham Ezzouak
openalex   +2 more sources

Quaternion Algrebras and isogeny-based cryptography

, 2022
L'avènement de l'ordinateur quantique est une menace pour la cryptographie en permettant de résoudre les problèmes sur lesquels reposent la sécurité de nombreux protocoles. La cryptographie à base d'isogénies est une famille de protocoles reposant sur la difficulté de trouver une isogénie entre deux courbes elliptiques supersingulières, un problème ...
Antonin Leroux
openalex   +3 more sources

Unconditional Foundations for Supersingular Isogeny-Based Cryptography [PDF]

In this paper, we prove that the supersingular isogeny problem (Isogeny), endomorphism ring problem (EndRing) and maximal order problem (MaxOrder) are equivalent under probabilistic polynomial time reductions, unconditionally.Isogeny-based cryptography is founded on the presumed hardness of these problems, and their interconnection is at the heart of ...
Arthur Herlédan Le Merdy, Benjamin Wesolowski   +1 more
openalex   +3 more sources