| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4961061 | Procedia Computer Science | 2017 | 7 Pages |
Abstract
It is necessary for us to evaluate immunity against differential attacks when designing secure block ciphers. Finding the lower bound of active S-boxes is an effective method. Based on MILP, we use an improved method to analyze EPCBC. EPCBC is an ultra-lightweight block cipher. The block size of EPCBC is 48-bit/96-bit and the key size of EPCBC is 96-bit key. EPCBC is fit for EPC encryption. The efficiency of EPCBC results in a huge market application. Hence, it is necessary for us to evaluate the security of EPCBC. In this paper, we show that 32 rounds are secure enough for resisting the differential attacks.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Ping Yang, Chuankun Wu, Wentao Zhang,
