Results 11 to 20 of about 336,920 (287)
Comparing computational times for simulations when using PBPK model template and stand-alone implementations of PBPK models [PDF]
Frontiers in ToxicologyIntroductionWe previously developed a PBPK model template that consists of a single model “superstructure” with equations and logic found in many physiologically based pharmacokinetic (PBPK) models.
Amanda S. Bernstein +3 more
doaj +2 more sources
Faster quantum chemistry simulation on fault-tolerant quantum computers [PDF]
New Journal of Physics, 2012 Quantum computers can in principle simulate quantum physics exponentially faster than their classical counterparts, but some technical hurdles remain. We propose methods which substantially improve the performance of a particular form of simulation, ab ...
N Cody Jones +6 more
doaj +3 more sources
Verifying constant-time implementations [PDF]
, 2016 The constant-time programming discipline is an effective countermeasure against timing attacks, which can lead to complete breaks of otherwise secure systems. However, adhering to constant-time programming is hard on its own, and extremely hard under additional efficiency and legacy constraints.
Bacelar Almeida, José +4 more
openaire +3 more sources
IACR Transactions on Symmetric CryptologyHash functions are a crucial component in incrementally verifiable computation (IVC) protocols and applications. Among those, recursive SNARKs and folding schemes require hash functions to be both fast in native CPU computations and compact in algebraic descriptions (constraints).
Grassi, Lorenzo +5 more
openaire +3 more sources
Optimizing BIKE for the Intel Haswell and ARM Cortex-M4
Transactions on Cryptographic Hardware and Embedded Systems, 2021 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
Transactions on Cryptographic Hardware and Embedded Systems, 2021 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
Mathematics, 2022 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
Transactions on Cryptographic Hardware and Embedded Systems, 2022 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
Fixslicing: A New GIFT Representation
Transactions on Cryptographic Hardware and Embedded Systems, 2020 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
Acta Electrotechnica et Informatica, 2022 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