Abstract
Block cipher reaction automata direct graph (BRADG) is used in protection wireless networks. BRADG processes data blocks of B bits with key length of B bits and given ciphertext of size B bits, where B is 64,128,512,...bits. BRADG is a faster and more efficient way to encrypt large data compared with the previous design of block cipher. In this thesis, the researcher presented a study to attack for BRADG algorithm by using linear cryptanalysis technique, by known-plaintexts and corresponding of the ciphertexts. As the results, it's possible to break: one bit in subkey 1-state BRADG cipher with at least 2 to power 3known-plaintext, and 16 bits subkey 1-state BRADG cipher with 2 to power 24 known plaintexts. The success rate of each attack is 84% , 92% ,97% and 99% depending on the number of known plaintext and the probability that the equation of the best approximation holds.
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 callMore From: International Journal of Engineering & Technology
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.
