Arithmetic of Finite Fields
10th International Workshop, WAIFI 2024, Ottawa, ON, Canada, June 10-12, 2024, Revised Selected Papers
Herausgegeben:Petkova-Nikova, Svetla; Panario, Daniel
Arithmetic of Finite Fields
10th International Workshop, WAIFI 2024, Ottawa, ON, Canada, June 10-12, 2024, Revised Selected Papers
Herausgegeben:Petkova-Nikova, Svetla; Panario, Daniel
- Broschiertes Buch
- Merkliste
- Auf die Merkliste
- Bewerten Bewerten
- Teilen
- Produkt teilen
- Produkterinnerung
- Produkterinnerung
This book constitutes the refereed proceedings of the 10th International Workshop on Arithmetic of Finite Fields, WAIFI 2024, held in Ottawa, Ontario, Canada, during June 10-12, 2024.
The 17 full papers included in this book were carefully reviewed and selected from 29 submissions. They were organized in topical sections as follows: Invited talks; Coding theory; Cryptography and Boolean functions; and Postquantum Cryptography.
Andere Kunden interessierten sich auch für
- Arithmetic of Finite Fields56,99 €
- Arithmetic of Finite Fields38,99 €
- Amos R. OmondiCryptography Arithmetic104,99 €
- Amos R. OmondiCryptography Arithmetic75,99 €
- Arithmetic of Finite Fields38,99 €
- Post-Quantum Cryptography51,99 €
- Post-Quantum Cryptography51,99 €
-
-
-
This book constitutes the refereed proceedings of the 10th International Workshop on Arithmetic of Finite Fields, WAIFI 2024, held in Ottawa, Ontario, Canada, during June 10-12, 2024.
The 17 full papers included in this book were carefully reviewed and selected from 29 submissions. They were organized in topical sections as follows: Invited talks; Coding theory; Cryptography and Boolean functions; and Postquantum Cryptography.
The 17 full papers included in this book were carefully reviewed and selected from 29 submissions. They were organized in topical sections as follows: Invited talks; Coding theory; Cryptography and Boolean functions; and Postquantum Cryptography.
Produktdetails
- Produktdetails
- Lecture Notes in Computer Science 15176
- Verlag: Springer / Springer Nature Switzerland / Springer, Berlin
- Artikelnr. des Verlages: 978-3-031-81823-3
- Seitenzahl: 324
- Erscheinungstermin: 1. März 2025
- Englisch
- Abmessung: 235mm x 155mm x 18mm
- Gewicht: 493g
- ISBN-13: 9783031818233
- ISBN-10: 3031818237
- Artikelnr.: 72201334
- Herstellerkennzeichnung
- Springer-Verlag GmbH
- Tiergartenstr. 17
- 69121 Heidelberg
- ProductSafety@springernature.com
- Lecture Notes in Computer Science 15176
- Verlag: Springer / Springer Nature Switzerland / Springer, Berlin
- Artikelnr. des Verlages: 978-3-031-81823-3
- Seitenzahl: 324
- Erscheinungstermin: 1. März 2025
- Englisch
- Abmessung: 235mm x 155mm x 18mm
- Gewicht: 493g
- ISBN-13: 9783031818233
- ISBN-10: 3031818237
- Artikelnr.: 72201334
- Herstellerkennzeichnung
- Springer-Verlag GmbH
- Tiergartenstr. 17
- 69121 Heidelberg
- ProductSafety@springernature.com
.- Invited talks.
.- The restricted decoding problem and its application to post-quantum cryptography.
.- Algebraic curves over finite fields: rational points and birational invariants.
.- An overview of mathematical problems, cryptosystems, and their interconnection.
.- Making and breaking post-quantum cryptography from elliptic curve.
.- Coding theory.
.- Determining the complete weight distributions of some families of cyclic codes.
.- Central limit theorem for linear eigenvalue statistics of random matrices from binary linear codes.
.- On decoding hyperbolic codes.
.- Fast decoding of group testing results from Reed-Solomon d-disjunct matrices.
.- Quantum CSS Duadic and Triadic Codes: New Insights and Properties.
.- Cryptography and Boolean functions.
.- Prescribing traces of primitive elements in finite fields.
.- On Cryptographic Properties of a Class of Power Permutations in Odd Characteristic.
.- Generating Gaussian pseudorandom noise with binary sequences.
.- An FPGA Accelerated Search Method for Maximum Period NLFSRs File.
.- On fat linearized polynomials.
.- Counting polynomials with distinct roots in finite fields using the subset sum problem.
.- Generalized class group actions on oriented elliptic curves with level structure.
.- Differential biases, c-differential uniformity, and their relation to differential attacks.
.- On the Walsh and Fourier-Hadamard Supports of Boolean functions from a quantum viewpoint.
.- Postquantum Cryptography.
.- Efficient Batch Post-Quantum Signatures with Crystals Dilithium.
.- A Practical Group Signature Scheme based on Rank Metric.
.- SMALL: Scalable Matrix OriginAted Large Integer PoLynomial Multiplication Accelerator for Lattice-based Post-Quantum Cryptography.
.- The restricted decoding problem and its application to post-quantum cryptography.
.- Algebraic curves over finite fields: rational points and birational invariants.
.- An overview of mathematical problems, cryptosystems, and their interconnection.
.- Making and breaking post-quantum cryptography from elliptic curve.
.- Coding theory.
.- Determining the complete weight distributions of some families of cyclic codes.
.- Central limit theorem for linear eigenvalue statistics of random matrices from binary linear codes.
.- On decoding hyperbolic codes.
.- Fast decoding of group testing results from Reed-Solomon d-disjunct matrices.
.- Quantum CSS Duadic and Triadic Codes: New Insights and Properties.
.- Cryptography and Boolean functions.
.- Prescribing traces of primitive elements in finite fields.
.- On Cryptographic Properties of a Class of Power Permutations in Odd Characteristic.
.- Generating Gaussian pseudorandom noise with binary sequences.
.- An FPGA Accelerated Search Method for Maximum Period NLFSRs File.
.- On fat linearized polynomials.
.- Counting polynomials with distinct roots in finite fields using the subset sum problem.
.- Generalized class group actions on oriented elliptic curves with level structure.
.- Differential biases, c-differential uniformity, and their relation to differential attacks.
.- On the Walsh and Fourier-Hadamard Supports of Boolean functions from a quantum viewpoint.
.- Postquantum Cryptography.
.- Efficient Batch Post-Quantum Signatures with Crystals Dilithium.
.- A Practical Group Signature Scheme based on Rank Metric.
.- SMALL: Scalable Matrix OriginAted Large Integer PoLynomial Multiplication Accelerator for Lattice-based Post-Quantum Cryptography.
.- Invited talks.
.- The restricted decoding problem and its application to post-quantum cryptography.
.- Algebraic curves over finite fields: rational points and birational invariants.
.- An overview of mathematical problems, cryptosystems, and their interconnection.
.- Making and breaking post-quantum cryptography from elliptic curve.
.- Coding theory.
.- Determining the complete weight distributions of some families of cyclic codes.
.- Central limit theorem for linear eigenvalue statistics of random matrices from binary linear codes.
.- On decoding hyperbolic codes.
.- Fast decoding of group testing results from Reed-Solomon d-disjunct matrices.
.- Quantum CSS Duadic and Triadic Codes: New Insights and Properties.
.- Cryptography and Boolean functions.
.- Prescribing traces of primitive elements in finite fields.
.- On Cryptographic Properties of a Class of Power Permutations in Odd Characteristic.
.- Generating Gaussian pseudorandom noise with binary sequences.
.- An FPGA Accelerated Search Method for Maximum Period NLFSRs File.
.- On fat linearized polynomials.
.- Counting polynomials with distinct roots in finite fields using the subset sum problem.
.- Generalized class group actions on oriented elliptic curves with level structure.
.- Differential biases, c-differential uniformity, and their relation to differential attacks.
.- On the Walsh and Fourier-Hadamard Supports of Boolean functions from a quantum viewpoint.
.- Postquantum Cryptography.
.- Efficient Batch Post-Quantum Signatures with Crystals Dilithium.
.- A Practical Group Signature Scheme based on Rank Metric.
.- SMALL: Scalable Matrix OriginAted Large Integer PoLynomial Multiplication Accelerator for Lattice-based Post-Quantum Cryptography.
.- The restricted decoding problem and its application to post-quantum cryptography.
.- Algebraic curves over finite fields: rational points and birational invariants.
.- An overview of mathematical problems, cryptosystems, and their interconnection.
.- Making and breaking post-quantum cryptography from elliptic curve.
.- Coding theory.
.- Determining the complete weight distributions of some families of cyclic codes.
.- Central limit theorem for linear eigenvalue statistics of random matrices from binary linear codes.
.- On decoding hyperbolic codes.
.- Fast decoding of group testing results from Reed-Solomon d-disjunct matrices.
.- Quantum CSS Duadic and Triadic Codes: New Insights and Properties.
.- Cryptography and Boolean functions.
.- Prescribing traces of primitive elements in finite fields.
.- On Cryptographic Properties of a Class of Power Permutations in Odd Characteristic.
.- Generating Gaussian pseudorandom noise with binary sequences.
.- An FPGA Accelerated Search Method for Maximum Period NLFSRs File.
.- On fat linearized polynomials.
.- Counting polynomials with distinct roots in finite fields using the subset sum problem.
.- Generalized class group actions on oriented elliptic curves with level structure.
.- Differential biases, c-differential uniformity, and their relation to differential attacks.
.- On the Walsh and Fourier-Hadamard Supports of Boolean functions from a quantum viewpoint.
.- Postquantum Cryptography.
.- Efficient Batch Post-Quantum Signatures with Crystals Dilithium.
.- A Practical Group Signature Scheme based on Rank Metric.
.- SMALL: Scalable Matrix OriginAted Large Integer PoLynomial Multiplication Accelerator for Lattice-based Post-Quantum Cryptography.