Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures

In 1994, Moss Sweedler’s dog proposed a cryptosystem, known as Barkee’s Cryptosystem, and the related cryptanalysis. Its explicit aim was to dispel the proposal of using the urban legend that “Gröbner bases are hard to compute”, in order to devise a public key cryptography scheme. Therefore he claim...

Full description

Bibliographic Details

Published in:	Applicable algebra in engineering, communication and computing Vol. 31; no. 3-4; pp. 235 - 252
Main Authors:	Barkee, Boo, Ceria, Michela, Moriarty, Theo, Visconti, Andrea
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2020 Springer Nature B.V
Subjects:	Algorithms Artificial Intelligence Computer Hardware Computer Science Cryptography Original Paper Polynomials Symbolic and Algebraic Manipulation Theory of Computation Buchberger Theory Stickel’s protocol Barkee’s cryptosystem Polly Cracker
ISSN:	0938-1279, 1432-0622
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!