搜索结果: 1-5 共查到“密码学 modular reduction”相关记录5条 . 查询时间(0.109 秒)
LWE Without Modular Reduction and Improved Side-Channel Attacks Against BLISS
LWE problem lattice-based cryptography side-channel analysis
2018/11/19
Our interest in studying this problem stems from the side-channel attack against the BLISS lattice-based signature scheme described by Espitau et al. at CCS 2017. The attack targets a quadratic functi...
A Fast Modular Reduction Method
Barrett's reduction Montgomery's reduction lookup-table-based reduction
2016/1/26
We put forth a lookup-table-based modular reduction method which partitions the
binary string of an integer to be reduced into blocks according to its runs. Its complexity
depends on the amount of r...
Accelerating Fully Homomorphic Encryption over the Integers with Super-size Hardware Multiplier and Modular Reduction
Fully Homomorphic Encryption FPGA
2014/3/7
A fully homomorphic encryption (FHE) scheme is envisioned as being a key cryptographic tool in building a secure and reliable cloud computing environment, as it allows arbitrarily evaluation of a ciph...
SPA-based attack against the modular reduction within a partially secured RSA-CRT implementation
RSA CRT smartcard implementation
2009/3/27
This note describes an SPA-based side channel attack against a CRT implementation of an RSA
function. In contrast with Novak’s attack [8], it concentrates on the initial modular reduction. With the h...
Duality between Multiplication and Modular Reduction
Computer arithmetic Booth recoding Modular reduction Multiplication
2009/1/20
This paper presents a duality between the classical optimally
speeded up multiplication algorithm and some “fast” reduction algo-
rithm. For this, the multiplier is represented by the unique signed ...