Selection of Sampling Keys for Cryptographic Tests release_re73uytayra7rc5yicitwbqsiy

by George Marinakis

Published in Journal of Applied Mathematics & Bioinformatics by Scientific Press International Limited.

2021   p1-14


Abstract The keys of modern cryptographic algorithms have an enormous size, so the testing of the algorithm performance for all key combinations, will take practically an infinite time. To avoid this, the sampling method is used, where a much smaller number of keys is tested and then the estimation of the algorithm performance for all the keys is calculated with a predetermined sampling error. For each sampling key, an output sample of the algorithm must be generated and tested. Therefore, in order to have sampling results as close as possible to the real performance of the algorithm, the key question is whether the selection of the keys should be random or it must follow some rules. If the selection of the keys is completely random, there is a high probability that the tests will not find some "weak" or "equivalent" keys, which give non-random or similar outputs and therefore reduce the total number of active keys. But if the sampling keys are selected with some specific criteria, there is a much greater probability of detecting any weak or equivalent key. In this study an optimal key selection methodology is proposed, which combines the random and the non-random key selection. Keywords: Cryptography, Data encryption, Communication security, Computer security, Data security, Information security.
In application/xml+jats format

Archived Files and Locations

application/pdf  228.5 kB
file_2rofnq6xfvf7jlhqfmismxsno4 (publisher) (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article-journal
Stage   published
Date   2021-07-23
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: f9f3fc31-9de9-4ea9-99ba-925d4e320c9f