On the security of biquadratic C∗ public-key cryptosystems and its generalizations

Public key cryptosystems based on multivariate polynomials have been studied since the eighties. One of them, called C ∗ , was introduced in 1988 by Imai and Matsumoto, and broken in 1993 by Dobbertin in classified work he did for the German Federal Office for Information Security and later by Patar...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Cryptography and communications Ročník 11; číslo 3; s. 427 - 442
Hlavní autor:	Felke, Patrick
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 15.05.2019 Springer Nature B.V
Témata:	Algorithms Circuits Coding and Information Theory Communications Engineering Complexity Computer Science Computer systems Cybersecurity Data encryption Data Structures and Information Theory Information and Communication Lower bounds Mapping Mathematics of Computing Networks Polynomials Quantum cryptography Special Issue: Mathematical Methods for Cryptography C Secondary 11Y16 13P10 Degree of regularity First fall degree 13D02 Post-quantum cryptography Gröbner basis attacks Dobbertin Multivariate cryptography Imai-Matsumoto 12Y05 biquadratic C 13P15 Solving equations Primary 11T71 94A60 11T55
ISSN:	1936-2447, 1936-2455
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!