The Role of Mathematics in Encryption and Decryption: A Session with Second-Year B.E. CSE – IoT Students

Recently, I had the privilege of engaging with the second-year B.E. Computer Science and Engineering (Internet of Things specialization) students to discuss an intellectually stimulating and practically relevant topic: The Importance of Mathematics in Encryption and Decryption.

In an era dominated by digital communication, where our smartphones, IoT devices, and cloud applications exchange sensitive information every second, it is mathematics that forms the invisible shield protecting our privacy. Through this session, I aimed to bridge the gap between theoretical mathematics and its real-world applications in cybersecurity, with a particular emphasis on how it empowers encryption and decryption techniques.

This article serves as both a reflection of that classroom interaction and a broader exploration of why mathematics is indispensable in the science of securing information.

Why Mathematics Matters in Security

The question I posed to my students at the beginning was straightforward:

“What connects a WhatsApp message, an online bank transaction, and the firmware update on an IoT sensor?”

The answer, unsurprisingly, is cryptography, and cryptography is essentially applied mathematics.

Every act of securing a digital message relies on mathematical principles:

• Prime numbers underpin RSA encryption.
• Modular arithmetic enables key exchanges.
• Algebra and number theory form the basis of elliptic curve cryptography.
• Probability and statistics guide randomness in key generation.
• Linear algebra and Boolean logic drive block ciphers like AES.

By highlighting these connections, students began to see mathematics not as abstract formulas in a textbook but as the backbone of digital trust.

Introducing Cryptography to IoT Students

IoT engineering students often see cybersecurity as a software or networking concern. But I reminded them: the small sensors and embedded chips in IoT devices are gateways to massive systems, and their security depends directly on mathematical rigor.

I illustrated this with examples:

1. Smart Home Devices: When a smart lock opens via a mobile app, encryption ensures that the lock is only triggered by the authorized user. Behind the scenes, number theory guarantees this security.
2. Wearable Health Devices: A heart-rate monitor sending patient data to a doctor must encrypt it mathematically to prevent misuse.
3. Industrial IoT: A factory’s IoT-enabled sensors sending production data rely on lightweight but mathematically sound ciphers to avoid industrial espionage.

These scenarios brought the conversation alive, making it clear that without mathematics, IoT would remain vulnerable and untrustworthy.

Core Mathematical Foundations of Encryption

During the lecture, I broke down the core mathematical elements that shape encryption algorithms into digestible parts for second-year students.

1. Number Theory

• Prime factorization is at the heart of RSA.
• Modular arithmetic enables secure key sharing.
• Fermat’s Little Theorem and Euler’s Theorem power many cryptographic proofs.

I emphasized that numbers that seem innocent in theory problems transform into guardians of secrets in digital systems.

2. Abstract Algebra

• Groups, rings, and fields aren’t just abstract—they form the framework of modern cryptography.
• Elliptic Curve Cryptography (ECC), increasingly popular for IoT devices due to its efficiency, is rooted in algebraic structures.

3. Linear Algebra

• Block ciphers like AES rely on matrix operations and transformations.
• Error correction in data transmission is built upon linear algebraic principles.

4. Probability and Statistics

• Randomness and unpredictability are central to cryptographic keys.
• Probability ensures that brute-force attacks are computationally infeasible.

5. Computational Complexity

• The hardness of certain mathematical problems, like factorization and discrete logarithms, guarantees the security of cryptographic protocols.
• Mathematics defines “hard problems” that computers can’t solve quickly—this difficulty is what keeps data safe.

By linking each of these mathematical areas to real encryption methods, I encouraged students to appreciate the applied beauty of pure mathematics.

A Practical Glimpse: Python and Mathematics

To engage the IoT students further, I introduced them to a small Python demonstration of RSA encryption. Watching prime numbers transform into public and private keys, and then into ciphertext and back to plaintext, students experienced mathematics in action.

For many, this was the first time they saw equations leap off the page and into functioning code that secured a message. This hands-on glimpse deepened their appreciation of how theory becomes practice.

Historical Perspective: Mathematics as the Language of Secrets

I also reminded them that mathematics has always played a role in secrecy:

• The Caesar cipher used modular shifts.
• Vigenère cipher relied on periodic keys, essentially modular addition.
• Modern cryptography is simply the continuation of centuries of mathematical ingenuity, scaled up for digital complexities.

This perspective helped them see today’s encryption not as a recent invention but as the latest chapter in a long mathematical story of safeguarding information.

Challenges and Opportunities in IoT Security

While mathematics equips us with powerful tools, I encouraged students to think critically about challenges in IoT cryptography:

• Resource constraints: IoT devices often lack the computational power for heavy encryption.
• Key management: Distributing and updating keys across thousands of sensors is mathematically intensive.
• Quantum threats: With quantum computing, classical problems like factorization may no longer be “hard.”

At the same time, I highlighted opportunities:

• Lightweight cryptography designed for IoT.
• Post-quantum cryptography, a research area where mathematics is leading the way.
• Mathematical optimization for energy-efficient cryptographic protocols.

Student Reflections

What delighted me most was the curiosity students showed at the end of the session. Many admitted they had previously seen mathematics as isolated equations but now realized it is the language that secures the digital world.

Some asked insightful questions like:

• “Will elliptic curve cryptography replace RSA completely in IoT?”
• “How does randomness in key generation truly guarantee security?”
• “Can mathematics detect intrusions, not just encrypt data?”

These questions indicated a deeper understanding and a willingness to explore mathematics not just as learners but as future innovators.

Why This Session Matters

The intersection of mathematics, cryptography, and IoT is not just an academic subject—it’s a career-shaping realization.

For these students, understanding the mathematical backbone of security means:

• They can design robust IoT solutions.
• They are prepared for research in cybersecurity and cryptography.
• They can contribute to national and global security ecosystems.

I emphasized that in the coming decade, professionals who can think mathematically about encryption will be among the most sought-after in technology.

Final Thoughts

As I wrapped up the session, I reminded my students that mathematics is not just about solving equations—it is about solving problems of trust, safety, and communication in our digital lives.

Encryption and decryption are the guardians of modern society, and without mathematics, these guardians would collapse.

Walking out of the classroom, I was left with the strong belief that today’s IoT students, if grounded in mathematics, can become tomorrow’s leaders in digital security.