Pages that link to "Item:Q2343240"

The following pages link to On the complexity of the \(F_5\) Gröbner basis algorithm (Q2343240):

Displaying 32 items.

• A signature-based algorithm for computing Gröbner bases over principal ideal domains (Q782709) (← links)
• Stream/block ciphers, difference equations and algebraic attacks (Q820950) (← links)
• Sparse FGLM algorithms (Q1711988) (← links)
• EFLASH: a new multivariate encryption scheme (Q1726680) (← links)
• Speeding up the GVW algorithm via a substituting method (Q1730310) (← links)
• Cryptanalysis of the extension field cancellation cryptosystem (Q2034996) (← links)
• Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE (Q2055603) (← links)
• An algebraic attack on rank metric code-based cryptosystems (Q2055648) (← links)
• \textsc{Ciminion}: symmetric encryption based on Toffoli-gates over large finite fields (Q2056720) (← links)
• Algorithm for studying polynomial maps and reductions modulo prime number (Q2117423) (← links)
• Solving parametric systems of polynomial equations over the reals through Hermite matrices (Q2117425) (← links)
• Security analysis of a cryptosystem based on subspace subcodes (Q2163762) (← links)
• Finding multiple Nash equilibria via machine learning-supported Gröbner bases (Q2178154) (← links)
• Probabilistic analysis on Macaulay matrices over finite fields and complexity of constructing Gröbner bases (Q2204858) (← links)
• PLS-based adaptation for efficient PCE representation in high dimensions (Q2220565) (← links)
• Solving multivariate polynomial systems and an invariant from commutative algebra (Q2232206) (← links)
• Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals (Q2280315) (← links)
• Block-Krylov techniques in the context of sparse-FGLM algorithms (Q2284956) (← links)
• Nœther bases and their applications (Q2330379) (← links)
• On probabilistic algorithm for solving almost all instances of the set partition problem (Q2399381) (← links)
• Gröbner bases of reaction networks with intermediate species (Q2423401) (← links)
• On the complexity exponent of polynomial system solving (Q2658549) (← links)
• On the computation of rational solutions of underdetermined systems over a finite field (Q2685068) (← links)
• The complexity of solving Weil restriction systems (Q2689195) (← links)
• From 5-Pass $$\mathcal {MQ}$$-Based Identification to $$\mathcal {MQ}$$-Based Signatures (Q2953775) (← links)
• MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity (Q2958119) (← links)
• Spectral norm of a symmetric tensor and its computation (Q5113665) (← links)
• Tensor product of evolution algebras (Q6046237) (← links)
• Conormal spaces and Whitney stratifications (Q6072329) (← links)
• Axioms for a theory of signature bases (Q6149142) (← links)
• Distance to the loss of structural properties for linear systems under parametric uncertainties (Q6177551) (← links)
• Dimension results for extremal-generic polynomial systems over complete toric varieties (Q6196136) (← links)