搜索结果: 1-14 共查到“军事学 exponential”相关记录14条 . 查询时间(0.062 秒)
A secret sharing scheme allows a dealer to distribute shares of a secret among a set of nn parties P={p1,…,pn}P={p1,…,pn} such that any authorized subset of parties can reconstruct the secret, yet any...
Poly-Logarithmic Side Channel Rank Estimation via Exponential Sampling
Side Channel Rank Estimation Key Enumeration
2018/11/13
Rank estimation is an important tool for a side-channel evaluations laboratories. It allows estimating the remaining security after an attack has been performed, quantified as the time complexity and ...
Towards Breaking the Exponential Barrier for General Secret Sharing
Exponential Barrier General Secret Sharing
2017/11/10
A secret-sharing scheme for a monotone Boolean (access) function F:{0,1}n→{0,1}F:{0,1}n→{0,1} is a randomized algorithm that on input a secret, outputs nn shares s1,…,sns1,…,sn such that for any (x1,…...
Two-Message Non-Malleable Commitments from Standard Sub-exponential Assumptions
non-malleable commitments two rounds
2017/4/5
Despite fifteen years of research on the round complexity of non-malleable commitments, their exact round complexity has remained open. In particular, the goal of achieving non-malleable commitment pr...
Breaking the Sub-Exponential Barrier in Obfustopia
Indistinguishability Obfuscation Functional Encryption Trapdoor Permutation
2016/2/23
Indistinguishability obfuscation (iO) has emerged as a surprisingly powerful notion. Almost
all known cryptographic primitives can be constructed from general purpose iO and other minimalistic
assum...
Improved Exponential-time Algorithms for Inhomogeneous-SIS
Short integer solution problem (SIS) SWIFFT hash function subset-sum
2016/1/8
The paper is about algorithms for the inhomogeneous short integer solution problem: Given
(A, s) to find a short vector x such that Ax ≡ s (mod q). We consider algorithms for this problem due
to Cam...
In this paper, we prove that the degree of regularity of the family of Square systems, an HFE type of systems, over a prime finite field of odd characteristics $q$ is exactly $q$, and therefore prove ...
In this paper, we prove that the degree of regularity of the family of Square systems, an HFE type of systems, over a prime finite field of odd characteristics $q$ is exactly $q$, and therefore prove ...
Exponential attacks on 6-round Luby-Rackoff and on 5-round Lai-Massey
block ciphers indi erentiability Luby-Racko Lai-Massey
2011/1/12
The random oracle model and the ideal cipher model were proven equivalent after Coron et al. (CRYPTO 08) showed that six Feistel rounds are indifferentiable from an ideal cipher. This result, however,...
Exponential Bounds for Information Leakage in Unknown-Message Side-Channel Attacks
Side Channel Attacks Information Theory
2010/7/14
In Backes&Kopf(2008), the authors introduced an important new information theoretic numerical measure for assessing a system's resistance to unknown-message side-channel attacks and computed a formula...
ON EXPONENTIAL SUMS, NOWTON IDENTITIES AND DICKSON POLYNOMIALS OVER FINITE FIELDS
Nowton identities Dickson Polynomials Finite Fields
2010/2/1
Let Fq be a finite field, Fqs be an extension of Fq, let f(x) ∈ Fq[x] be a polynomial of degree n with gcd(n; q) = 1. We present a recursive formula for evaluating the exponential sum
Σc2Fqs(s)(f(x))...
Exponentiation in finite fields of characteristic 2 is proposed to construct large
bijective S-boxes of block ciphers. We obtain some properties of the exponential Sboxes
that are related to differe...
Relations among Statistical Security Notions or Why Exponential Adversaries are Unlimited
Statistical Security Notions Exponential Adversaries
2009/3/16
In the context of Universal Composability, we introduce the concept of universal
environments and simulators. Then, Universal Composability is equivalent to Universal
Composability wrt. universal en...
Exponential Memory-Bound Functions for Proof of Work Protocols
proof of work protocol memory-bound function anti-spam technique
2009/3/10
In Year 2005, Internet users were twice more likely to receive unsolicited electronic mes-
sages, known as spams, than regular emails. Proof of work protocols are designed to deter
such phenomena an...