Info
Arithmetic of Finite Fields : 10th International Workshop, WAIFI 2024, Ottawa, ON, Canada, June 10–12, 2024, Revised Selected Papers / / edited by Svetla Petkova-Nikova, Daniel Panario
| Arithmetic of Finite Fields : 10th International Workshop, WAIFI 2024, Ottawa, ON, Canada, June 10–12, 2024, Revised Selected Papers / / edited by Svetla Petkova-Nikova, Daniel Panario |
| Autore | Petkova-Nikova Svetla |
| Edizione | [1st ed. 2025.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2025 |
| Descrizione fisica | 1 online resource (634 pages) |
| Disciplina | 512.3 |
| Altri autori (Persone) | PanarioDaniel |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science - Mathematics
Computer engineering Computer networks Data structures (Computer science) Information theory Data protection Algorithms Symbolic and Algebraic Manipulation Mathematics of Computing Computer Engineering and Networks Data Structures and Information Theory Data and Information Security Design and Analysis of Algorithms |
| ISBN |
9783031818240
3031818245 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | -- 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. |
| Record Nr. | UNINA-9910984588803321 |
Petkova-Nikova Svetla
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2025 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Arithmetic of Finite Fields : 10th International Workshop, WAIFI 2024, Ottawa, ON, Canada, June 10–12, 2024, Revised Selected Papers / / edited by Svetla Petkova-Nikova, Daniel Panario
| Arithmetic of Finite Fields : 10th International Workshop, WAIFI 2024, Ottawa, ON, Canada, June 10–12, 2024, Revised Selected Papers / / edited by Svetla Petkova-Nikova, Daniel Panario |
| Autore | Petkova-Nikova Svetla |
| Edizione | [1st ed. 2025.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2025 |
| Descrizione fisica | 1 online resource (634 pages) |
| Disciplina | 512.3 |
| Altri autori (Persone) | PanarioDaniel |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science - Mathematics
Computer engineering Computer networks Data structures (Computer science) Information theory Data protection Algorithms Symbolic and Algebraic Manipulation Mathematics of Computing Computer Engineering and Networks Data Structures and Information Theory Data and Information Security Design and Analysis of Algorithms |
| ISBN |
9783031818240
3031818245 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | -- 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. |
| Record Nr. | UNISA-996647866703316 |
|
Petkova-Nikova Svetla
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2025 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
LATIN 2000: Theoretical Informatics [[electronic resource] ] : 4th Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000 Proceedings / / edited by Gaston H. Gonnet, Daniel Panario, Alfredo Viola
| LATIN 2000: Theoretical Informatics [[electronic resource] ] : 4th Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000 Proceedings / / edited by Gaston H. Gonnet, Daniel Panario, Alfredo Viola |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XII, 484 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Computer science—Mathematics Computer communication systems Combinatorics Theory of Computation Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Computation by Abstract Devices Computer Communication Networks |
| ISBN | 3-540-46415-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Random Structures and Algorithms -- Algorithmic Aspects of Regularity -- Small Maximal Matchings in Random Graphs -- Some Remarks on Sparsely Connected Isomorphism-Free Labeled Graphs -- Analysis of Edge Deletion Processes on Faulty Random Regular Graphs -- Equivalent Conditions for Regularity (Extended Abstract) -- Algorithms I -- Cube Packing -- Approximation Algorithms for Flexible Job Shop Problems -- Emerging Behavior as Binary Search Trees Are Symmetrically Updated -- The LCA Problem Revisited -- Combinatorial Designs -- Optimal and Pessimal Orderings of Steiner Triple Systems in Disk Arrays -- Rank Inequalities for Packing Designs and Sparse Triple Systems -- The Anti-Oberwolfach Solution: Pancyclic 2-Factorizations of Complete Graphs -- Web Graph, Graph Theory I -- Graph Structure of the Web: A Survey -- Polynomial Time Recognition of Clique-Width ? 3 Graphs -- On Dart-Free Perfectly Contractile Graphs Extended Abstract -- Graph Theory II -- Edge Colouring Reduced Indifference Graphs -- Two Conjectures on the Chromatic Polynomial -- Finding Skew Partitions Efficiently -- Competitive Analysis, Complexity -- On the Competitive Theory and Practice of Portfolio Selection (Extended Abstract) -- Almost k-Wise Independence and Hard Boolean Functions -- Improved Upper Bounds on the Simultaneous Messages Complexity of the Generalized Addressing Function -- Algorithms II -- Multi-parameter Minimum Spanning Trees -- Linear Time Recognition of Optimal L-Restricted Prefix Codes -- Uniform Multi-hop All-to-All Optical Routings in Rings -- A Fully Dynamic Algorithm for Distributed Shortest Paths -- Computational Number Theory, Cryptography -- Integer Factorization and Discrete Logarithms -- Communication Complexity and Fourier Coefficients of the Diffie–Hellman Key -- Quintic Reciprocity and Primality Test for Numbers of the Form -- Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography -- Analysis of Algorithms I -- Average-Case Analysis of Rectangle Packings -- Heights in Generalized Tries and PATRICIA Tries -- On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths Extended Abstract -- Algebraic Algorithms -- Subresultants Revisited -- A Unifying Framework for the Analysis of a Class of Euclidean Algorithms -- Worst-Case Complexity of the Optimal LLL Algorithm -- Computability -- Iteration Algebras Are Not Finitely Axiomatizable -- Undecidable Problems in Unreliable Computations -- Automata, Formal Languages -- Equations in Free Semigroups with Anti-involution and Their Relation to Equations in Free Groups -- Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers -- Unambiguous Büchi Automata -- Linear Time Language Recognition on Cellular Automata with Restricted Communication -- Logic, Programming Theory -- From Semantics to Spatial Distribution -- On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics -- A Theory of Operational Equivalence for Interaction Nets -- Analysis of Algorithms II -- Run Statistics for Geometrically Distributed Random Variables -- Generalized Covariances of Multi-dimensional Brownian Excursion Local Times -- Combinatorics of Geometrically Distributed Random Variables: Length of Ascending Runs. |
| Record Nr. | UNISA-996465797503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
LATIN 2000: Theoretical Informatics : 4th Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000 Proceedings / / edited by Gaston H. Gonnet, Daniel Panario, Alfredo Viola
| LATIN 2000: Theoretical Informatics : 4th Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000 Proceedings / / edited by Gaston H. Gonnet, Daniel Panario, Alfredo Viola |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XII, 484 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Computer science—Mathematics Computer networks Combinatorial analysis Theory of Computation Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Computation by Abstract Devices Computer Communication Networks Combinatorics |
| ISBN | 3-540-46415-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Random Structures and Algorithms -- Algorithmic Aspects of Regularity -- Small Maximal Matchings in Random Graphs -- Some Remarks on Sparsely Connected Isomorphism-Free Labeled Graphs -- Analysis of Edge Deletion Processes on Faulty Random Regular Graphs -- Equivalent Conditions for Regularity (Extended Abstract) -- Algorithms I -- Cube Packing -- Approximation Algorithms for Flexible Job Shop Problems -- Emerging Behavior as Binary Search Trees Are Symmetrically Updated -- The LCA Problem Revisited -- Combinatorial Designs -- Optimal and Pessimal Orderings of Steiner Triple Systems in Disk Arrays -- Rank Inequalities for Packing Designs and Sparse Triple Systems -- The Anti-Oberwolfach Solution: Pancyclic 2-Factorizations of Complete Graphs -- Web Graph, Graph Theory I -- Graph Structure of the Web: A Survey -- Polynomial Time Recognition of Clique-Width ? 3 Graphs -- On Dart-Free Perfectly Contractile Graphs Extended Abstract -- Graph Theory II -- Edge Colouring Reduced Indifference Graphs -- Two Conjectures on the Chromatic Polynomial -- Finding Skew Partitions Efficiently -- Competitive Analysis, Complexity -- On the Competitive Theory and Practice of Portfolio Selection (Extended Abstract) -- Almost k-Wise Independence and Hard Boolean Functions -- Improved Upper Bounds on the Simultaneous Messages Complexity of the Generalized Addressing Function -- Algorithms II -- Multi-parameter Minimum Spanning Trees -- Linear Time Recognition of Optimal L-Restricted Prefix Codes -- Uniform Multi-hop All-to-All Optical Routings in Rings -- A Fully Dynamic Algorithm for Distributed Shortest Paths -- Computational Number Theory, Cryptography -- Integer Factorization and Discrete Logarithms -- Communication Complexity and Fourier Coefficients of the Diffie–Hellman Key -- Quintic Reciprocity and Primality Test for Numbers of the Form -- Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography -- Analysis of Algorithms I -- Average-Case Analysis of Rectangle Packings -- Heights in Generalized Tries and PATRICIA Tries -- On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths Extended Abstract -- Algebraic Algorithms -- Subresultants Revisited -- A Unifying Framework for the Analysis of a Class of Euclidean Algorithms -- Worst-Case Complexity of the Optimal LLL Algorithm -- Computability -- Iteration Algebras Are Not Finitely Axiomatizable -- Undecidable Problems in Unreliable Computations -- Automata, Formal Languages -- Equations in Free Semigroups with Anti-involution and Their Relation to Equations in Free Groups -- Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers -- Unambiguous Büchi Automata -- Linear Time Language Recognition on Cellular Automata with Restricted Communication -- Logic, Programming Theory -- From Semantics to Spatial Distribution -- On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics -- A Theory of Operational Equivalence for Interaction Nets -- Analysis of Algorithms II -- Run Statistics for Geometrically Distributed Random Variables -- Generalized Covariances of Multi-dimensional Brownian Excursion Local Times -- Combinatorics of Geometrically Distributed Random Variables: Length of Ascending Runs. |
| Record Nr. | UNINA-9910144130003321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||