搜索结果: 1-15 共查到“军队指挥学 CRT”相关记录22条 . 查询时间(0.04 秒)
Algorithms for CRT-variant of Approximate Greatest Common Divisor Problem
CCK-ACD Lattice orthogonal lattice attack
font style='font-size:12px;'>
2019/3/1
The approximate greatest common divisor problem (ACD) and its variants have been used to construct many cryptographic primitives. In particular, variants of the ACD problem based on Chinese remainder ...
Asymptotically Ideal CRT-based Secret Sharing Schemes for Multilevel and Compartmented Access Structures
cryptographic protocols secret sharing
font style='font-size:12px;'>
2018/11/8
Multilevel and compartmented access structures are two important classes of access structures where participants are grouped into levels/compartments with different degrees of trust and privileges. Th...
Hide The Modulus: A Secure Non-Interactive Fully Verifiable Delegation Scheme for Modular Exponentiations via CRT
Verifiable and secure delegation modular exponentiations cloud security
font style='font-size:12px;'>
2018/7/9
Security protocols using public-key cryptography often requires large number of costly modular exponentiations (MEs). With the proliferation of resource-constrained (mobile) devices and advancements i...
Small CRT-Exponent RSA Revisited
CRT-RSA cryptanalysis Coppersmith's method lattices
font style='font-size:12px;'>
2017/2/20
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...
Algorithmic Countermeasures Against Fault Attacks and Power Analysis for RSA-CRT
Bellcore attack RSA-CRT modular exponentiation
font style='font-size:12px;'>
2016/3/4
In this work, we analyze all existing RSA-CRT countermeasures against the Bellcore attack
that use binary self-secure exponentiation algorithms. We test their security against a powerful
adversary b...
Countermeasures Against High-Order Fault-Injection Attacks on CRT-RSA
RSA CRT fault injection
font style='font-size:12px;'>
2016/1/8
In this paper we study the existing CRT-RSA countermeasures against fault-injection attacks.
In an attempt to classify them we get to achieve deep understanding of how they work.
We show that the ma...
Low Space Complexity CRT-based Bit-Parallel GF(2^n) Polynomial Basis Multipliers for Irreducible Trinomials
Finite field multiplication polynomial basis
font style='font-size:12px;'>
2015/12/30
By selecting the largest possible value of k∈(n/2,2n/3], we further reduce the AND and XOR gate complexities of the CRT-based hybrid parallel GF(2^n) polynomial basis multipliers for the irreduc...
A Formal Proof of Countermeasures Against Fault Injection Attacks on CRT-RSA
RSA CRT
font style='font-size:12px;'>
2014/3/10
In this article, we describe a methodology that aims at either breaking or proving the security of CRT-RSA implementations against fault injection attacks. In the specific case-study of the BellCoRe a...
Formal Analysis of CRT-RSA Vigilant's Countermeasure Against the BellCoRe Attack
fault injection BellCoRe attack
font style='font-size:12px;'>
2014/3/5
In our paper at PROOFS 2013, we formally studied a few known countermeasures to protect CRT-RSA against the BellCoRe fault injection attack. However, we left Vigilant's countermeasure and its alleged ...
CRT-based Fully Homomorphic Encryption over the Integers
public-key cryptography privacy homomorphism Chinese remainder theorem
font style='font-size:12px;'>
2013/2/21
In 1978, Rivest, Adleman and Dertouzos introduced the basic concept of privacy homomorphism that allows computation on encrypted data without decryption. It was elegant work that precedes the recent d...
Modulus Fault Attacks Against RSA-CRT Signatures
implementation / Fault Attacks Digital Signatures RSA CRT Lattices
font style='font-size:12px;'>
2012/3/27
RSA-CRT fault attacks have been an active research area since their discovery by Boneh, DeMillo and Lipton in 1997. We present alternative key-recovery attacks on RSA-CRT signatures: instead of target...
Modulus Fault Attacks Against RSA-CRT Signatures
Fault Attacks Digital Signatures RSA CRT Lattices
font style='font-size:12px;'>
2011/7/25
RSA-CRT fault attacks have been an active research area since their discovery by Boneh, DeMillo and Lipton in 1997.
Cryptanalysis of Dual CRT-RSA
RSA CRT-RSA Dual RSA Dual CRT-RSA Cryptanalysis Lattices
font style='font-size:12px;'>
2010/11/26
Several schemes under the framework of Dual RSA have been proposed by Sun et al (IEEE-IT, August 2007). We here concentrate on the Dual CRT-RSA scheme and present certain range of parameters for which...
An Improved Timing Attack with Error Detection on RSA-CRT
Timing attack RSA T-test Montgomery reduction
font style='font-size:12px;'>
2010/2/20
Several types of timing attacks have been published, but they are either in theory or hard to be taken into practice. In order to improve the feasibility of attack, this paper proposes an advance timi...
CLASS INVARIANTS BY THE CRT METHOD
CRT Hilbert class polynomials CM method
font style='font-size:12px;'>
2010/2/1
We adapt the CRT approach to computing Hilbert class polynomials
to handle a wide range of class invariants. For suitable discriminants D, this
improves its performance by a large constant factor, m...