Quadratic Time Algorithm for Inversion of Binary Permutation Polynomials

  • Lucas Barthelemy
  • , Delaram Kahrobaei
  • , Guénaël Renault
  • , Zoran Šunić

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationMathematical Software – ICMS 2018 - 6th International Conference, Proceedings
EditorsJames H. Davenport, George Labahn, Josef Urban, Manuel Kauers
PublisherSpringer Verlag
Pages19-27
Number of pages9
ISBN (Print)9783319964171
DOIs
Publication statusPublished - 1 Jan 2018
Externally publishedYes
Event6th International Conference on Mathematical Software, ICMS 2018 - South Bend, United States
Duration: 24 Jul 201827 Jul 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10931 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference6th International Conference on Mathematical Software, ICMS 2018
Country/TerritoryUnited States
CitySouth Bend
Period24/07/1827/07/18

Keywords

  • Lagrange interpolation
  • Obfuscation
  • Permutation polynomial

Fingerprint

Dive into the research topics of 'Quadratic Time Algorithm for Inversion of Binary Permutation Polynomials'. Together they form a unique fingerprint.

Cite this