Algorithms
Developing efficient algorithms that power faster, smarter, and more reliable computing across diverse applications.
Regret in Online Combinatorial Optimization
Candidate Multilinear Maps
I will describe plausible lattice-based constructions with properties that approximate the sought-after multilinear maps in hard-discrete-logarithm groups. These new constructions radically enhance our tool set and open a floodgate of applications. I will present some…
An Overview of Lattice Reduction Algorithms
The best generic tool currently known for attacking lattice-based cryptographic primitives is lattice reduction. Lattice reduction is a representation paradigm: it consists in finding a representation (a basis) of a given lattice that provides easier…
Leslie Lamport Receives Turing Award
Leslie Lamport first began dabbling in computers while he was still in high school. Nothing too unusual about that—until you consider that this was in the mid-1950s. Lamport was attending the Bronx High School of…