Arithmetic of Finite Fields -

Arithmetic of Finite Fields

9th International Workshop, WAIFI 2022, Chengdu, China, August 29 – September 2, 2022, Revised Selected Papers
Buch | Softcover
XI, 349 Seiten
2023 | 1st ed. 2023
Springer International Publishing (Verlag)
978-3-031-22943-5 (ISBN)
80,24 inkl. MwSt
This 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.

Structures 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.

Erscheinungsdatum
Reihe/Serie Lecture Notes in Computer Science
Zusatzinfo XI, 349 p. 12 illus.
Verlagsort Cham
Sprache englisch
Maße 155 x 235 mm
Gewicht 551 g
Themenwelt Mathematik / Informatik Informatik Theorie / Studium
Mathematik / Informatik Mathematik Angewandte Mathematik
Schlagworte authentication • binary codes • bit error rate • Block Codes • communication channels (information theory) • Communication Systems • Computer Networks • Computer Security • cryptography • Data Security • Elliptic Curve • Field Programmable Gate Array (FPGA) • Finite Fields • graph theory • Information Theory • linear codes • Matrix Algebra • Probability • Public Key Cryptography • Signal Processing • Signal to Noise Ratio • theoretical computer science
ISBN-10 3-031-22943-6 / 3031229436
ISBN-13 978-3-031-22943-5 / 9783031229435
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
was jeder über Informatik wissen sollte

von Timm Eichstädt; Stefan Spieker

Buch | Softcover (2024)
Springer Vieweg (Verlag)
37,99
Grundlagen – Anwendungen – Perspektiven

von Matthias Homeister

Buch | Softcover (2022)
Springer Vieweg (Verlag)
34,99
Eine Einführung in die Systemtheorie

von Margot Berghaus

Buch | Softcover (2022)
UTB (Verlag)
25,00