Results 61 to 70 of about 597 (176)
Journal of Advances in Modeling Earth Systems, Volume 16, Issue 1, January 2024.Abstract Radiation schemes are critical components of Earth system models that need to be both efficient and accurate. Despite the use of approximations such as 1D radiative transfer, radiation can account for a large share of the runtime of expensive climate simulations.
Peter Ukkonen, Robin J. Hogan
wiley +1 more source
, 2022 The v1.0.2 maintenance release of polar-codes The polar-codes project is a library and simulation tool for a Forward Error Correcting (FEC) scheme named "Polar Codes".
Lotze, Florian, Demel, Johannes
core +1 more source
, 2020 Hi everyone, with VOLK 2.2.0, we introduced another AVX rotator bug which is fixed with this release. In the process 2 more bugs were identified and fixed. Further, we saw some documentation improvements.
Christoph Mayer +29 more
core +1 more source
HAETAE: Shorter Lattice-Based Fiat-Shamir Signatures
Transactions on Cryptographic Hardware and Embedded SystemsWe present HAETAE (Hyperball bimodAl modulE rejecTion signAture schemE), a new lattice-based signature scheme. Like the NIST-selected Dilithium signature scheme, HAETAE is based on the Fiat-Shamir with Aborts paradigm, but our design choices target an ...
Jung Hee Cheon +9 more
doaj +1 more source
SaberX4: High-Throughput Software Implementation of Saber Key Encapsulation Mechanism [PDF]
, 2019 Saber is a module lattice-based CCA-secure key encapsulation mechanism (KEM) which has been shortlisted for the second round of NIST\u27s Post Quantum Cryptography Standardization project.
Sujoy Sinha Roy
core +1 more source
Caminhamento Paralelo Barnes-Hut com Vetorização AVX2
Anais do XX Simpósio em Sistemas Computacionais de Alto Desempenho (SSCAD 2019), 2019 O algoritmo Barnes-Hut é um método aproximado amplamente usado na simulação gravitacional de N -Corpos. A natureza irregular desse código apresenta desafios para sua computação em sistemas paralelos. Obstáculos adicionais ocorrem nesse padrão de computação quando se deseja a utilização eficaz da capacidade computacional de arquiteturas ...
Wagner Zola +2 more
openaire +2 more sources
, 2013 The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA,RNA or protein sequences while minimizing the number of evolutionary changes. Muchwork has been devoted by the Computer Science community to solve this NP-complete
Richer, Jean-Michel
core +2 more sources
Faster AVX2 optimized NTT multiplication for Ring-LWE lattice cryptography [PDF]
, 2018 Constant-time polynomial multiplication is one of the most time-consuming operations in many lattice-based cryptographic constructions. For schemes based on the hardness of Ring-LWE in power-of-two cyclotomic fields with completely splitting primes, the ...
Gregor Seiler
core
Optimization for SPHINCS+ using Intel Secure Hash Algorithm Extensions [PDF]
, 2022 SPHINCS+ was selected as a candidate digital signature scheme for standardization by the NIST Post-Quantum Cryptography Standardization Process. It offers security capabilities relying only on the security of cryptographic hash functions.
Anne Reinders +5 more
core
Accelerating HQC with Additive FFT
Transactions on Cryptographic Hardware and Embedded SystemsThis paper presents an accelerated implementation of the Hamming Quasi-Cyclic (HQC) key encapsulation mechanism by leveraging additive Fast Fourier Transform (FFT) for polynomial multiplication (polymuls).
Ming-Shing Chen +3 more
doaj +1 more source