搜索结果: 1-15 共查到“军事学 Linear”相关记录291条 . 查询时间(0.15 秒)
Vectorized linear approximations for attacks on SNOW 3G
SNOW 3G Stream Cipher 5G Mobile System Security
font style='font-size:12px;'>
2019/9/3
SNOW 3G is a stream cipher designed in 2006 by ETSI/SAGE, serving in 3GPP as one of the standard algorithms for data confidentiality and integrity protection. It is also included in the 4G LTE standar...
Linear Approximations of Random Functions and Permutations
random function random permutation multinomial distribution
font style='font-size:12px;'>
2019/8/19
The goal of this paper is to investigate the behavior of the ideal cipher under linear cryptanalysis. The motivation of this work is twofold. First, before a practical cipher can be distinguished from...
Cryptanalysis of Round-Reduced KECCAK using Non-Linear Structures
KECCAK SHA-3 Hash function
font style='font-size:12px;'>
2019/8/2
In this paper, we present new preimage attacks on KECCAK-384 and KECCAK-512 for 2, 3 and 4 rounds. The attacks are based on non-linear structures (structures that contain quadratic terms). These struc...
Improved Heuristics for Short Linear Programs
XOR gate gate count linear system
font style='font-size:12px;'>
2019/7/23
In this article, we propose new heuristics for minimizing the amount of XOR gates required to compute a system of linear equations in GF(2). We first revisit the well known Boyar-Peralta strategy and ...
Athena: A verifiable, coercion-resistant voting system with linear complexity
cryptographic protocols election schemes
font style='font-size:12px;'>
2019/7/8
Seminal work by Juels, Catalano & Jakobsson delivered a verifiable, coercion-resistant voting system with quadratic complexity. This manuscript attempts to advance the state-of-the-art by delivering a...
Linear Complexity of A Family of Binary pq2 -periodic Sequences From Euler Quotients
Cryptography linear complexity binary sequences
font style='font-size:12px;'>
2019/6/21
We first introduce a family of binary pq2pq2 -periodic sequences based on the Euler quotients modulo pqpq, where pp and qq are two distinct odd primes and pp divides q−1q−1. The minimal po...
Generalized Related-Key Rectangle Attacks on Block Ciphers with Linear Key Schedule
Key Recovery Rectangle Attack SKINNY
font style='font-size:12px;'>
2019/6/19
This paper gives a new generalized key-recovery model of related-key rectangle attacks on block ciphers with linear key schedules. The model is quite optimized and applicable to various block ciphers ...
Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles
Fully-Homomorphic Encryption High-Rate Time-Lock Puzzles
font style='font-size:12px;'>
2019/6/19
We show how to combine a fully-homomorphic encryption scheme with linear decryption and a linearly-homomorphic encryption schemes to obtain constructions with new properties. Specifically, we present ...
General Linear Group Action on Tensors: A Candidate for Post-Quantum Cryptography
Group actions isomorphism problems signature schemes
font style='font-size:12px;'>
2019/6/12
Starting from the one-way group action framework of Brassard and Yung (Crypto '90), we revisit building cryptography based on group actions. Several previous candidates for one-way group actions no lo...
On the Local Leakage Resilience of Linear Secret Sharing Schemes
Secret Sharing leakage resilience information theory
font style='font-size:12px;'>
2019/6/5
We consider the following basic question: to what extent are standard secret sharing schemes and protocols for secure multiparty computation that build on them resilient to leakage? We focus on a simp...
A Framework for Cryptographic Problems from Linear Algebra
LWE SIS NTRU
font style='font-size:12px;'>
2019/3/13
We introduce a general framework encompassing the main hard problems emerging in lattice-based cryptography, which naturally includes the recently proposed Mersenne prime cryptosystem, but also code-b...
Efficient Circuit-based PSI with Linear Communication
Private Set Intersection Secure Computation
font style='font-size:12px;'>
2019/3/4
We present a new protocol for computing a circuit which implements the private set intersection functionality (PSI). Using circuits for this task is advantageous over the usage of specific protocols f...
Zero-Correlation Attacks on Tweakable Block Ciphers with Linear Tweakey Expansion
Symmetric-key cryptography tweakable block ciphers zero-correlation
font style='font-size:12px;'>
2019/3/1
The design and analysis of dedicated tweakable block ciphers is a quite recent and very active research field that provides an ongoing stream of new insights. For instance, results of Kranz, Leander, ...
How to Prove a Secret: Zero-Knowledge Proofs on Distributed Data via Fully Linear PCPs
linear PCPs proof systems zero knowledge
font style='font-size:12px;'>
2019/3/1
We introduce and study the notion of fully linear probabilistically checkable proof systems. In such a proof system, the verifier can make a small number of linear queries that apply jointly to the in...
Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updateable Structured Reference Strings
zero knowledge zk-SNARKs universal SRS
font style='font-size:12px;'>
2019/2/27
Zero-knowledge proofs have become an important tool for addressing privacy and scalability concerns in cryptocurrencies and other applications. In many systems each client downloads and verifies every...