American Institute of Mathematics workshop page, including statement of workshop goals
Surveys of quantum algorithms and post-quantum cryptography:
More on quantum algorithms:
More on post-quantum cryptography:
algebraic integer: root of monic polynomial with coefficients in \Z
BDD: bounded-distance decoding
BKZ: block Korkin Zolotarev
CDH: computational Diffie–Hellman problem: given g,g^a,g^b, find g^ab
CNOT: controlled NOT gate: linear operator that maps (x,y,z,t) to (x,y,t,z)
CSIDH: commutative supersingular isogeny Diffie–Hellman
CVP: closest-vector problem: problem of finding an element of L closest to v, given vector v and lattice L
DCP: dihedral coset problem
DDH: decision Diffie–Hellman problem: given g,g^a,g^b,g^c, decide whether c=ab
DH: Diffie–Hellman cryptosystem: Alice has secret key a and public key g^a; Bob has secret key b and public key g^b; shared secret g^ab
DHSP: dihedral hidden-subgroup problem
DLP: discrete-logarithm problem: problem of finding b given g and g^b
DSA: Digital Signature Algorithm: a particular standardized signature system
ECDLP: elliptic-curve discrete-logarithm problem
Elligator: a sequence of algebraic operations mapping {0,1}^n injectively to a large fraction of the points on an elliptic curve
G/H: the set {gH: g in G}, assuming H is subgroup of group G
H: Hadamard gate: linear operator that maps (x,y) to (x+y,x−y); "normalized" version divides outputs by sqrt(2)
HSP: hidden-subgroup problem: given group G, and function f on G that induces injective function on the set G/H for some subgroup H, find H
ISD: information-set decoding: a particular strategy for decoding linear codes
KEM: key-encapsulation mechanism: e.g., ciphertext m^e mod n, for random m, communicates session key Hash(m)
LLL: Lenstra–Lenstra–Lovasz algorithm
LWE: learning with errors
MAC: message-authentication code
NCSC UK: UK National Cyber Security Centre
NISQ: noisy intermediate-scale quantum: description of near-future non-fault-tolerant quantum devices
NIST: National Institute of Standards and Technology
NSA: National Security Agency
number field: field that contains field \Q of rational numbers and that has finite dimension has a \Q-vector space; e.g., field \Q(\sqrt(d)) = {a+b sqrt(d): a,b in \Q} if d is in \Q
PIP: principal-ideal problem
QFT: quantum Fourier transform
qRAM: quantum randomly accessible memory: allows array indices in superposition
ring of integers of K: set of algebraic integers contained in K
RSA: Rivest–Shamir–Adleman cryptosystem: m^e mod n etc.
SIDH: supersingular isogeny Diffie–Hellman
SVP: shortest-vector problem: problem of finding a minimum-length nonzero vector in L, given nonzero lattice L
T: T-gate (not to be confused with Toffoli gate): linear operator that maps (x,y) to (x,ζy) where ζ = exp(iπ/4) = sqrt(2) + i sqrt(2)
Every day:
Monday 4 February:
Tuesday 5 February:
Wednesday 6 February:
Thursday 7 February:
Friday 8 February: