Abstract
Mini-AES and S-AES have been proposed in literature to serve as test beds for students and cryptographers. The key schedule generation of both these algorithms can be considered to be based on a non-linear feedback shift register (NFSR). In this paper, we study the key schedule algorithm used in Mini-AES and S-AES regarding two aspects: (a) to know whether any keys of Mini-AES as well as S-AES are weak in the sense that the round keys generated turn out to be same as the actual key (b) to evaluate the period of the sequence generated by the NFSR under various initial conditions. Further, the possibility of deriving the round keys fast as needed in decryption is also explored. Simulation results using C and implementation related evaluation are also presented.
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.
