Gist

#include <m4rie/m4rie.h>
const size_t d = 3;
const size_t m = 1024;
const size_t n = 1024;
const size_t l = 1024;
/*
compile with:
gcc test.c -I. -L. -lm4rie -lm4ri -lm -o test
#include <m4ri/m4ri.h>
/*
compile with:
gcc test.c -lm4ri -lm -o test
*/

NTTs for Power-of-two Rings

from sage.all import ZZ, ceil, is_prime, parent, GF, vector, matrix
def omegaf(n, ell=None):
    return GF(qf(n, ell))(1).nth_root(n)
def qf(n, ell=None):
    """

FP(y)LLL & G6K Lab

# -*- coding: utf-8 -*-
"""
Illustrate behaviour of BKZ algorithm.
.. modulauthor: Martin Albrecht <martin.albrecht@royalholloway.ac.uk>
To convert to movie, call e.g. `ffmpeg -framerate 8 -pattern_type glob -i "*.png" bkz.mkv`
"""
#!/bin/bash
out="$(pwd)/out/"
changed_files=$(git diff-tree --no-commit-id --name-only -r HEAD)
do_the_work_tex() {
(
dir="$1"
filename="$2"
extension="$3"

Keybase proof

I hereby claim:

  • I am malb on github.
  • I am martinralbrecht (https://keybase.io/martinralbrecht) on keybase.
  • I have a public key whose fingerprint is 40BC 7F0D 724B 4AB1 CC98 4014 A040 043C 6532 AFB4

To claim this, I am signing this object:

Read the original on gist.github.com ↗