Abstract
How to choose a chaotic sequence to construct a chaotic S-box is a key factor to determine the performance of the S-box. In this paper, a construction method for chaotic S-box based on fireworks algorithm is proposed, in which the fireworks algorithm is used to search for the optimal solution in the solution space of the Lorenz chaotic system. The performances of S-box are tested through the nonlinearity, differential uniformity, strict avalanche criterion, output bits independence criterion and bijectivity, and compared with the existing classical S-boxes based on the Lorenz chaotic system. The results indicate that the S-box in this paper has more excellent cryptographic characteristics, which will provide a new idea for the efficient generation of chaotic S-box.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
