Abstract
Block substitutions, or bijective mappings of n-bit binary n-tuples, are widely used in cryptography. There is a continuing interest in finding such mappings which are resistant to cryptanalysis. Orthomorphisms can be used for this purpose, and they are shown to be characterized by the property that each maximal subgroup of the group of binary n-tuples is mapped half into itself and half into its complement.
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 callSimilar Papers
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.
