A combinatorial problem related to sparse systems of equations

Nowadays sparse systems of equations occur frequently in science and engineering. In this contribution we deal with sparse systems common in cryptanalysis. Given a cipher system, one converts it into a system of sparse equations, and then the system is solved to retrieve either a key or a plaintext....

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Designs, codes, and cryptography Ročník 85; číslo 1; s. 129 - 144
Hlavní autori:	Horak, Peter, Semaev, Igor, Tuza, Zsolt
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.10.2017 Springer Nature B.V
Predmet:	Algebra Boxes Circuits Coding and Information Theory Combinatorial analysis Complexity Computer Science Cryptography Cryptology Data Structures and Information Theory Discrete Mathematics in Computer Science Encryption Information and Communication Linear algebra Mathematical analysis 05C65 68Q25 Sparse systems of equations 94A60 MaxMinMax problem Gluing algorithm
ISSN:	0925-1022, 1573-7586
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!