Arithmetic of Finite Fields (eBook, PDF)
10th International Workshop, WAIFI 2024, Ottawa, ON, Canada, June 10-12, 2024, Revised Selected Papers
Redaktion: Petkova-Nikova, Svetla; Panario, Daniel
46,95 €
46,95 €
inkl. MwSt.
Sofort per Download lieferbar
23 °P sammeln
46,95 €
Als Download kaufen
46,95 €
inkl. MwSt.
Sofort per Download lieferbar
23 °P sammeln
Jetzt verschenken
Alle Infos zum eBook verschenken
46,95 €
inkl. MwSt.
Sofort per Download lieferbar
Alle Infos zum eBook verschenken
23 °P sammeln
Arithmetic of Finite Fields (eBook, PDF)
10th International Workshop, WAIFI 2024, Ottawa, ON, Canada, June 10-12, 2024, Revised Selected Papers
Redaktion: Petkova-Nikova, Svetla; Panario, Daniel
- Format: PDF
- Merkliste
- Auf die Merkliste
- Bewerten Bewerten
- Teilen
- Produkt teilen
- Produkterinnerung
- Produkterinnerung

Bitte loggen Sie sich zunächst in Ihr Kundenkonto ein oder registrieren Sie sich bei
bücher.de, um das eBook-Abo tolino select nutzen zu können.
Hier können Sie sich einloggen
Hier können Sie sich einloggen
Sie sind bereits eingeloggt. Klicken Sie auf 2. tolino select Abo, um fortzufahren.

Bitte loggen Sie sich zunächst in Ihr Kundenkonto ein oder registrieren Sie sich bei bücher.de, um das eBook-Abo tolino select nutzen zu können.
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.
- Geräte: PC
- ohne Kopierschutz
- eBook Hilfe
- Größe: 11.52MB
Andere Kunden interessierten sich auch für
- Arithmetic of Finite Fields (eBook, PDF)61,95 €
- Arithmetic of Finite Fields (eBook, PDF)40,95 €
- Nigel SmartCryptography Made Simple (eBook, PDF)40,95 €
- Arithmetic of Finite Fields (eBook, PDF)40,95 €
- Arithmetic of Finite Fields (eBook, PDF)38,95 €
- Arithmetic of Finite Fields (eBook, PDF)40,95 €
- Amos R. OmondiCryptography Arithmetic (eBook, PDF)73,95 €
-
-
-
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.
Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.
Produktdetails
- Produktdetails
- Verlag: Springer Nature Switzerland
- Seitenzahl: 294
- Erscheinungstermin: 28. Februar 2025
- Englisch
- ISBN-13: 9783031818240
- Artikelnr.: 73520148
- Verlag: Springer Nature Switzerland
- Seitenzahl: 294
- Erscheinungstermin: 28. Februar 2025
- Englisch
- ISBN-13: 9783031818240
- Artikelnr.: 73520148
- Herstellerkennzeichnung Die Herstellerinformationen sind derzeit nicht verfügbar.
.- 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.