Abstract
In this paper we consider the problem of encrypting messages containing characters from small, usually non-binary alphabets by means of binary encryption algorithms. It is shown that the solutions as proposed by ISO-10126 can be improved with respect to the expansion factor and, more importantly, with respect to the cryptographic security. Also, a method is presented which is optimal in this sense, i.e. no expansion and optimal cryptographic security.
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.
