6 citations · 6 across the 2 of their papers we have counts for
2 papers
cs.DM2010
Doubly Perfect Nonlinear Boolean Permutations
Laurent Poinsot
Due to implementation constraints the XOR operation is widely used in order to combine plaintext and key bit-strings in secret-key block ciphers. This choice directly induces the c…
cs.DM2010★ 6 cited
Partial monoids: associativity and confluence
Laurent Poinsot, Gérard Duchamp, Christophe Tollu
A partial monoid is a set with a partial multiplication (and total identity ) which satisfies some associativity axiom. The partial monoid may be embedded in…