Skip to search
Skip to main content
Catalog
Help
Feedback
Your Account
Library Account
Bookmarks
(
0
)
Search History
Search in
Keyword
Title (keyword)
Author (keyword)
Subject (keyword)
Title starts with
Subject (browse)
Author (browse)
Author (sorted by title)
Call number (browse)
search for
Search
Advanced Search
Bookmarks
(
0
)
Princeton University Library Catalog
Start over
Cite
Send
to
SMS
Email
EndNote
RefWorks
RIS
Printer
Bookmark
Arithmetic of finite fields : 9th International Workshop, WAIFI 2022, Chengdu, China, August 29-September 2, 2022, revised selected papers / edited by Sihem Mesnager, Zhengchun Zhou.
Format
Book
Language
English
Εdition
1st ed. 2023.
Published/Created
Cham, Switzerland : Springer, [2023]
©2023
Description
1 online resource (353 pages)
Availability
Available Online
Springer Nature - Springer Computer Science eBooks 2023 English International
Springer Nature - Springer Lecture Notes in Computer Science eBooks
Details
Subject(s)
Finite fields (Algebra)
[Browse]
Editor
Mesnager, Sihem
[Browse]
Zhou, Zhengchun
[Browse]
Series
Lecture Notes in Computer Science, 13638
[More in this series]
Lecture Notes in Computer Science, 1611-3349 ; 13638
[More in this series]
Summary note
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.
Bibliographic references
Includes bibliographical references and index.
Source of description
Description based on print version record.
Contents
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.
Show 24 more Contents items
ISBN
3-031-22944-4
Doi
10.1007/978-3-031-22944-2
Statement on language in description
Princeton University Library aims to describe library materials in a manner that is respectful to the individuals and communities who create, use, and are represented in the collections we manage.
Read more...
Other views
Staff view
Ask a Question
Suggest a Correction
Report Harmful Language
Supplementary Information