A computational algebraic geometry approach to analyze pseudo-random sequences based on Latin squares
From MaRDI portal
Publication:2326748
DOI10.1007/s10444-018-9654-0zbMath1421.05025OpenAlexW2903839116WikidataQ128752077 ScholiaQ128752077MaRDI QIDQ2326748
Raúl M. Falcón, Félix Gudiel, Victor Alvarez
Publication date: 10 October 2019
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10444-018-9654-0
Orthogonal arrays, Latin squares, Room squares (05B15) Loops, quasigroups (20N05) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (3)
A census of critical sets based on non-trivial autotopisms of Latin squares of order up to five ⋮ A computational approach to analyze the Hadamard quasigroup product ⋮ Using a CAS/DGS to analyze computationally the configuration of planar bar linkage mechanisms based on partial Latin squares
Uses Software
Cites Work
- Classifying partial Latin rectangles
- The set of autotopisms of partial Latin squares
- Nullstellensätze for zero-dimensional Gröbner bases
- On the number of 8\(\times 8\) Latin squares
- Solving zero-dimensional algebraic systems
- On decomposing systems of polynomial equations with finitely many solutions
- Some applications of quasigroups in cryptology
- Two-line graphs of partial Latin rectangles
- Enumerating partial Latin rectangles
- Enumeration and classification of self-orthogonal partial Latin rectangles by using the polynomial method
- Partial Latin rectangle graphs and autoparatopism groups of partial Latin rectangles with trivial autotopism groups
- Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
- Gröbner bases and the number of Latin squares related to autotopisms of order \(\leq 7\)
- Symmetries of partial Latin squares
- Classification of quasigroups by random walk on torus.
- A Latin square autotopism secret sharing scheme
- The Latin squares and the secret sharing schemes
- SHARPER COMPLEXITY BOUNDS FOR ZERO-DIMENSIONAL GRÖBNER BASES AND POLYNOMIAL SYSTEM SOLVING
- The number of Latin squares of order 11
- Small latin squares, quasigroups, and loops
- Counting and enumerating partial Latin rectangles by means of computer algebra systems and CSP solvers
- Computing Autotopism Groups of Partial Latin Rectangles
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A computational algebraic geometry approach to analyze pseudo-random sequences based on Latin squares
