搜索结果: 1-10 共查到“军事学 N forms”相关记录10条 . 查询时间(0.031 秒)
On the (non) obfuscating power of Garside Normal Forms
group based cryptography post-quantum digital signatures conjugacy search problem
2018/11/30
Braid groups are infinite non-abelian groups naturally arising from geometric braids that have been used in cryptography for the last two decades. In braid group cryptography public braids often conta...
Examining Complex Forms of Conflict: Gray Zone and Hybrid Challenges
Conflict Gray Zone Hybrid Challenges Defining Hybrid Warfare
2019/10/11
The Joint Force, and the national security community as a whole, must be ready and able to respond to numerous challenges across the full spectrum of conflict including complex operations during peace...
Practical Functional Encryption for Bilinear Forms
public-key cryptography Functional Encryption
2016/12/7
We present a practically efficient functional encryption scheme for the class of functionalities
that can be expressed via bilinear forms over the integers. Bilinear forms are a general class of quad...
New Quadratic Bent Functions in Polynomial Forms with Coefficients in Extension Fields
Bent function Boolean function
2014/3/12
In this paper, we first discuss the bentness of a large class of quadratic Boolean functions in polynomial form $f(x)=\sum_{i=1}^{\frac{n}{2}-1}Tr^n_1(c_ix^{1+2^i})+ Tr_1^{n/2}(c_{n/2}x^{1+2^{n/2}})$,...
A generalization of the class of hyper-bent Boolean functions in binomial forms
Boolean functions bent functions hyper-bent functions
2012/6/14
Bent functions, which are maximally nonlinear Boolean functions with even numbers of variables and whose Hamming distance to the set of all affine functions equals $2^{n-1}\pm 2^{\frac{n}{2}-1}$, were...
A generalization of the class of hyper-bent Boolean functions in binomial forms
foundations / Boolean functions bent functions hyper-bent functions Walsh-Hadamard transformation Kloosterman sums
2012/3/20
Bent functions, which are maximally nonlinear Boolean functions with even numbers of variables and whose Hamming distance to the set of all affine functions equals $2^{n-1}\pm 2^{\frac{n}{2}-1}$, were...
A generalization of the class of hyper-bent Boolean functions in binomial forms
Boolean functions bent functions hyper-bent functions
2012/8/28
Bent functions, which are maximally nonlinear Boolean functions with even numbers of variables and whose Hamming distance to the set of all affine functions equals $2^{n-1}\pm 2^{\frac{n}{2}-1}$, were...
MULTI-PARTY AUTHENTICATED KEY AGREEMENT PROTOCOLS FROM MULTILINEAR FORMS
Multilinear forms Key Agreement protocol Authentication
2009/4/15
Joux [10] presented a one round protocol for tripartitie key agreement
and Al-Riyami et.al. [15] developed a number of tripartitie, one round, authenticated
protocols related to MTI and MQV protocol...
Applications of Multilinear Forms to Cryptography
pairing-based cryptography elliptic curve cryptography abelian variety cryptography
2009/4/14
We study the problem of finding efficiently computable non-degenerate
multilinear maps from Gn1 to G2, where G1 and G2 are groups of the same prime order, and where computing discrete logarithms in G...
Scholten Forms and Elliptic/Hyperelliptic Curves with Weak Weil Restrictions
Scholten Forms Elliptic/Hyperelliptic Curves Weak Weil Restrictions
2009/2/25
Scholten Forms and Elliptic/Hyperelliptic Curves with Weak Weil Restrictions.