Skip to main content
Conference Proceedings

Quadratic Time Algorithm for Inversion of Binary Permutation Polynomials

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2018) 10931 LNCS 19-27
DOI: 10.1007/978-3-319-96418-8_3
0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we propose a new version of the Lagrange 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.

Author supplied keywords

Cite

CITATION STYLE

APA

Barthelemy, L., Kahrobaei, D., Renault, G., & Šunić, Z. (2018). Quadratic Time Algorithm for Inversion of Binary Permutation Polynomials. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10931 LNCS, pp. 19–27). Springer Verlag. https://doi.org/10.1007/978-3-319-96418-8_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free