搜索结果: 1-15 共查到“军事学 Algebraic”相关记录153条 . 查询时间(0.486 秒)
Towards Instantiating the Algebraic Group Model
Public-key cryptography algebraic group model generic group model
2019/9/16
The Generic Group Model (GGM) is one of the most important tools for analyzing the hardness of a cryptographic problem. Although a proof in the GGM provides a certain degree of confidence in the probl...
Blind Schnorr Signatures in the Algebraic Group Model
Schnorr signatures blind signatures algebraic group model
2019/8/2
We study the security of schemes related to Schnorr signatures in the algebraic group model (AGM) proposed by Fuchsbauer, Kiltz, and Loss (CRYPTO 2018), where the adversary can only compute new group ...
Many cryptographic schemes have been proposed from learning with errors problems over some rings (Ring-LWE). Polynomial time quantum reduction from the approximating Shortest Independent Vectors Probl...
Improved Interpolation Attacks on Cryptographic Primitives of Low Algebraic Degree
Block cipher Cryptanalysis Interpolation attack
2019/7/15
Symmetric cryptographic primitives with low multiplicative complexity have been proposed to improve the performance of emerging applications such as secure Multi-Party Computation. However, primitives...
Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs
Lattices Zero-Knowledge Proofs Commitments
2019/6/4
A key component of many lattice-based protocols is a zero-knowledge proof of knowledge of a vector s⃗ s→ with small coefficients satisfying As⃗ =u⃗ modqAs→=u→modq. While there exist ...
Algebraic Cryptanalysis of STARK-Friendly Designs: Application to MARVELlous and MiMC
MARVELlous Jarvis Friday
2019/4/25
The block cipher Jarvis and the hash function Friday, both members of the MARVELlous family of cryptographic primitives, were recently proposed as custom designs aimed at addressing bottlenecks involv...
The authenticated cipher ACORN is one of the two finalists of the CAESAR competition and is intended for lightweight applications. Because such use cases require protection against physical attacks, s...
Fast Algebraic Immunity of $2^m+2$ & $2^m+3$ variables Majority Function
Fast algebraic immunity Majority function Algebraic immunity
2019/3/20
Boolean functions used in some cryptosystems of stream ciphers should satisfy various criteria simultaneously to resist some known attacks. The fast algebraic attack (FAA) is feasible if one can find ...
Uncovering Algebraic Structures in the MPC Landscape
MPC Landscape Commuting Permutations Systems
2019/3/13
A fundamental problem in the theory of secure multi-party computation (MPC) is to characterize functions with more than 2 parties which admit MPC protocols with information-theoretic security against ...
Algebraic aspects of solving Ring-LWE, including ring-based improvements in the Blum-Kalai-Wasserman algorithm
ring learning with errors learning with errors Ring-LWE
2019/3/1
We provide several reductions of Ring-LWE problems to smaller Ring-LWE problems in the presence of samples of a restricted form (i.e. (a,b) such that a is restricted to a subring, or multiplicative co...
Fuchsbauer, Kiltz, and Loss~(Crypto'18) gave a simple and clean definition of an ￥emph{algebraic group model~(AGM)} that lies in between the standard model and the generic group model~(GGM). Specifica...
Algebraic normal form of a bent function: properties and restrictions
Boolean function bent function linear function
2018/12/3
Maximally nonlinear Boolean functions in nn variables, where n is even, are called bent functions. There are several ways to represent Boolean functions. One of the most useful is via algebraic normal...
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...
Frit is a cryptographic 384-bit permutation recently proposed by Simon et al. and follows a novel design approach for built-in countermeasures against fault attacks. We analyze the cryptanalytic secur...
Leakage-resilient Algebraic Manipulation Detection Codes with Optimal Parameters
Leakage-resilient AMD Algebraic Manipulation Detection Leakage resilient codes
2018/1/17
Algebraic Manipulation Detection (AMD) codes [CDF+08] are keyless message authentication codes that protect messages against additive tampering by the adversary assuming that the adversary cannot “see...