Speeding up the GVW algorithm via a substituting method
type: Item
instance of: scholarly article
title: Speeding up the GVW algorithm via a substituting method
zbMATH Open document ID: 1417.68294
author: Ting Li
author: Yao Sun
author: Zhenyu Huang
author: Dingkang Wang
author: Dongdai Lin
published in: Journal of Systems Science and Complexity
publication date: 2019-03-06T00:00:00Z
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 13P10
zbMATH DE Number: 7032435
zbMATH Keywords: Gröbner basis
zbMATH Keywords: GVW
zbMATH Keywords: signature-based algorithm
zbMATH Keywords: time-memory tradeoff
describes a project that uses: PRESENT
describes a project that uses: GBLA
describes a project that uses: F5C
describes a project that uses: M4RI
describes a project that uses: Trivium
MaRDI profile type: Publication
full work available at URL: s11424-019-8345-3
OpenAlex ID: W2911637424
cites work: 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
cites work: Q3325833
cites work: A new efficient algorithm for computing Gröbner bases \((F_4)\)
cites work: Q3374924
cites work: Q4660688
cites work: F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases
cites work: Extended \(F_5\) criteria
cites work: The F5 criterion revised
cites work: Signature rewriting in gröbner basis computation
cites work: A new incremental algorithm for computing Groebner bases
cites work: A new framework for computing Gröbner bases
cites work: A generalized criterion for signature related Gröbner basis algorithms
cites work: A signature-based algorithm for computing Gröbner bases in solvable polynomial algebras
cites work: GBLA
cites work: On the complexity of the \(F_5\) Gröbner basis algorithm
cites work: Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases
cites work: Practical Gröbner basis computation
cites work: An improvement over the GVW algorithm for inhomogeneous polynomial systems
cites work: On implementing the symbolic preprocessing function over Boolean polynomial rings in Gröbner basis algorithms using linear algebra
cites work: PRESENT: An Ultra-Lightweight Block Cipher
cites work: Slender-set differential cryptanalysis
cites work: Differential cryptanalysis of PRESENT-like cipher
cites work: Trivium: A Stream Cipher Construction Inspired by Block Cipher Design Principles
cites work: Attacking Bivium and Trivium with the Characteristic Set Method
cites work: Optimising Gröbner bases on Bivium
cites work: A New Method for Solving Polynomial Systems with Noise over $\mathbb{F}_2$ and Its Applications in Cold Boot Key Recovery
cites work: Characteristic set algorithms for equation solving in finite fields
cites work: Q3208084
cites work: An analysis of inhomogeneous signature-based Gröbner basis computations
DOI: 10.1007/S11424-019-8345-3
Recommended article: An accelerated subspace iteration method
Recommended article: Gearhart-Koshy acceleration for affine subspaces
Recommended article: Fast subspace approximation via greedy least-squares
Recommended article: Q3799814
Recommended article: Q3716319
Recommended article: A Greedy Algorithm for Subspace Approximation Problem
Recommended article: Fast Cadzow's algorithm and a gradient variant
Recommended article: Acceleration of the subspace iteration method by selective repeated inverse iteration
Recommended article: Optimizations of the subresultant algorithm
description: scientific article; zbMATH DE number 7032435