Quadratic time algorithm for inversion of binary permutation polynomials
Résumé
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
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...