Skip to content
Best Place To BuildBest Place To Build

Prof. Shweta Agrawal, CSE | "Real-life cryptography is cooler than Imitation Game-the movie"| Ep.13

Ever wondered why even supercomputers can't crack certain codes? Or why the most secure algorithms are inspired by art? This episode unravels these mysteries as Professor Agrawal takes us through: - The hidden beauty of mathematical secrets - Why modern cryptography is cooler than Hollywood depicts - Her journey of merging art with theoretical computer science - Building CyStar and redefining cybersecurity in India Discover why calling computer science "coding" is as absurd as calling surgery "knife science," and explore the delicate dance between structure and randomness that keeps our digital world secure. A profound discussion about quantum-resistant algorithms, the power of Atma Shraddha, and much more. Plus, discover how medical research can use private genomic data without compromising privacy, why RSA encryption was a life-changing moment, and how the war effort transformed modern cryptography. An unmissable episode for anyone interested in mathematics, computer science, cybersecurity, or the future of digital privacy. Chapters: 00:00:00 Introduction 00:01:35 What is Cryptography? 00:02:24 History of Cryptography 00:04:20 Caesar Cipher and Hard Problems 00:05:09 Real-World Applications of Cryptography 00:07:07 Eavesdroppers and Attackers 00:08:01 Defining "Hard" Problems 00:09:24 Algorithms in Cryptography 00:10:11 Public Key Encryption- RSA 00:12:44 P vs NP 00:17:18 Shweta's Research Interests 00:17:57 Computing on Encrypted Data 00:18:53 Examples of Computing on Encrypted Data 00:19:55 The Fine Line Between Structure and Randomness 00:20:30 Analogy for Encrypted Computation 00:24:00 Functional Encryption 00:25:13 Functional Encryption and Quantum Security 00:25:41 Attribute-Based Cryptography 00:26:49 Lattice-Based Cryptography 00:28:10 Hard Problems in Engineering vs. Computer Science 00:29:59 Subfields of Computer Science 00:34:31 Why Study Computer Science? 00:37:56 Pressures on Computer Science Students 00:39:42 India's Position in Cryptography 00:41:38 CyStar Center 00:42:28 CyStar as a Cybersecurity Focused Center 00:46:40 Women in STEM 00:49:02 Performance of Women in STEM 00:51:35 Shweta's Personal Journey 00:55:38 Decision to Return to India 00:57:43 Atma Shraddha (Self-Belief) 01:03:23 Art and Cryptography 01:05:00 Conclusion References Prof. Shweta: https://www.cse.iitm.ac.in/~shwetaag/ CyStar: https://cystar.iitm.ac.in/ To know more about what makes IIT Madras- the Best Place to Build- go on to https://www.bestplacetobuild.com/

Shweta AgrawalguestUnknown Hosthost
Feb 13, 20251h 5mWatch on YouTube ↗

At a glance

WHAT IT’S REALLY ABOUT

Modern cryptography, hard problems, encrypted computation, and building India’s research

  1. Cryptography is framed as the “art of keeping secrets,” enabling private communication, authentication, and secure protocols against algorithmic attackers.
  2. Modern cryptography aims for mathematical, reduction-based security: breaking a scheme should be as hard as solving a well-studied hard problem.
  3. Core ideas like efficient algorithms (polynomial time), hardness assumptions, and the P vs NP question are introduced as the conceptual basis for cryptographic security.
  4. Agrawal’s research focus is computing on encrypted data via functional encryption and related primitives, with an emphasis on post-quantum (lattice-based) security.
  5. The conversation broadens to computer science as “computing” (not just coding), India’s improving cryptography research ecosystem, the CyStar cybersecurity center at IIT Madras, and cultural issues like women’s retention in STEM and “Atma Shraddha” (self-belief).

IDEAS WORTH REMEMBERING

5 ideas

Modern crypto security is about reductions to hard problems, not secrecy-by-obscurity.

Agrawal emphasizes that a secure scheme should be breakable only if an attacker can solve a specific, widely studied hard mathematical problem, giving stronger confidence than ad-hoc designs.

“Attackers” in cryptography are modeled as algorithms with capabilities.

An eavesdropper is a passive attacker who listens, while a stronger attacker may also modify messages; defining these models precisely is central to security claims.

Hardness means “no efficient probabilistic algorithm,” typically no polynomial-time solver.

In practice, “hard” is tuned to the application’s threat horizon (years to centuries), and security parameters are chosen so even massive classical compute can’t break it in reasonable time.

Public-key encryption shifts the burden to protecting a single secret key.

With RSA-style public/secret keys, anyone can encrypt using the public key, but only the holder of the secret key can decrypt—so operational security focuses on safeguarding the private key.

P vs NP underlies the possibility of cryptography, but specific assumptions drive real systems.

Cryptography requires some problems to be efficiently verifiable yet not efficiently solvable; while P vs NP is open, cryptographers rely on concrete conjectures backed by decades of analysis.

WORDS WORTH SAVING

5 quotes

Calling our field computer science is like calling surgery knife science.

— Shweta Agrawal

Cryptography, in a sentence, is the art of keeping secrets.

— Shweta Agrawal

Modern cryptography seeks to... prove to you mathematically that the only way that you can break our code is by solving some very hard mathematical problem.

— Shweta Agrawal

Real-life cryptography is cooler than this movie.

— Shweta Agrawal

Cryptography is really this very fine dance between sort of structure and randomness.

— Shweta Agrawal

Definition and goals of cryptography (secrecy, authentication)From Caesar cipher to provable modern cryptographyAttack models: eavesdroppers vs active attackersHard problems, efficiency, and polynomial timePublic-key encryption and RSAP vs NP and what “hardness” meansQuantum threat and post-quantum cryptographyComputing on encrypted data and multiparty computationFunctional encryption and authorized computationAttribute-based encryption and access controlLattice-based cryptography as rich new toolkitCyStar center: cybersecurity, outreach, and talent-buildingWomen in STEM pipeline and leadership biasReturning to India and “Atma Shraddha” mindsetArt, beauty, and the structure–randomness analogy

High quality AI-generated summary created from speaker-labeled transcript.

Get more out of YouTube videos.

High quality summaries for YouTube videos. Accurate transcripts to search & find moments. Powered by ChatGPT & Claude AI.

Add to Chrome