搜索结果: 1-15 共查到“密码学 invariant”相关记录19条 . 查询时间(0.082 秒)
Structural Nonlinear Invariant Attacks on T-310: Attacking Arbitrary Boolean Functions
block ciphers Boolean functions non-linearity
2019/1/2
Recent papers show how to construct polynomial invariant attacks for block ciphers, however almost all such results are somewhat weak: invariants are simple and low degree and the Boolean functions te...
Distinguishing Error of Nonlinear Invariant Attacks
correlation uniform random function uniform random permutation
2018/11/7
Linear cryptanalysis considers correlations between linear input and output combiners for block ciphers and stream ciphers. Daeman and Rijmen (2007) had obtained the distributions of the correlations ...
Constructing TI-friendly Substitution Boxes using Shift-Invariant Permutations
Shift-invariant Threshold implementation Sbox
2018/11/7
The threat posed by side channels requires ciphers that can be efficiently protected in both software and hardware against such attacks. In this paper, we proposed a novel Sbox construction based on i...
Approximate Homomorphic Encryption over the Conjugate-invariant Ring
ring learning with errors homomorphic encryption real number arithmetic
2018/11/6
The Ring Learning with Errors (RLWE) problem over a cyclotomic ring has been the most widely used hardness assumption for the construction of practical homomorphic encryption schemes. However, this re...
Solving Multivariate Polynomial Systems and an Invariant from Commutative Algebra
post-quantum cryptography multivariate cryptography Groebner basis
2017/6/22
The security of several post-quantum cryptosystems is based on the assumption that solving a system of multivariate (quadratic) polynomial equations p1=⋯=pm=0p1=⋯=pm=0 over a finite field ...
Proving Resistance against Invariant Attacks: How to Choose the Round Constants
Block cipher Nonlinear invariant attack Invariant subspace attack
2017/5/31
Many lightweight block ciphers apply a very simple key schedule in which the round keys only differ by addition of a round-specific constant. Generally, there is not much theory on how to choose appro...
New Observations on Invariant Subspace Attack
Invariant subspace attack AES-like Lightweight block ciphers
2017/3/28
Invariant subspace attack is a novel cryptanalytic technique which breaks several recently proposed lightweight block ciphers. In this paper, we propose a new method to bound the dimension of some inv...
Invariant Subspace Attack Against Midori64 and The Resistance Criteria for S-box Designs
Midori Block Cipher Invariant Subspace Attack
2016/12/8
We present an invariant subspace attack on the block cipher Midori64, proposed at Asiacrypt 2015. Our analysis shows that Midori64 has a class of 2^{32} weak keys. Under any such key, the cipher can b...
Nonlinear Invariant Attack --Practical Attack on Full SCREAM, iSCREAM, and Midori64
Nonlinear invariant attack Boolean function Ciphertext-only attack
2016/7/29
In this paper we introduce a new type of attack, called nonlinear invariant attack.
As application examples, we present new attacks that are able to distinguish the full versions
of the (tweakable) ...
In this short note we report on invariant subspaces in Simpira in the case of four registers. In particular, we show that the whole input space (respectively output space) can be partitioned into inva...
Scale-Invariant Fully Homomorphic Encryption over the Integers
Fully Homomorphic Encryption Approximate-GCD Homomorphic AES
2016/1/26
At Crypto 2012, Brakerski constructed a scale-invariant fully homomorphic encryption
scheme based on the LWE problem, in which the same modulus is used throughout the evaluation
process, instead of ...
A key recovery attack to the scale-invariant NTRU-based somewhat homomorphic encryption scheme
key recovery attack private key
2016/1/6
In this paper we present a key recovery attack to the scale-invariant NTRU-based somewhat homomorphic encryption scheme proposed by Bos et al~\cite{NTRUbasedFHE} in 2013. The attack allows us to compu...
A Generic Approach to Invariant Subspace Attacks: Cryptanalysis of Robin, iSCREAM and Zorro
Cryptanalysis Lightweight Cryptography Invariant Subspace
2016/1/4
Invariant subspace attacks were introduced at CRYPTO 2011 to cryptanalyze
PRINTcipher. The invariant subspaces for PRINTcipher were discovered in an ad hoc
fashion, leaving a generic technique to di...
Multilinear Map via Scale-Invariant FHE: Enhancing Security and Efficiency
public-key cryptography multilinear maps
2015/12/22
Cryptographic multilinear map is a useful tool for constructing numerous secure protocols
and Graded Encoding System (GES) is an approximate concept of multilinear map. In multilinear
map context, t...
Cryptanalysis of Yasuda, Takagi and Sakurai's Signature Scheme Using Invariant Subspaces
post-quantum cryptography multivariate public key cryptosystem invariant subspace
2015/12/22
In PQCrypto 2013 Yasuda, Takagi and Sakurai proposed an interesting signature scheme of efficiency $O(n^2)$ with parameter $(q=6781, n=121)$ claimed to have 140-bit security level. Later on almost at ...