supported by National Cryptography Development Fund(Grant No.MMJJ20170102);National Natural Science Foundation of China(Grant Nos.61572293,61502276,61692276);Natural Science Foundation of Shandong Province(Grant No.ZR2016FM22);Major Scientific and Technological Innovation Projects of Shandong Province,China(Grant No.2017CXGC0704)。
Dear editor,SAT solvers,based on heuristic algorithms,are used to solve Boolean satisfiability(SAT)problems.Satisfiability modulo theories(SMT)problem is a decision problem concerned with the satisfiability of a logic...
supported by National Basic Research Program of China (973 Program) (Grant No. 2013CB834205);National Natural Science Foundation of China (Grant No. 61672019);Fundamental Research Funds of Shandong University (Grant No. 2016JC029);Foundation of Science and Technology on Information Assurance Laboratory (Grant No. KJ-15-002)
Sinapira v2 is a family of cryptographic permutations proposed at ASIACRYPT 2016, and can be used to construct high throughput block ciphers by using the Even-Mansour construction, permutation- based hashing, and wide...
supported by National Natural Science Foundation of China(Grant Nos.61272488;61402523);Foundation of Science and Technology on Information Assurance Laboratory(Grant No.KJ-13-007)
In this paper, we propose a new n-round key recovery attack using modified slender-set linear cryptanalysis on PRESENT-like cipher with public S-boxes. In our attack, an effective method for distinguishing the right k...