搜索结果: 1-12 共查到“军事学 conversion”相关记录12条 . 查询时间(0.082 秒)
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...
Improved High-Order Conversion From Boolean to Arithmetic Masking
Side-channel countermeasure high-order masking Boolean to arithmetic conversion
2018/4/10
Masking is a very common countermeasure against side channel attacks. When combining Boolean and arithmetic masking, one must be able to convert between the two types of masking, and the conversion al...
High-Order Conversion From Boolean to Arithmetic Masking
Side-channel attacks and countermeasures boolean and arithmetic masking ISW probing model
2017/3/21
Masking with random values is an effective countermeasure against side-channel attacks. For cryptographic algorithms combining arithmetic and Boolean masking, it is necessary to switch from arithmetic...
Efficient Conversion Method from Arithmetic to Boolean Masking in Constrained Devices
Arithmetic to Boolean masking Kogge-Stone carry look-ahead adder ARX-based cryptographic algorithm
2016/7/4
A common technique employed for preventing a side channel analysis is boolean masking. However, the application of this scheme is not so straightforward when it comes to block ciphers based on Additio...
Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion using Integer Programming
Conversion Bilinear Groups Integer Programming
2016/6/6
Bilinear-type conversion is to convert cryptographic schemes designed over symmetric groups instantiated with imperilled curves into ones that run over more secure and efficient asymmetric groups. In ...
Conversion from Arithmetic to Boolean Masking with Logarithmic Complexity
Side-channel attack first-order countermeasure arithmetic to Boolean conversion
2016/1/6
A general method to protect a cryptographic algorithm against side-channel attacks consists in masking all intermediate variables with a random value. For cryptographic algorithms combining Boolean op...
Lightweight Coprocessor for Koblitz Curves: 283-bit ECC Including Scalar Conversion with only 4300 Gates
elliptic curve cryptosystem implementation public-key cryptography
2015/12/29
We propose a lightweight coprocessor for 16-bit microcontrollers
that implements high security elliptic curve cryptography. It uses
a 283-bit Koblitz curve and offers 140-bit security. Koblitz curve...
Accelerating Scalar Conversion for Koblitz Curve Cryptoprocessors on Hardware Platforms
Scalar Conversion Lazy Reduction
2014/3/10
Koblitz curves are a class of computationally efficient elliptic curves where scalar multiplications can be accelerated using $\tau$NAF representations of scalars. However conversion from an integer s...
Randomized Secure Two-Party Computation for Modular Conversion, Zero Test, Comparison, MOD and Exponentiation
applications / secure two-party computation randomized algorithm efficiency
2012/3/23
When secure arithmetic is required, computation based on secure multiplication ($\MULT$) is much more efficient than computation based on secure boolean circuits. However, a typical application can al...
Optimal Average Joint Hamming Weight and Minimal Weight Conversion of d Integers
Elliptic Curve Cryptography Minimal Weight Conversion Average Joint Hamming Weight Digit Set Expansion
2010/7/13
In this paper, we propose the minimal joint Hamming weight conversion for any binary expansions of $d$ integers. With redundant representations, we may represent a number by many expansions, and the m...
Efficient Conversion of Secret-shared Values Between Different Fields
Efficient Conversion Secret-shared Values Different Fields
2009/6/4
We show how to effectively convert a secret-shared bit b over
a prime field to another field. If initially given a random replicated secret
share this conversion can be done by the cost of revealing...
Efficient Methods for Conversion and Solution of Sparse Systems of Low-Degree Multivariate Polynomials over GF(2) via SAT-Solvers
Algebraic Cryptanalysis logical cryptanalysis SAT solvers MQ
2008/9/18
The computational hardness of solving large systems of sparse and low-degree multivariate equations is a necessary condition for the security of most modern symmetric cryptographic schemes.Notably, mo...