搜索结果: 1-15 共查到“1-Bit”相关记录245条 . 查询时间(0.14 秒)
A Comparison of Single-Bit and Multi-Bit DPA for Attacking AES128 on an ATmega328P
AES DPA multi-bit DPA
2019/8/8
Side channel attacks have demonstrated in the past that it is possible to break cryptographic algorithms by attacking the implementation rather than the algorithm. This paper compares an adaptation of...
One Bit is All It Takes: A Devastating Timing Attack on BLISS’s Non-Constant Time Sign Flips
Lattice-Based Cryptography Cryptanalysis BLISS
2019/8/7
As one of the most efficient lattice-based signature schemes, and one of the only ones to have seen deployment beyond an academic setting (e.g., as part of the VPN software suite strongSwan), BLISS ha...
Optimized SIKE Round 2 on 64-bit ARM
Post-quantum cryptography isogeny-based cryptography 64-bit ARM processor
2019/6/19
In this work, we present the rst highly-optimized implementation of Supersingular Isogeny Key Encapsulation (SIKE) submitted to NIST's second round of post quantum standardization process, on 64-bit ...
Many crypto-algorithms, Deep-Learning, DSP compute on words larger than 8-bit. SCA attacks can easily be done on Boolean operations like XOR, AND, OR, and substitution operations like s-box, p-box or ...
Fully Homomorphic Encryption with k-bit Arithmetic Operations
FHE lattices learning with errors (LWE)
2019/5/21
We present a fully homomorphic encryption scheme continuing the line of works of Ducas and Micciancio (2015, [DM15]), Chillotti et al. (2016, [CGGI16a]; 2017, [CGGI17]; 2018, [CGGI18a]), and Gao (2018...
Practically Efficient Secure Distributed Exponentiation without Bit-Decomposition
applied secure multiparty computation distributed exponentiation applied cryptography
2019/4/3
Bit-decomposition is a powerful tool which can be used to design constant round protocols for bit-oriented multiparty computation (MPC) problems, such as comparison and Hamming weight computation. How...
On the Decoding Failure Rate of QC-MDPC Bit-Flipping Decoders
code-based cryptography MDPC codes iterative decoding
2018/12/20
Quasi-cyclic moderate density parity check codes allow the design of McEliece-like public-key encryption schemes with compact keys and a security that provably reduces to hard decoding problems for qu...
ZCZ - Achieving n-bit SPRP Security with a Minimal Number of Tweakable-block-cipher Calls
n-bit security beyond birthday bound tweakable blockcipher
2018/11/19
Strong Pseudo-random Permutations (SPRPs) are important for various applications. In general, it is desirable to base an SPRP on a single-keyed primitive for minimizing the implementation costs. For c...
A Bit-fixing PRF with O(1) Collusion-Resistance from LWE
Constrained PRF Collusion-resistance LWE
2018/11/9
Constrained pseudorandom functions (CPRFs) allow learning modified PRF keys that can evaluate the PRF on a subset of the input space, or based on some sort of predicate. First introduced by Boneh and ...
Constrained PRFs for Bit-fixing from OWFs with Constant Collusion Resistance
Constrained PRF Collusion-resistance One-way functions
2018/11/5
Constrained pseudorandom functions (CPRFs) allow learning `constrained' PRF keys that can evaluate the PRF on a subset of the input space, or based on some sort of predicate. First introduced by Boneh...
Laser-induced Single-bit Faults in Flash Memory: Instructions Corruption on a 32-bit Microcontroller
Fault attack laser injection flash memory
2018/11/2
Physical attacks are a known threat to secure embedded systems. Notable among these is laser fault injection, which is probably the most powerful fault injection technique. Indeed, powerful injection ...
4-bit crypto S-boxes: Generation with irreducible polynomials over Galois field GF(24) and cryptanalysis
public-key cryptography EPs
2018/6/13
4-bit crypto S-boxes play a significant role in encryption and decryption of many cipher algorithms from last 4 decades. Generation and cryptanalysis of generated 4-bit crypto S-boxes is one of the ma...
Efficient Bit-Decomposition and Modulus-Conversion Protocols with an Honest Majority
secret sharing bit-decomposition modulus conversion
2018/5/2
Secure computation enables parties with inputs to compute a function on the inputs while keeping
them secret. There are security notions that secure computation should satisfy, e.g., privacy, meaning...
Rasta: A cipher with low ANDdepth and few ANDs per bit
Symmetric encryption ASASA homomorphic encryption
2018/3/6
Recent developments in multi party computation (MPC) and fully homomorphic encryption (FHE) promoted the design and analysis of symmetric cryptographic schemes that minimize multiplications in one way...
On Side-Channel Vulnerabilities of Bit Permutations: Key Recovery and Reverse Engineering
side-channel analysis differential plaintext attack SCADPA
2018/3/5
Lightweight block ciphers rely on simple operations to allow compact implementation. Thanks to its efficiency, bit permutation has emerged as an optimal choice for state-wise diffusion. It can be impl...