Abstract

In this article, for Markov ciphers, we prove that they are resistant to differential cryptanalysis and some statements made for MS are obtained. The upper estimates of the probabilities of integer differentials are significantly improved when compared to previously known results. Our differential cryptanalytic algorithm finds weak subkeys that have more than 80 bits and 128 bits for 128-bit keys.

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 call

Disclaimer: 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.