搜索结果: 1-15 共查到“军事学 Affine”相关记录24条 . 查询时间(0.108 秒)
On Noncommutative Cryptography and homomorphism of stable cubical multivariate transformation groups of infinite dimensional affine spaces
Multivariate Cryptography stable transformation groups and semigroups decomposition problem of nonlinear multivariate map into given generators
2019/6/3
Noncommutative cryptography is based on applications of algebraic structures like noncommutative groups, semigroups and non-commutative rings. Its inter-section with Multivariate cryptography contains...
Weights on affine subspaces and some other cryptographic characteristics of Boolean functions of 5 variables
Boolean functions affine classification nonlinearity algebraic degree
2019/5/27
Recently one new key recovery method for a filter generator was proposed. It is based on so-called planar approximations of such a generator. This paper contains the numerical part of the research of ...
Extended Affine and CCZ Equivalence up to Dimension 4
boolean functions extended affine equivalence CCZ equivalence
2019/4/1
For all vectorial boolean functions up to dimension 4, we present canonical representatives for all extended affine (EA) and CCZ equivalence classes. We include the size of each class, as well as its ...
Ever since the first candidate white-box implementations by Chow et al. in 2002, producing a secure white-box implementation of AES has remained an enduring challenge. Following the footsteps of the o...
On CCZ-Equivalence, Extended-Affine Equivalence, and Function Twisting
Boolean functions CCZ-Equivalence EA-equivalence
2018/8/2
Two vectorial Boolean functions are ``CCZ-equivalent'' if there exists an affine permutation mapping the graph of one to the other. It preserves many of the cryptographic properties of a function such...
An Improved Affine Equivalence Algorithm for Random Permutations
Affine equivalence problem block cipher Even-Mansour cipher
2018/2/1
Our algorithm is based on a new structure (called a \emph{rank table}) which is used to analyze particular algebraic properties of a function that remain invariant under invertible affine transformati...
In this work, we describe a simple and efficient construction of a large subset S of F_p, where p is a prime, such that the set A(S) for any non-identity affine map A over F_p has small intersection w...
(Hierarchical) Identity-Based Encryption from Affine Message Authentication
IBE HIBE standard model
2016/1/8
We provide a generic transformation from any affine message authentication code (MAC) to an
identity-based encryption (IBE) scheme over pairing groups of prime order. If the MAC satisfies
a security...
On the behaviors of affine equivalent Sboxes regarding differential and linear attacks
Sboxes affine equivalence differential cryptanalysis
2016/1/4
This paper investigates the effect of affine transformations of the Sbox on the maximal expected differential probability MEDP and linear potential MELP over two rounds of a substitution-permutation n...
Affine Equivalence and its Application to Tightening Threshold Implementations
side-channel protection FPGA TI higher-order
2015/12/24
Motivated by the development of Side-Channel Analysis (SCA)
countermeasures which can provide security up to a certain order, defeating
higher-order attacks has become amongst the most challenging
...
Affine-malleable Extractors, Spectrum Doubling, and Application to Privacy Amplification
Affine-malleable Extractors Spectrum Doubling
2015/12/21
The study of seeded randomness extractors is a major line of research in theoretical computer
science. The goal is to construct deterministic algorithms which can take a “weak” random
source X with ...
Speeding up Ate Pairing Computation in Affine Coordinates
Ate pairing Pairing computation final exponentiation
2013/4/18
At Pairing 2010, Lauter et al's analysis showed that Ate pairing computation in affine coordinates may be much faster than projective coordinates at high security levels. In this paper, we further inv...
It is well-known that, due to the homomorphic properties of the RSA function, textbook RSA signatures are insecure, and a common workaround is to encode messages with a so-called padding function mu b...
Affine Pairings on ARM
implementation / Pairing computation affine coordinates optimal ate pairing, pairing cost ARM architecture
2012/3/28
Pairings on elliptic curves are being used in an increasing number of cryptographic applications on many different devices and platforms, but few performance numbers for cryptographic pairings have be...
Affine Pairings on ARM
implementation Pairing computation affine coordinates optimal ate pairing pairing cost ARM architecture
2011/6/9
Pairings on elliptic curves are being used in an increasing number of cryptographic applications on many different devices and platforms, but few performance numbers for cryptographic pairings have be...