Quadratic time algorithm for inversion of binary permutation polynomials

Abstract : In this paper, we propose a new version of the Lagrangian interpolation applied to binary permutation polynomials and, more generally , permutation polynomials over prime power modular rings. We discuss its application to obfuscation and reverse engineering.Quadratic time algorithm for inversion of binary permutation polynomials
Complete list of metadatas

Cited literature [5 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01981320
Contributor : Guénaël Renault <>
Submitted on : Monday, January 14, 2019 - 11:28:23 PM
Last modification on : Tuesday, August 13, 2019 - 1:42:01 PM

File

inversion-z2n-lcns.pdf
Files produced by the author(s)

Identifiers

Citation

Lucas Barthelemy, Delaram Kahrobaei, Guénaël Renault, Zoran Šunić. Quadratic time algorithm for inversion of binary permutation polynomials. ICMS 2018 - International Congress on Mathematical Software, Jul 2018, South Bend, IN, United States. pp.19-27, ⟨10.1007/978-3-319-96418-8_3⟩. ⟨hal-01981320⟩

Share

Metrics

Record views

44

Files downloads

40