Lower bounds for the number of keys in a Zakrevskij cipher
From MaRDI portal
Publication:376120
DOI10.1007/S10958-013-1393-7zbMath1276.68079OpenAlexW2074500211WikidataQ122225897 ScholiaQ122225897MaRDI QIDQ376120
D. D. Dublennykh, D. S. Ananichev
Publication date: 4 November 2013
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10995/27207
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
This page was built for publication: Lower bounds for the number of keys in a Zakrevskij cipher