An application of Combinatorics in Cryptography

Autor:	Peter Horak, Zsolt Tuza, Igor Semaev
Rok vydání:	2015
Předmět:	Theoretical computer science Matrix-free methods Computational complexity theory business.industry Applied Mathematics Cryptography Plaintext Sparse approximation law.invention Combinatorics Cipher law Discrete Mathematics and Combinatorics Cryptanalysis business Sparse language Mathematics
Zdroj:	Electronic Notes in Discrete Mathematics. 49:31-35
ISSN:	1571-0653
DOI:	10.1016/j.endm.2015.06.006
Popis:	Nowadays sparse systems of equations occur frequently in science and engineering. In this contribution we deal with sparse system that are 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. Raddum and Semaev proposed a new method for solving such sparse systems. It turns out that a combinatorial MaxMinMax problem provides bounds on the case where the average computational complexity of their method is maximum. We focus on this MaxMinMax problem and present results over finite and infinite fields.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::1c6c7fcb40b101a3959593dc6683f284 https://doi.org/10.1016/j.endm.2015.06.006 Zobrazit plný text záznamu Full Text from ScienceDirect