Все публикации

0:54:27

Cryptography Based on Supersingular Isogenies

0:24:37

Information Theoretic One-Time Programs from Geometrically Local QNC_0 Adversaries

0:35:26

On the Finite Field Isomorphism Problem

0:41:42

Relating Code Equivalence to Other Isomorphism Problems

0:41:26

Asymptotic Improvements to Provable Algorithms for the Code Equivalence Problem

0:23:35

On a Conjecture About the Sum-Freedom of the Binary Multiplicative Inverse Function

0:06:53

CodeBreakHERs summer camp

0:15:39

How to attack LWE

0:18:46

How to decrypt a Module-LWE ciphertext

0:06:11

How to multiply polynomials modulo X^n +1

0:11:42

How to decrypt an LWE ciphertext

0:10:24

How to calculate the shortest vectors of a (small) lattice

0:05:06

How to decide if a lattice is a strict sublattice of another lattice

0:04:44

How to use Pollard's rho method for factoring

0:07:32

How to perform a low exponent attack against RSA

0:18:09

How to perform a CCA2 attack against bad RSA random padding

0:12:19

How to compute the modular inverse of a number

0:08:45

How to perform a binary exponentiation

0:03:01

How to evaluate Euler's phi function

0:07:07

How to solve simultaneous congruences with the CRT

0:04:51

How to estimate the effort to create a collision for a hash function

0:14:49

How to evaluate a block cipher

0:13:19

How to evaluate the advantage of an adversary in the PRF security game

0:05:45

How to calculate the advantage of an adversary in the semantic security game