搜索结果: 1-10 共查到“密码学 Automatic search”相关记录10条 . 查询时间(0.109 秒)
Automatic Search for A Variant of Division Property Using Three Subsets (Full Version)
Division Property Three-Subset STP
2018/12/11
The division property proposed at Eurocrypt'15 is a novel technique to find integral distinguishers, which has been applied to most kinds of symmetric ciphers such as block ciphers, stream ciphers, an...
Automatic Search of Bit-Based Division Property for ARX Ciphers and Word-Based Division Property
Automatic search Division property ARX
2017/9/13
Division property is a generalized integral property proposed by Todo at Eurocrypt 2015. Previous tools for automatic searching are mainly based on the Mixed Integer Linear Programming (MILP) method a...
New Automatic Search Tool for Impossible Differentials and Zero-Correlation Linear Approximations
Automatic search tool impossible differential zero-correlation linear
2016/7/13
Impossible differential cryptanalysis and zero-correlation linear cryptanalysis are two of the most useful cryptanalysis methods in the field of symmetric ciphers. Until now, there are several automat...
Automatic Search for a Maximum Probability Differential Characteristic in a Substitution-Permutation Network
Block ciphers Cryptanalysis
2016/6/27
The algorithm presented in this paper computes a maximum probability differential characteristic in a Substitution-Permutation Network (or SPN). Such characteristics can be used to prove that a cipher...
Automatic Search of Meet-in-the-Middle and Impossible Differential Attacks
automatic search meet-in-the-middle impossible truncated differential
2016/6/7
Tracking bits through block ciphers and optimizing attacks at hand is one of the tedious task symmetric cryptanalysts have to deal with. It would be nice if a program will automatically handle them at...
Automatic Search for Key-Bridging Technique: Applications to LBlock and TWINE (Full Version)
Block Ciphers Key-Bridging Technique Automatic Search
2016/5/3
Key schedules in block ciphers are often highly simplified, which causes weakness that can be exploited in many attacks. At ASIACRYPT 2011, Dunkelman et al. proposed a technique using the weakness in ...
MILP-Based Automatic Search Algorithms for Diff erential and Linear Trails for Speck
Automatic Search Differential Trail Linear Trail
2016/4/26
In recent years, Mixed Integer Linear Programming (MILP) has been successfully applied in searching for differential characteristics and linear approximations in block ciphers and has produced the sig...
Automatic Search for the Best Trails in ARX:Application to Block Cipher Speck
Symmetric-key Cryptanalysis ARX
2016/4/26
We propose the first adaptation of Matsui's algorithm for finding the best differential and linear trails to the class of ARX ciphers. It is based on a branch-and-bound search strategy, does not use a...
Automatic Search for Differential Trails in ARX Ciphers (Extended Version)
tools for cryptanalysis automatic search
2014/3/5
We propose a tool for automatic search for differential trails in ARX ciphers. By introducing the concept of a partial difference distribution table (pDDT) we extend Matsui's algorithm, originally pro...
In 2004, Wang et al. obtained breakthrough collision attacks on the main
hash functions from the MD4 family. The attacks are differential attacks in which one
closely follows the inner steps of the ...