Correction to: On generalizations of differential uniform permutations over finite fields based on 2-to-1 mappings

o r g / 1 0 . 1 0 0 7 / s 0 0 2 0 0 -0 2 5 -0 0 6 9 1 -9A careful re-examination of the original work indicates that certain mathematical imprecisions influenced the accuracy of some results.The following corrections are given in detail, using the same notation as in the original paper [1].Theorem [Thoerem 3.1 [1]], demonstrates that t(x) does not possess the PcN property when g(x) is nonlinear.To address both linear and nonlinear aspects of g(x), it is necessary that t(x) is a permutation.By imposing this permutation condition on t(x), the following result is established as Theorem 1.

Authors

Institutions

Publication Details

Journal
Applicable Algebra in Engineering Communication and Computing
Published
2026-01-06
DOI
https://doi.org/10.1007/s00200-025-00718-1
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Correction to: On generalizations of differential uniform permutations over finite fields based on 2-to-1 mappings

Varsha Jarali, Sihem Mesnager, Prasanna Poojary, G. R. Vadiraja Bhatta
Applicable Algebra in Engineering Communication and Computing
Coding theory and cryptography
article

Correction to: On generalizations of differential uniform permutations over finite fields based on 2-to-1 mappings

Varsha Jarali, Sihem Mesnager, Prasanna Poojary, G. R. Vadiraja Bhatta
article en

Abstract

o r g / 1 0 . 1 0 0 7 / s 0 0 2 0 0 -0 2 5 -0 0 6 9 1 -9A careful re-examination of the original work indicates that certain mathematical imprecisions influenced the accuracy of some results.The following corrections are given in detail, using the same notation as in the original paper [1].Theorem [Thoerem 3.1 [1]], demonstrates that t(x) does not possess the PcN property when g(x) is nonlinear.To address both linear and nonlinear aspects of g(x), it is necessary that t(x) is a permutation.By imposing this permutation condition on t(x), the following result is established as Theorem 1.

Applicable Algebra in Engineering Communication and Computing
Télécom Paris (FR), Centre National de la Recherche Scientifique (FR), Manipal Academy of Higher Education (IN), Université Paris Cité (FR), Sorbonne Paris Cité (FR), Laboratoire Analyse, Géométrie et Applications (FR), Université Paris 8 (FR)
Openalex Percentile: Top 95%
Coding theory and cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Correction to: On generalizations of differential uniform permutations over finite fields based on 2-to-1 mappings — Varsha Jarali, Sihem Mesnager, et al. · Applicable Algebra in Engineering Communication and Computing (2026) | TGRS Research Map | TGRS