Non-asymptotic lower bounds for the data complexity of statistical attacks on symmetric cryptosystems
Saved in:
| Date: | 2018 |
|---|---|
| Main Author: | A. N. Aleksejchuk |
| Format: | Article |
| Language: | English |
| Published: |
2018
|
| Series: | Cybernetics and Systems Analysis |
| Online Access: | http://jnas.nbuv.gov.ua/article/UJRN-0000805860 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Library portal of National Academy of Sciences of Ukraine | LibNAS |
Institution
Library portal of National Academy of Sciences of Ukraine | LibNASSimilar Items
-
Security estimates of a Ring-LWE symmetric cryptosystem against chosen plaintext attack
by: S. M. Ignatenko
Published: (2020) -
Achievable upper bound for the sup-norm of the elements' product in the ring of truncated polynomials and its application to the analysis of ntru-like cryptosystems
by: A. N. Aleksejchuk, et al.
Published: (2021) -
Amount of key information contained in open and encrypted text sets of the symmetric randomized mceliece cryptosystem
by: S. V. Mitin
Published: (2020) -
Lower bounds for the volume of the image of a ball
by: B. A. Klishchuk, et al.
Published: (2019) -
The Analysis of Difficulty of Realizations of Cryptosystems on Groups
by: H. Z. Khalimov
Published: (2017)