搜索结果: 1-15 共查到“军事学 Relation”相关记录19条 . 查询时间(0.1 秒)
Relation between o-equivalence and EA-equivalence for Niho bent functions
Bent function Boolean function EA-equivalence
2019/7/15
Boolean functions, and bent functions in particular, are considered up to so-called EA-equivalence, which is the most general known equivalence relation preserving bentness of functions. However, for ...
Breaking the Lightweight Secure PUF: Understanding the Relation of Input Transformations and Machine Learning Resistance
Physically Unclonable Function Machine Learning Modelling Attack
2019/7/15
Physical Unclonable Functions (PUFs) and, in particular, XOR Arbiter PUFs have gained much research interest as an authentication mechanism for embedded systems. One of the biggest problems of (strong...
Generic Hardness of Inversion on Ring and Its Relation to Self-Bilinear Map
MCDH unbalanced modulus
2018/5/22
In this paper, we study the generic hardness of the inversion problem on a ring, which is a problem to compute the inverse of a given prime cc by just using additions, subtractions and multiplications...
On the Relation Between SIM and IND-RoR Security Models for PAKEs
Security Models SIM-based Security IND-based Security
2017/5/31
Password-based Authenticated Key-Exchange (PAKE) protocols allow users, who need only to share a password, to compute a high-entropy shared session key despite passwords being taken from a dictionary....
On the Relation of Random Grid, Probabilistic and Deterministic Visual Cryptography
secret sharing visual cryptography
2014/3/5
Visual cryptography is a special type of secret sharing. Two models of visual cryptography have been independently studied: deterministic visual cryptography, introduced by Naor and Shamir, and random...
On a Relation between the Ate Pairing and the Weil Pairing for Supersingular Elliptic Curves
Ate pairing Weil pairing
2014/3/10
The hyperelliptic curve Ate pairing provides an efficient way to compute a bilinear pairing on the Jacobian variety of a hyperelliptic curve. We prove that, for supersingular elliptic curves with embe...
Relation collection for the Function Field Sieve
function field sieve discrete logarithm polynomial arithmetic finite-field arithmetic
2013/4/18
In this paper, we focus on the relation collection step of the Function Field Sieve (FFS), which is to date the best algorithm known for computing discrete logarithms in small-characteristic finite fi...
New Cube Root Algorithm Based on Third Order Linear Recurrence Relation in Finite Field
applications / cube root algorithm Cipolla-Lehmer algorithm
2013/2/21
In this paper, we present a new cube root algorithm in finite field $\mathbb{F}_{q}$ with $q$ a power of prime, which extends the Cipolla-Lehmer type algorithms \cite{Cip,Leh}. Our cube root method is...
On the relation between the MXL family of algorithms and Gr鯾ner basis algorithms
foundations
2012/3/29
The computation of Gr鯾ner bases remains one of the most powerful methods for tackling the Polynomial System Solving (PoSSo) problem. The most efficient known algorithms reduce the Gr鯾ner basis computa...
The Relation and Transformation between Hierarchical Inner Product Encryption and Spatial Encryption
public-key cryptography / Functional Encryption Hierarchical Inner Product Encryption Spatial Encryption Generic Construction
2012/3/26
Hierarchical inner product encryption (HIPE) and spatial encryption (SE) are two important classes of functional encryption (FE) that have a large number of applications. Although HIPE and SE both inv...
A Note on the Relation between the Definitions of Security for Semi-Honest and Malicious Adversaries
Security Semi-Honest Malicious Adversaries
2010/11/2
In secure computation, a set of parties wish to jointly compute some function of their private inputs while preserving security properties like privacy, correctness and more. The two main adversary mo...
The low degree relation for algebraic attacks on E0 combiner given in
[1] had an error. The correct version of low degree relation for the E0
combiner for use in algebraic attack is given.
Cryptographic Agility and its Relation to Circular Encryption
Circular encryption Cryptographic Agility
2010/3/16
We initiate a provable-security treatment of cryptographic agility. A primitive (for example
PRFs, authenticated encryption schemes or digital signatures) is agile when multiple, individually secure ...
On a Relation Between Verifiable Secret Sharing Schemes and a Class of Error-Correcting Codes
Verifiable Secret Sharing Schemes Error-Correcting Codes
2009/4/10
In this paper we try to shed a new insight on Verifiable Secret Sharing
Schemes (VSS). We first define a new “metric” (with slightly different properties
than the standard Hamming metric). Using thi...
Relation among simulator-based and comparison-based definitions of semantic security
simulator-based and comparison-based definitions semantic security
2009/4/8
Relation among simulator-based and comparison-based definitions of semantic security.