Abstract
Even the purest of pure mathematics can have a crucial influence on practical problems. In this article we show how a topic in pure mathematics (modular arithmetic) originally pursued for its own interest only, turns out to have unexpected application to an area of communication theory (cryptography). The fact that at the present time it is easy to construct large prime numbers but very difficult to factorise large composite numbers has made it possible to devise simple codes which are uncrackable by known methods.
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.
