Abstract
A new symmetric cipher algorithm is introduced in this article. This algorithm is based on multiple quasigroups (QGs), constructed by special kind of mapping called a complete mapping. All these transformations are controlled by equations for encryption and decryption QGs. So, there is a total storage reduction and an ability to use huge number of QGs with large order. Moreover, this proposal is enhanced with a new cyclic random permutation (CRP) to construct randomly big number of QGs. Analytical and comparative study concerned the proposal, was achieved. It proved its strength (key length 192 bits), its speed (encryption times comparable to standard already exists) and its immunity against most known attacks.
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 Machine Learning and Computing
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.
