Explore a groundbreaking paper on Gaussian sampling over integers presented at Crypto 2017, delving into efficient, generic, and constant-time techniques developed by Daniele Micciancio and Michael Walter. Gain insights into this critical cryptographic concept and its implications for secure systems design.
Gaussian Sampling over the Integers - Efficient, Generic, Constant Time
Overview
Syllabus
Gaussian Sampling over the Integers Efficient, Generic, Constant Time
Taught by
TheIACR
Related Courses
-
Removing the Strong RSA Assumption from Arguments over the Integers
-
FaCT - A New Language for Constant-Time Programming
-
Indistinguishability Obfuscation for Turing Machines - Constant Overhead and Amortization
-
Non-Crypto Constant-Time Coding
-
Quantum Secure Symmetric Key Cryptography Based on Hidden Shifts
-
QcBits - Constant Time Small Key Code Based Cryptography
