Cantitate/Preț
Produs
Total produse
Vezi coșul
Arithmetic of Finite Fields: 9th International Workshop, WAIFI 2022, Chengdu, China, August 29 – September 2, 2022, Revised Selected Papers de Sihem Mesnager

Arithmetic of Finite Fields: 9th International Workshop, WAIFI 2022, Chengdu, China, August 29 – September 2, 2022, Revised Selected Papers: Lecture Notes in Computer Science, cartea 13638

Editat de Sihem Mesnager, Zhengchun Zhou
en Limba Engleză Paperback – 11 ian 2023
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 49623 lei

Preț vechi: 62029 lei
-20% Nou

Puncte Express: 744
Preț estimativ în valută:
9497€ • 9865$ • 7888£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783031229435
ISBN-10: 3031229436
Pagini: 349
Ilustrații: XI, 349 p. 12 illus.
Dimensiuni: 155 x 235 mm
Greutate: 0.51 kg
Ediția:1st ed. 2023
Editura: Springer International Publishing
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

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.