搜索结果: 1-15 共查到“军事学 decomposition”相关记录27条 . 查询时间(0.031 秒)
Bias-variance Decomposition in Machine Learning-based Side-channel Analysis
Side-channel analysis Machine learning Deep learning
2019/5/28
Machine learning techniques represent a powerful option in profiling side-channel analysis. Still, there are many settings where their performance is far from expected. In such occasions, it is very i...
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...
New Protocols for Secure Linear Algebra: Pivoting-Free Elimination and Fast Block-Recursive Matrix Decomposition
secure linear algebra multiparty computation
2018/8/2
Cramer and Damgård were the first to propose a constant-rounds protocol for securely solving a linear system of unknown rank over a finite field in multiparty computation (MPC). For mm linear equ...
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...
Decomposition of Permutations in a Finite Field
Carlitz Theorem decomposition of power functions threshold implementations
2018/1/30
We describe a method to decompose any power permutation, as a sequence of power permutations of lower algebraic degree. As a result we obtain decompositions of the inversion in GF(2n)GF(2n) for small ...
Generalized Polynomial Decomposition for S-boxes with Application to Side-Channel Countermeasures
s-box decomposition side-channel countermeasure masking
2017/6/28
Masking is a widespread countermeasure to protect implementations of block-ciphers against side-channel attacks. Several masking schemes have been proposed in the literature that rely on the efficient...
High Saturation Complete Graph Approach for EC Point Decomposition and ECDL Problem
ECDL problem Semaev polynomials block ciphers
2016/7/20
One of the key questions in contemporary applied cryptography is whether there exist an efficient algorithm for solving the discrete logarithm problem in elliptic curves. The primary approach for this...
The probing security model is very popular to prove the side-channel security of cryptographic
implementations protected by masking. A common approach to secure nonlinear functions
in this model is ...
On Decomposition of an NFSR into a Cascade Connection of Two Smaller
stream ciphers nonlinear feedback shift registers
2016/1/8
Nonlinear feedback shift registers (NFSRs) are an important type of sequence
generators used for building stream ciphers. The shift register used in Grain, one
of eSTREAM finalists, is a cascade con...
Recently, Kalikinkar Mandal and Guang Gong presented a family of nonlinear pseudorandom
number generators using Welch-Gong Transformations in their paper [6]. They also performed
the cycle decomposi...
A New Method for Decomposition in the Jacobian of Small Genus Hyperelliptic Curves
Discrete Log Index calculus Hyperelliptic curve
2016/1/6
Decomposing a divisor over a suitable factor basis in the Jacobian of a hyperelliptic
curve is a crucial step in an index calculus algorithm for the discrete log problem in the
Jacobian. For small g...
Point Decomposition Problem in Binary Elliptic Curves
Semaev polynomials elliptic curves point decomposition problem
2015/12/31
We analyze the point decomposition problem (PDP) in binary elliptic
curves. It is known that PDP in an elliptic curve group can be reduced to solving
a particular system of multivariate non-linear s...
We demonstrate the first attacks on the SPN ciphers with 6, 7, 8, and 9 secret layers. In particular,
we show a decomposition attack on the SASASASAS scheme when the S-box size m and the block
lengt...
A Matrix Decomposition Method for Optimal Normal Basis Multiplication
Finite fields matrix decomposition method
2015/12/24
We introduce a matrix decomposition method and prove that multiplication in GF(2^k) with a Type 1 optimal normal basis for can be performed using k^2-1 XOR gates irrespective of the choice of the irre...
Efficient MDS Diffusion Layers Through Decomposition of Matrices
Diffusion layer MDS matrix Symmetric cipher
2015/12/24
Diffusion layers are critical components of symmetric ciphers. MDS matrices are diffusion layers of maximal branch number which have been used in various symmetric ciphers. In this article, we examine...