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...

Celý popis

Podrobná bibliografia

Vydané v:	Applicable algebra in engineering, communication and computing Ročník 31; číslo 3-4; s. 235 - 252
Hlavní autori:	Barkee, Boo, Ceria, Michela, Moriarty, Theo, Visconti, Andrea
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2020 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!