搜索结果: 1-15 共查到“密码学 Exponent”相关记录27条 . 查询时间(0.093 秒)
A typical countermeasure against side-channel attacks consists of masking intermediate values with a random number. In symmetric cryptographic algorithms, Boolean shares of the secret are typically us...
Handling Correlated Errors: Hardness of LWE in the Exponent
Learning with errors Error-Correction Generic Group Model
2018/11/5
The hardness of decoding random linear codes with errors is a complexity-theoretic assumption with broad applications to cryptography. In contrast, Reed-Solomon codes permit efficient decoding in many...
Coppersmith's lattices and ``focus groups'': an attack on small-exponent RSA
lattice techniques RSA cryptanalysis
2017/9/1
We present a principled technique for reducing the matrix size in some applications of Coppersmith's lattice method for finding roots of modular polynomial equations. It relies on an analysis of the a...
Since May (Crypto'02) revealed the vulnerability of the small CRT-exponent RSA using Coppersmith's lattice-based method, several papers have studied the problem and two major improvements have been ma...
Curious case of Rowhammer: Flipping Secret Exponent Bits using Timing Analysis
Rowhammer fault attack Prime + Probe
2016/6/17
Rowhammer attacks have exposed a serious vulnerability in modern DRAM chips to induce bit flips in data which is stored in memory. In this paper, we develop a methodology to combine timing analysis to...
In this paper, we consider an RSA modulus N = pq, where
the prime factors p, q are of the same size. We present an attack on RSA
when the decryption exponent d is in the form d = M d1 + d0 where M
...
Exponent-inversion Signatures and IBE under Static Assumptions
Dual form signature Identity-based encryption Exponent inversion
2016/1/23
Boneh-Boyen signatures are widely used in many advanced cryptosystems. It has a structure of “inversion in the exponent”, and its unforgeability against q chosen-messages attack is proven under the ...
We initiate the study of a novel class of group-theoretic intractability problems. Inspired by the theory of learning in presence of errors [Regev, STOC'05] we ask if noise in the exponent amplifies i...
Exclusive Exponent Blinding May Not Suffice to Prevent Timing Attacks on RSA
Timing attack RSA CRT exponent blinding
2016/1/6
The references [9, 3, 1] treat timing attacks on RSA with
CRT and Montgomery’s multiplication algorithm in unprotected implementations.
It has been widely believed that exponent blinding would
prev...
Random Self-Reducibility Properties of Learning Problems over Burnside Groups of Exponent 3
foundations / Random self-reducibility Learning with errors Post-quantum cryptography Non-commutative cryptography Burnside groups
2012/3/27
In this work we investigate the hardness of a computational problem introduced in the recent work of Baumslag et al. In particular, we study the $B_n$-LHN problem, which is a generalized version of th...
A Unified Framework for Small Secret Exponent Attack on RSA
public-key cryptography / lattice techniques RSA cryptanalysis
2012/6/14
We address a lattice based method on small secret exponent attack on RSA scheme. Boneh and Durfee reduced the attack into finding small roots of a bivariate modular equation: $x(N+1+y)+1 ￥equiv 0 mod ...
A Unified Framework for Small Secret Exponent Attack on RSA
public-key cryptography / lattice techniques RSA cryptanalysis
2012/3/22
We address a lattice based method on small secret exponent attack on RSA scheme. Boneh and Durfee reduced the attack into finding small roots of a bivariate modular equation: $x(N+1+y)+1 quiv 0 mod e...
A Unified Framework for Small Secret Exponent Attack on RSA
public-key cryptography / lattice techniques RSA cryptanalysis
2012/3/21
We address a lattice based method on small secret exponent attack on RSA scheme. Boneh and Durfee reduced the attack into finding small roots of a bivariate modular equation: $x(N+1+y)+1 quiv 0 mod e...
The Computational Square-Root Exponent Problem- Revisited
Computational Square-Root Exponent Problem- Revisited Computational Diffie-Hellman Problem
2012/3/28
n this paper, we revisit the Computational Square-Root Exponent Problem (CSREP), and give a more generic condition such that CSREP is polynomial-time equivalent to the Computational Diffie-Hellman Pro...
The Computational Square-Root Exponent Problem- Revisited
Diffie-Hellman problem square Diffie-Hellman problem squareroot exponent problem equivalence order
2011/6/9
In this paper, we revisit the Computational Square-Root Exponent Problem (CSREP), and give a more generic condition such that CSREP is polynomial-time equivalent to the Computational Diffie-Hellman Pr...