Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures
type: Item
instance of: scholarly article
title: Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures
zbMATH Open document ID: 1457.94096
author: Michela Ceria
author: Andrea Visconti
author: Moss Sweedler
author: Ferdinando Mora
published in: Applicable Algebra in Engineering, Communication and Computing
publication date: 2020-07-15T00:00:00Z
full work available at URL: http://hdl.handle.net/2434/742753
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 13P10
zbMATH DE Number: 7221084
zbMATH Keywords: Barkee's cryptosystem
zbMATH Keywords: Polly Cracker
zbMATH Keywords: Buchberger theory
zbMATH Keywords: Stickel's protocol
describes a project that uses: BERGMAN
MaRDI profile type: Publication
OpenAlex ID: W3016731865
cites work: Gröbner basis cryptosystems
cites work: Polly Cracker, Revisited
cites work: Polly cracker, revisited
cites work: Why you cannot even hope to use Gröbner bases in public key cryptography: An open letter to a scientist who failed and a challenge to those who have not yet failed
cites work: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
cites work: Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
cites work: Q3208084
cites work: Q4627681
cites work: Q5301638
cites work: Lattice polly cracker cryptosystems
cites work: Buchberger-Zacharias theory of multivariate Ore extensions
cites work: The membership problem for unmixed polynomial ideals is solvable in single exponential time
cites work: A new efficient algorithm for computing Gröbner bases \((F_4)\)
cites work: Q4660688
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Q4318710
cites work: Q4313178
cites work: Q4314356
cites work: On an installation of Buchberger's algorithm
cites work: Minimal involutive bases
cites work: Involutive bases of polynomial ideals
cites work: Q4237370
cites work: Q4225059
cites work: Non-commutative Gröbner bases in algebras of solvable type
cites work: A Survey on Polly Cracker Systems
cites work: Q3154862
cites work: Q4234206
cites work: Public key cryptography based on semigroup actions
cites work: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
cites work: On the construction of Gröbner bases using syzygies
cites work: De nugis Groebnerialium. II: Applying Macaulay's trick in order to easily write a Gröbner basis
cites work: Effective Buchberger-Zacharias-Weispfenning theory of skew polynomial extensions of subbilateral coherent rings
cites work: Q4413922
cites work: Theory of non-commutative polynomials
cites work: Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
cites work: The ideal membership problem in non-commutative polynomial rings
cites work: Cryptanalysis of Stickel’s Key Exchange Scheme
cites work: Thompson’s Group and Public Key Cryptography
cites work: Q3620531
cites work: Q4707231
cites work: Cryptanalysis of Polly Cracker
cites work: Q3688303
cites work: Gröbner bases and generalized sylvester matrices
DOI: 10.1007/S00200-020-00428-W
description: scientific article; zbMATH DE number 7221084