The research of block ciphers non-injective key schedules properties
Journal Title: КОМП’ЮТЕРНІ НАУКИ ТА КІБЕРБЕЗПЕКА - Year 2017, Vol 2, Issue 6
Abstract
The considers non-injective key schedules used in many known block ciphers ("Kalyna", FOX, Twofish, etc.). It is estimated the probability of matching of round keys (formed by non-injective key schedule) set and encryption keys set cardinalities; a theorem which determines such a probability is formulated and proved. It is shown that for a full cipher with a non-injective key schedule, the probability of matching of round keys set and encryption keys set cardinalities is practically equal to 1. Thus, it is proved that the exhaustive search attacks complexity on non-injective key schedules is almost equal to injective ones (the exhaustive search attacks complexity does not decrease). At the same time, non-injective key schedules provide additional strength to attacks on the implementation and other attacks.
Authors and Affiliations
Maria Rodinko, Roman Oliynykov
Keywords
Related Articles
- EP ID EP263857
- DOI -
- Views 93
- Downloads 0
IMPROVED MATHEMATICAL MODEL OF THE POST-QUANTUM ELETRONIC SIGNATURE MECHANISM
In the paper new electronic signature mechanisms which will be urgent in the post-quantum period devel-opment necessity is grounded. The main one time key mechanisms are briefly described. Problems related with Lamport O...
THE METHOD OF PSEUDORANDOM CODES DECODING ON THE BASIS OF THE MODIFIED METHOD OF BRANCHES AND BOUNDARIES
Reasons of crisis of error-correcting coding are considered. Underlined the urgency of application of pseudo random codes in modern systems transmission of information. Presented constructive mathematical method of decod...
5G NETWORK ARCHITECTURE
The work deals with the main stages in the history of the development of different generations of cellular communication and options for the organization of their architecture. A brief overview of the main features and p...
NTRU Prime IIT Ukraine encryption algorithm with consideration known attacks analysis
The paper deals with the modern cryptographic transformations of the asymmetric end-to-end encryption type, namely – NTRU-like cryptographic systems. A new cryptographic system NTRU Prime IIT Ukraine was created based on...
Hiding data in the file structure
In this paper, the methods of steganography hiding of information in a file system structure is investigated. Namely, the structure of the FAT file system (File Allocation Table) and methods of hiding information message...