You may have access to the free features available through My Research. You can save searches, save documents, create alerts and more. Please log in through your library or institution to check if you have access.
If you log in through your library or institution you might have access to this article in multiple languages.
Styles include MLA, APA, Chicago and many more. This feature may be available for free if you log in through your library or institution.
You may have access to it for free by logging in through your library or institution.
You may have access to different export options including Google Drive and Microsoft OneDrive and citation management tools like RefWorks and EasyBib. Try logging in through your library or institution to get access to these tools.
The PICO algorithm is a lightweight packet cipher based on substitution and permutation SPN networks proposed by Bansod et al. in 2016. The ability of the PICO algorithm to resist differential and linear analysis is yet to be further evaluated. Based on the MILP model, this paper describes the differential characteristics of the components and the propagation law of the linear mask using a set of inequalities, optimizes the model for the structural characteristics of the cryptographic algorithm and the S-box properties, narrows the search space, and proposes an effective two-step search algorithm for the PICO algorithm. Using this algorithm, three new 21-round differential distinguishers with probability 2−63 are found, and three 20-round linear distinguishers with correlation 2−30 are found, which are the longest linear distinguishers known so far.
