搜索结果: 1-15 共查到“军事学 sets”相关记录22条 . 查询时间(0.045 秒)
A set S⊆Fn2S⊆F2n is called degree-dd zero-sum if the sum ∑s∈Sf(s)∑s∈Sf(s) vanishes for all nn-bit Boolean functions of algebraic degree at most dd. Those sets correspond to the supports of...
Achilles' Heel: the Unbalanced Mask Sets May Destroy a Masking Countermeasure
Side Channel Analysis Masking Countermeasures DPA Contest
2018/8/20
Low Entropy Masking Scheme (LEMS) has attracted wide attention for its low-cost feature of small fixed mask sets in Side-Channel-Analysis (SCA). To achieve the expected side channel security, it is ne...
Improved Distinguisher Search Techniques Based on Parity Sets
Division property Parity set Integral attacks
2018/5/22
Division property is a distinguishing property against block ciphers proposed by Todo at EURO- CRYPT 2015. To give a new approach to division property, Christina et al. proposed a new notion called th...
Hadamard Matrices, d-Linearly Independent Sets and Correlation-Immune Boolean Functions with Minimum Hamming Weights
Boolean functions Correlation-immune Minimum-weight
2018/3/26
It is known that correlation-immune (CI) Boolean functions used in the framework of side channel attacks need to have low Hamming weights. In 2013, Bhasin et al. studied the minimum Hamming weight of ...
On the exponents of APN power functions and Sidon sets, sum-free sets, and Dickson polynomials
sum-free sets Dickson polynomials
2017/12/11
On the exponents of APN power functions and Sidon sets, sum-free sets, and Dickson polynomials.
Componentwise APNness, Walsh uniformity of APN functions and cyclic-additive difference sets
secret-key cryptography cyclic-additive difference sets
2017/6/8
In the preprint [Characterizations of the differential uniformity of vectorial functions by the Walsh transform, IACR ePrint Archive 2017/516], the author has, for each even positive δδ, characterized...
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...
Symmetric Digit Sets for Elliptic Curve Scalar Multiplication without Precomputation
Gaussian integers Eisenstein integers
2014/3/6
We describe a method to perform scalar multiplication on two classes of ordinary elliptic curves, namely $E: y^2 = x^3 + Ax$ in prime characteristic $p\equiv 1$ mod~4, and $E: y^2 = x^3 + B$ in prime ...
Impact of Intel's New Instruction Sets on Software Implementation of $GF(2)[x]$ Multiplication
implementation / $GF(2)[x]$ multiplication Karatsuba Algorithm SSE AVX PCLMULQDQ
2012/3/22
PCLMULQDQ, a new instruction that supports $GF(2)[x]$ multiplication, was introduced by Intel in 2010. This instruction brings dramatic change to software implementation of multiplication in $GF(2^m)$...
Impact of Intel's New Instruction Sets on Software Implementation of $GF(2)[x]$ Multiplication
implementation / $GF(2)[x]$ multiplication Karatsuba Algorithm SSE AVX PCLMULQDQ
2012/3/21
PCLMULQDQ, a new instruction that supports $GF(2)[x]$ multiplication, was introduced by Intel in 2010. This instruction brings dramatic change to software implementation of multiplication in $GF(2^m)$...
Fair and Privacy-Preserving Multi-Party Protocols for Reconciling Ordered Input Sets (Extended version)
cryptographic protocols / secure multi-party computation reconciliation protocols privacy
2012/3/28
In this paper, we introduce the first protocols for multi-party, privacy-preserving, fair reconciliation of ordered sets. Our contributions are twofold. First, we show that it is possible to extend th...
Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
Bilinear pairings circuit satisfiability non-interactive zero-knowledge progression-free sets
2011/1/12
In 2010, Groth constructed a non-interactive zero-knowledge (NIZK) argument for circuit satisfiability with communication $\Theta (1)$, verifier's computation $\Theta (|C|)$, and common reference stri...
Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
Additive combinatorics bilinear pairings circuit satisfiability non-interactive zero-knowledge progression-free sets
2012/3/30
In 2010, Groth constructed the only previously known sublinear-communication NIZK circuit satisfiability argument in the common reference string model. We optimize Groth's argument by, in particular, ...
Optimal Authentication of Operations on Dynamic Sets
authenticated data structures accumulators outsourced verifiable computation
2010/8/26
We study the problem of authenticating outsourced set operations performed by an untrusted server over a dynamic collection of sets that are owned by a trusted source. We present efficient methods for...
Attribute-Sets: A Practically Motivated Enhancement to Attribute-Based Encryption
Attribute-Sets Practically Motivated Enhancement Attribute-Based Encryption
2009/8/7
In distributed systems users need to share sensitive objects with others based
on the recipients’ ability to satisfy a policy. Attribute-Based Encryption (ABE) is
a new paradigm where such policies ...