Description
Modular techniques are widely applied to various algebraic computations. (See [1] for basic modular techniques applied to polynomial computations.) In this talk, we discuss how modular techniques are efficiently applied to computation of various ideal operations such as Gröbner base computation and ideal decompositions. Here, by *modular techniques* we mean techniques using certain projections for improving the efficiency of the total computation, and by *modular computations*, we mean corresponding computations applied to projected images.<br/> [1] : von zur Gathen, J., Gerhard, J.: Modern Computer Algebra. Cambridge University Press, Cambridge (1999)
Next sessions
-
Polytopes in the Fiat-Shamir with Aborts Paradigm
Speaker : Hugo Beguinet - ENS Paris / Thales
The Fiat-Shamir with Aborts paradigm (FSwA) uses rejection sampling to remove a secret’s dependency on a given source distribution. Recent results revealed that unlike the uniform distribution in the hypercube, both the continuous Gaussian and the uniform distribution within the hypersphere minimise the rejection rate and the size of the proof of knowledge. However, in practice both these[…]-
Cryptography
-
Asymmetric primitive
-
Mode and protocol
-
-
Post-quantum Group-based Cryptography
Speaker : Delaram Kahrobaei - The City University of New York