Results 11 to 20 of about 33,516 (251)
Optimizing BIKE for the Intel Haswell and ARM Cortex-M4
BIKE is a key encapsulation mechanism that entered the third round of the NIST post-quantum cryptography standardization process. This paper presents two constant-time implementations for BIKE, one tailored for the Intel Haswell and one tailored for the ...
Ming-Shing Chen +2 more
doaj +1 more source
Classic McEliece on the ARM Cortex-M4
This paper presents a constant-time implementation of Classic McEliece for ARM Cortex-M4. Specifically, our target platform is stm32f4-Discovery, a development board on which the amount of SRAM is not even large enough to hold the public key of the ...
Ming-Shing Chen, Tung Chou
doaj +1 more source
Efficient Implementation of SPEEDY Block Cipher on Cortex-M3 and RISC-V Microcontrollers
The SPEEDY block cipher family announced at the CHES 2021 shows excellent performance on hardware architectures. Due to the nature of the hardware-friendly design of SPEEDY, the algorithm has low performance for software implementations. In particular, 6-
Hyunjun Kim +3 more
doaj +1 more source
Efficient Hardware Implementation of Constant Time Sampling for HQC
HQC is one of the code-based finalists in the last round of the NIST post quantum cryptography standardization process. In this process, security and implementation efficiency are key metrics for the selection of the candidates. A critical compute kernel with respect to efficient hardware implementations and security in HQC is the sampling method used ...
Maximilian Schöffel +2 more
openaire +2 more sources
The extended GCD (XGCD) calculation, which computes Bézout coefficients ba, bb such that ba ∗ a0 + bb ∗ b0 = GCD(a0, b0), is a critical operation in many cryptographic applications.
Kavya Sreedhar +2 more
doaj +3 more sources
Exploiting ROLLO’s constant-time implementations with a single-trace analysis
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cheriere, Agathe +3 more
openaire +3 more sources
Fixslicing: A New GIFT Representation
The GIFT family of lightweight block ciphers, published at CHES 2017, offers excellent hardware performance figures and has been used, in full or in part, in several candidates of the ongoing NIST lightweight cryptography competition.
Alexandre Adomnicai +2 more
doaj +1 more source
Number-Theoretic Transform with Constant Time Computation for Embedded Post-Quantum Cryptography
In this article, we describe the principles and advantages of using the Number-Theoretic Transform (NTT) in post-quantum cryptography. We deal with usages of NTT in post-quantum algorithms included in the competition announced by the National Institute ...
Kupcová Eva, Drutarovský Miloš
doaj +1 more source
Output-sensitive Information flow analysis [PDF]
Constant-time programming is a countermeasure to prevent cache based attacks where programs should not perform memory accesses that depend on secrets. In some cases this policy can be safely relaxed if one can prove that the program does not leak more ...
Cristian Ene +2 more
doaj +1 more source
Finding Small and Large
Algorithms for triangle finding, the smallest nontrivial instance of the k-clique problem, have been proposed for quantum computers. Still, those algorithms assume the use of fixed access time quantum RAM.
Sara Ayman Metwalli +2 more
doaj +1 more source

