Exploring SIDH-based signature parameters
Isogeny-based cryptography is an instance of post-quantum cryptography whose
fundamental problem consists of finding an isogeny between two (isogenous) elliptic curves …
fundamental problem consists of finding an isogeny between two (isogenous) elliptic curves …
Algebraic attack on FHE-friendly cipher HERA using multiple collisions
Fully homomorphic encryption (FHE) is an advanced cryptography technique to allow
computations (ie, addition and multiplication) over encrypted data. After years of effort, the …
computations (ie, addition and multiplication) over encrypted data. After years of effort, the …
[PDF][PDF] Optimizations and Practicality of High-Security CSIDH
F Campos, J Chávez-Saab, JJ Chi-Domínguez… - 2024 - repository.ubn.ru.nl
In this work, we assess the real-world practicality of CSIDH, an isogenybased non-
interactive key exchange. We provide the first thorough assessment of the practicality of …
interactive key exchange. We provide the first thorough assessment of the practicality of …
Cybersecurity in Critical Infrastructures: A Post-Quantum Cryptography Perspective
The machinery of industrial environments was connected to the Internet years ago with the
scope of increasing their performance. However, this made such environments vulnerable …
scope of increasing their performance. However, this made such environments vulnerable …
Cybersecurity in Critical Infrastructures: A Post-Quantum Cryptography Perspective
J Oliva delMoral, A deMarti iOlius… - IEEE Internet of …, 2024 - ieeexplore.ieee.org
The machinery of industrial environments was connected to the Internet years ago with the
scope of increasing their performance. However, this change made such environments …
scope of increasing their performance. However, this change made such environments …
Parallel optimization over the integer efficient set
D Younes, H Sarah, C Djamal - International Transactions in …, 2024 - Wiley Online Library
This paper introduces a modified sequential version method for optimizing a linear function
over an integer efficient set, as well as a new exact parallel algorithm. The performance of …
over an integer efficient set, as well as a new exact parallel algorithm. The performance of …
Quantum time/memory/data tradeoff attacks
One of the most celebrated and useful cryptanalytic algorithms is Hellman's time/memory
tradeoff (and its Rainbow Table variant), which can be used to invert random-looking …
tradeoff (and its Rainbow Table variant), which can be used to invert random-looking …
Generic MitM Attack Frameworks on Sponge Constructions
X Dong, B Zhao, L Qin, Q Hou, S Zhang… - Cryptology ePrint …, 2024 - eprint.iacr.org
This paper proposes general meet-in-the-middle (MitM) attack frameworks for preimage and
collision attacks on hash functions based on (generalized) sponge construction. As the first …
collision attacks on hash functions based on (generalized) sponge construction. As the first …
Multiple Group Action Dlogs with (out) Precomputation
Abstract Let $\star: G\times X\rightarrow X $ be the action of a group $ G $ of size $ N=| G| $
on a set $ X $. Let $ y= g\star x\in X $ be a group action dlog instance, where our goal is to …
on a set $ X $. Let $ y= g\star x\in X $ be a group action dlog instance, where our goal is to …
A Security Analysis of Restricted Syndrome Decoding Problems
W Beullens, P Briaud, M Øygarden - Cryptology ePrint Archive, 2024 - eprint.iacr.org
Restricted syndrome decoding problems (R-SDP and R-SDP ($ G $)) provide an interesting
basis for post-quantum cryptography. Indeed, they feature in CROSS, a submission in the …
basis for post-quantum cryptography. Indeed, they feature in CROSS, a submission in the …