Abstract
The symbolic computation language, Maple, is used tospecify and simulate the performance of time-varying substitution cipher systems known as rotor machines, the most famous examples of which are the ENIGMA machines used by Germany during World War II. A mathematical model is presented, initially for a one-rotor machine. The direct implementation of this model in Maple provides a prototype system from which more efficient implementations are derived via a process of program transformation. The one-rotor system is then generalized to an N -rotor system. The paper provides a tutorial on the application of symbolic computation to a problem of interest to students of mathematics and of computer science.
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 Mathematical Education in Science and 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.
