Lin Hsin Hsin Quantum Security Center





🦶 👞
📦 what is LWE?
Learning  With  Errors

How to achieve it?
GAINING a FOOTHOLD



c = a·s + e mod (xⁿ+1) over ℤ_q NIST BUBBLE WRAP -- FOOTHOLD
c — ciphertext The shoe, laced up, in the box.
What the other person receives
a — public matrix (random) The shoebox. Anyone can see it
Printed on the label
s — secret vector (small) The foot inside. Only you have it.
PRNG spat it out
e — error/noise (small) The sock. Small, invisible,
Without it, the foot slips out
xⁿ+1 — modulus polynomial The shape of the box. Cuts the shoe to fit. Without it, the shoe is infinite
ℤ_q — the ring
(integers mod q)
The floor the box sits on.
Everything wraps around it. q=3329
q = 3329 — the prime The size of the floor.
Next prime that clears 256|(q−1)
That's it
n = 256 — polynomial degree How many toes?
256 slots in the shoe.
mod — reduction Cutting the shoe to fit the box.
Anything that sticks out gets trimmed
· — polynomial multiplication Lacing. Ties the foot to the box.
NTT makes it fast.
That's the only "deep" part