LEADER 03877nam 2200493 450 001 9910644268303321 005 20230501174027.0 010 $a3-031-22944-4 024 7 $a10.1007/978-3-031-22944-2 035 $a(MiAaPQ)EBC7175610 035 $a(Au-PeEL)EBL7175610 035 $a(CKB)25994382000041 035 $a(DE-He213)978-3-031-22944-2 035 $a(PPN)267806930 035 $a(EXLCZ)9925994382000041 100 $a20230501d2023 uy 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 00$aArithmetic of finite fields $e9th International Workshop, WAIFI 2022, Chengdu, China, August 29-September 2, 2022, revised selected papers /$fedited by Sihem Mesnager, Zhengchun Zhou 205 $a1st ed. 2023. 210 1$aCham, Switzerland :$cSpringer,$d[2023] 210 4$dİ2023 215 $a1 online resource (353 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v13638 311 08$aPrint version: Mesnager, Sihem Arithmetic of Finite Fields Cham : Springer International Publishing AG,c2023 9783031229435 320 $aIncludes bibliographical references and index. 327 $aStructures in Finite Fields -- On a conjecture on irreducible polynomials over finite fields with restricted coefficients -- On two applications of polynomials xk ? cx ? d over finite fields and more -- Efficient Finite Field Arithmetic -- Polynomial Constructions of Chudnovsky-Type Algorithms for Multiplication in Finite Fields with Linear Bilinear Complexity -- Reduction-free Multiplication for Finite Fields and Polynomial Rings -- Finite Field Arithmetic in Large Characteristic for Classical and Post-Quantum Cryptography -- Fast enumeration of superspecial hyperelliptic curves of genus 4 with automorphism group V4 -- Coding theory -- Two Classes of Constacyclic Codes with Variable Parameters -- Near MDS Codes with Dimension 4 and Their Application in Locally Recoverable Codes -- Optimal possibly nonlinear 3-PIR codes of small size -- PIR codes from combinatorial structures -- The Projective General Linear Group PGL(2, 5m) and Linear Codes of Length 5m + 1 -- Private Information Retrieval Schemes Using Cyclic Codes -- Two Classes of Optimal Few-Weight Codes over Fq + uFq -- Explicit Non-Malleable Codes from Bipartite Graphs -- Cryptography -- Algebraic Relation of Three MinRank Algebraic Modelings -- Decomposition of Dillon's APN permutation with efficient hardware implementation -- New Versions of Miller-loop Secured against Side-Channel Attacks -- A Class of Power Mappings with Low Boomerang Uniformity -- New Classes of Bent Functions via the Switching Method -- Sequences -- Correlation measure of binary sequence families with trace representation -- Linear complexity of generalized cyclotomic sequences with period pnqm -- On the 2-adic complexity of cyclotomic binary sequences with period p2 and 2p2. 330 $aThis book constitutes the thoroughly refereed post-workshop proceedings of the 8th International Workshop on the Arithmetic of Finite Field, WAIFI 2022, held in Chengdu, China, in August ? September 2022. The 19 revised full papers and 3 invited talks presented were carefully reviewed and selected from 25 submissions. The papers are organized in topical sections: structures in finite fields; efficient finite field arithmetic; coding theory; cryptography; sequences. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v13638 606 $aFinite fields (Algebra) 615 0$aFinite fields (Algebra) 676 $a910.5 702 $aMesnager$b Sihem 702 $aZhou$b Zhengchun 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910644268303321 996 $aArithmetic of Finite Fields$9774277 997 $aUNINA