Why You Cannot Even Hope to Use Göbner Bases in Public-Key Cryptography? An Open Letter to a Scientist Who Failed and a Challenge to Those Who Have Not Yet Failed (1994)
by
Boo Barkee
,
Deh Cac Can
,
Julia Ecks
,
Theo Moriarty
,
R. F. Ree
BibTeX
@MISC{Barkee94whyyou,
author = {Boo Barkee and Deh Cac Can and Julia Ecks and Theo Moriarty and R. F. Ree},
title = {Why You Cannot Even Hope to Use Göbner Bases in Public-Key Cryptography? An Open Letter to a Scientist Who Failed and a Challenge to Those Who Have Not Yet Failed},
year = {1994}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Citations
| 323 | Gr"obner Bases: An algorithmic method in polynomial ideal theory - Buchberger - 1985 |
| 18 | The membership problem for unmixed polynomial ideals is solvable in single exponential time Discrete - Dickenstein, Fitchas, et al. |
| 4 | Some eectivity problems in polynomial ideal theory - Giusti - 1984 |
| 2 | in cooperation with H. Kredel Grobner bases - Becker, Weispfenning - 1993 |
