搜索结果: 1-13 共查到“军事学 Existence”相关记录13条 . 查询时间(0.093 秒)
On the Non-Existence of Short Vectors in Random Module Lattices
Lattice-based cryptography Fiat-Shamir signatures module lattices
2019/8/30
Recently, Lyubashevsky & Seiler (Eurocrypt 2018) showed that small polynomials in the cyclotomic ring Zq[X]/(Xn+1)Zq[X]/(Xn+1), where nn is a power of two, are invertible under special congruence cond...
When Encryption is Not Enough -- Effective Concealment of Communication Pattern, even Existence (BitGrey, BitLoop)
Zero-Leakage Information Hiding Winnowing
2019/5/27
How much we say, to whom, and when, is inherently telling, even if the contents of our communication is unclear. In other words: encryption is not enough; neither to secure privacy, nor to maintain co...
On the Existence of Non-Linear Invariants and Algebraic Polynomial Constructive Approach to Backdoors in Block Ciphers
block ciphers Boolean functions Algebraic Normal Form
2018/11/19
In this paper we study cryptanalysis with non-linear polynomials cf. Eurocrypt’95 (adapted to Feistel ciphers at Crypto 2004). Previously researchers had serious difficulties in making such attacks wo...
Definitions for Plaintext-Existence Hiding in Cloud Storage
Cloud Storage Side-channel analysis Information Leakage
2018/8/20
Cloud storage services use deduplication for saving bandwidth and storage. An adversary can exploit side-channel information in several attack scenarios when deduplication takes place at the client si...
On the Existence of Three Round Zero-Knowledge Proofs
zero-knowledge round complexity lower bound
2018/3/6
In this work, we study the feasibility of ZK proofs using non-black-box simulation. Our main result is that three round private-coin ZK proofs for NP do not exist (even w.r.t. non-black-box simulation...
On the Non-Existence of Blockwise 2-Local PRGs with Applications to Indistinguishability Obfuscation
PRG Blockwise 2-Local PRGs
2017/4/11
Lin and Tessaro (Eprint 2017/250) recently proposed indistinguishability obfuscation and functional encryption candidates and proved their security based on a standard assumption on bilinear maps and ...
Some results on the existence of tt-all-or-nothing transforms over arbitrary alphabets
foundations combinatorial cryptography
2017/2/28
A (t,s,v)(t,s,v)-all-or-nothing transform is a bijective mapping defined on ss-tuples over an alphabet of size vv, which satisfies the condition that the values of any tt input co-ordinates are comple...
On the (non-)existence of APN $(n,n)$-functions of algebraic degree $n$
almost perfect nonlinear almost bent Boolean function
2016/2/23
In this paper, we study the problem of existence of almost perfect nonlinear (APN) functions of algebraic degree n over \ftwon. We characterize such functions by means of derivatives and power moments...
Two-faced processes and existence of RNG with proven properties
foundations pseudo-randomness
2016/1/27
Random and pseudorandom number generators (RNG and PRNG) are
used for many purposes including cryptographic, modeling and simulation
applications. For such applications a generated bit sequence shou...
On the Existence of Extractable One-Way Functions
Extractable One-Way Functions any adversarial program
2016/1/9
A function f is extractable if it is possible to algorithmically “extract,” from any adversarial program
that outputs a value y in the image of f, a preimage of y. When combined with hardness propert...
The Index j in RC4 is not Pseudo-random due to Non-existence of Finney Cycle
RC4 Non-randomness Pseudo-random Index
2015/12/22
In this very short note we prove that the pseudo-random index j of RC4 is indeed not
pseudo-random. This is a simple result that missed our attention for quite a long time. We
show that in long term...
On the Existence of low-degree Equations for Algebraic Attacks
algebraic attacks block ciphers keystream generators
2009/3/27
Algebraic attacks on block ciphers and stream ciphers have gained more
and more attention in cryptography. The idea is to express a cipher by a system
of equations whose solution reveals the secret ...
ON THE EXISTENCE OF DISTORTION MAPS ON ORDINARY ELLIPTIC CURVES
cryptography Decision Diffie-Hellman
2008/11/13
An important problem in cryptography is the so called Decision Diffie-Hellman problem (henceforth abbreviated
DDH). The problem is to distinguish triples of the form (ga, gb, gab) from arbitrary trip...