Results 11 to 20 of about 336,808 (204)
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
MemJam: A False Dependency Attack Against Constant-Time Crypto Implementations [PDF]
Cache attacks exploit memory access patterns of cryptographic implementations. Constant-Time implementation techniques have become an indispensable tool in fighting cache timing attacks. These techniques engineer the memory accesses of cryptographic operations to follow a uniform key independent pattern. However, the constant-time behavior is dependent
Ahmad Moghimi +3 more
openaire +2 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
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 ...
Schöffel, Maximilian +2 more
openaire +2 more sources
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
An Efficient Speedup Strategy for Constant Sum Game Computations [PDF]
Large classes of game theoretic problems seem to defy attempts of finding polynomial-time al-gorithms while analyzing large amounts of data. This premise leads naturally to the possibility of using efficient parallel computing implementations when ...
Alexandru-Ioan STAN
doaj +1 more source
High performance and resource efficient FFT processor based on CORDIC algorithm
Fast Fourier Transform is widely used in communication and signal processing. I propose an improved multipath delay commutator pipelining architecture based on the radix-2 time decimation algorithm.
Yupu Zhao, Hong Lv, Jun Li, Lulu Zhu
doaj +1 more source
In this paper, we present nnAudio, a new neural network-based audio processing framework with graphics processing unit (GPU) support that leverages 1D convolutional neural networks to perform time domain to frequency domain conversion.
Kin Wai Cheuk +3 more
doaj +1 more source

