Standard

Unconditionally secure short key ciphers based on data compression and randomization. / Ryabko, Boris.

в: Designs, Codes, and Cryptography, Том 91, № 6, 06.2023, стр. 2201-2212.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

Harvard

Ryabko, B 2023, 'Unconditionally secure short key ciphers based on data compression and randomization', Designs, Codes, and Cryptography, Том. 91, № 6, стр. 2201-2212. https://doi.org/10.1007/s10623-023-01195-8

APA

Ryabko, B. (2023). Unconditionally secure short key ciphers based on data compression and randomization. Designs, Codes, and Cryptography, 91(6), 2201-2212. https://doi.org/10.1007/s10623-023-01195-8

Vancouver

Ryabko B. Unconditionally secure short key ciphers based on data compression and randomization. Designs, Codes, and Cryptography. 2023 июнь;91(6):2201-2212. doi: 10.1007/s10623-023-01195-8

Author

Ryabko, Boris. / Unconditionally secure short key ciphers based on data compression and randomization. в: Designs, Codes, and Cryptography. 2023 ; Том 91, № 6. стр. 2201-2212.

BibTeX

@article{036ffdbf0a1f444cb3bfc90faa1ebf29,
title = "Unconditionally secure short key ciphers based on data compression and randomization",
abstract = "We consider the problem of constructing an unconditionally secure cipher for the case when the key length is less than the length of the encrypted message. (Unconditional security means that a computationally unbounded adversary cannot obtain information about the encrypted message without the key). In this article, we propose a cipher based on data compression and randomisation in combination with entropically-secure encryption and apply it to the following two cases: (i) the statistics of encrypted messages are known; and (ii) statistics are unknown, but messages are generated by a Markov chain with known memory (or connectivity). In both cases, the length of the secret key is negligible compared to the length of the message.",
keywords = "Cryptography, Data compression, Entropic security, Entropically-secure symmetric encryption scheme, Fitingof code, Indistinguishability, Information theory, Perfect security, Randomisation, Shannon code",
author = "Boris Ryabko",
year = "2023",
month = jun,
doi = "10.1007/s10623-023-01195-8",
language = "English",
volume = "91",
pages = "2201--2212",
journal = "Designs, Codes, and Cryptography",
issn = "0925-1022",
publisher = "Springer Netherlands",
number = "6",

}

RIS

TY - JOUR

T1 - Unconditionally secure short key ciphers based on data compression and randomization

AU - Ryabko, Boris

PY - 2023/6

Y1 - 2023/6

N2 - We consider the problem of constructing an unconditionally secure cipher for the case when the key length is less than the length of the encrypted message. (Unconditional security means that a computationally unbounded adversary cannot obtain information about the encrypted message without the key). In this article, we propose a cipher based on data compression and randomisation in combination with entropically-secure encryption and apply it to the following two cases: (i) the statistics of encrypted messages are known; and (ii) statistics are unknown, but messages are generated by a Markov chain with known memory (or connectivity). In both cases, the length of the secret key is negligible compared to the length of the message.

AB - We consider the problem of constructing an unconditionally secure cipher for the case when the key length is less than the length of the encrypted message. (Unconditional security means that a computationally unbounded adversary cannot obtain information about the encrypted message without the key). In this article, we propose a cipher based on data compression and randomisation in combination with entropically-secure encryption and apply it to the following two cases: (i) the statistics of encrypted messages are known; and (ii) statistics are unknown, but messages are generated by a Markov chain with known memory (or connectivity). In both cases, the length of the secret key is negligible compared to the length of the message.

KW - Cryptography

KW - Data compression

KW - Entropic security

KW - Entropically-secure symmetric encryption scheme

KW - Fitingof code

KW - Indistinguishability

KW - Information theory

KW - Perfect security

KW - Randomisation

KW - Shannon code

UR - https://www.scopus.com/record/display.uri?eid=2-s2.0-85148901858&origin=inward&txGid=1af78382cb59ea58e7ba5d7972e5db96

UR - https://www.mendeley.com/catalogue/599d7d13-515b-3dd7-b6b0-c302fcdaf343/

U2 - 10.1007/s10623-023-01195-8

DO - 10.1007/s10623-023-01195-8

M3 - Article

VL - 91

SP - 2201

EP - 2212

JO - Designs, Codes, and Cryptography

JF - Designs, Codes, and Cryptography

SN - 0925-1022

IS - 6

ER -

ID: 54930078