jagomart
digital resources
picture1_Binary Codes Pdf 196731 | Slides


 204x       Filetype PDF       File size 0.92 MB       Source: wesselvanwoerden.com


File: Binary Codes Pdf 196731 | Slides
an algorithmic reduction theory for binary codes lll and more leo ducas cwi thomas debris alazard inria wessel van woerden cwi overview this work propose analogues from lattices to binary ...

icon picture PDF Filetype PDF | Posted on 07 Feb 2023 | 2 years ago
Partial capture of text on file.
    An Algorithmic Reduction Theory for Binary
    Codes: LLL and More
    Leo Ducas (CWI), Thomas Debris-Alazard (Inria),
    ´
    Wessel van Woerden (CWI).
                  Overview
       This work
    Propose analogues from
    lattices to binary codes
     (Defs, Algs, Bounds).
    Speed-up cryptanalytic
   algorithms for code-based
       cryptography. ?
                                      1 / 15
                                  Overview
             This work                           This talk
        Propose analogues from               • Recall the LLL algorithm
       lattices to binary codes                 for lattices.
        (Defs, Algs, Bounds).
                                             • Adapt it to codes.
        Speed-up cryptanalytic                           notion of
      algorithms for code-based                     What        for
            cryptography. ?                        orthogonality
                                                   binary codewords?
                                                                        1 / 15
                                                                                Lattices & Codes
                                               Lattice                                                                                     Binary Code
                                         P                                   k                 n                   C(B) := {P x b : x ∈ Fk} ⊂ Fn
                L(B) := {                        x b : x ∈ Z } ⊂ R                                                                                   i    i
                                              i     i   i                                                                                       i                             2                2
                                            Euclidean                                                                                           Hamming
                                                                 b
                                                                    2
                                                   0                    b
                                                                           1
                                       L=bZ+bZ                                                                              C = {000,011,101,110}
                                                     1               2                                                                                                                                   2 / 15
The words contained in this file might help you see if this file matches what you are looking for:

...An algorithmic reduction theory for binary codes lll and more leo ducas cwi thomas debris alazard inria wessel van woerden overview this work propose analogues from lattices to defs algs bounds speed up cryptanalytic algorithms code based cryptography talk recall the algorithm adapt it notion of what orthogonality codewords lattice p k n c b x fk fn l z r i euclidean hamming bz...

no reviews yet
Please Login to review.