Registration Number
0219U101998,
0119U102099
, R & D reports
Title
Research, development and application of the newest methods of cryptographic analysis of information security systems in various computing models with respect to the conditions of their functioning", cipher "Dorado"
popup.stage_title
Head
Savchuk Mykhailo M.,
Registration Date
12-12-2019
Organization
National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute"
popup.description2
Goals of this work are synthesis of new mathematical models, methods and algorithms of analysis for modern cryptographic security systems, as well as adaptation of existing ones under different computation models and consideration of functioning conditions.
Main results of this work includes the following.
Analytic security bounds against generalized linear cryptanalysis were constructed for SP-networks of special kinds and modified Feistel schemes. Security against differential and linear cryptanalysis for selected classes of keyless mappings was estimated. New techniques were proposed for anomaly detections and hidden algebraic structure recovering in keyless mappings. Estimations of error decryption probability were given for NTRU-type cryptosystems. An attack was proposed for cryptosystems based on linear error correction codes; besides, we described solution method for linear code recovering problem based on a set of corrupted codewords. Cryptographic security protocols for identification data and individual’s behavior information were analysed. Special classes of permutations were analyzed, their cardinality was estimated analytically and experimentally, and also statistical criterion was proposed for testing a quality of random permutation generators. Properties of arithmetic modulo Mersenne number were studied, and new algebraic problems were formulated for modifications of post-quantum AJPS cryptosystem. We considered an algebraic model which allows to generalize a set of modern algebraic problems based on lattices, and also we studied a procedure of Dicke’s quantum states creation, which are used in attacks on cryptosystems based on mentioned problems. We proposed a factorization technique which is analogous for Lenstra’s algorithm, but uses Edward’s elliptic curves; for this method we gave proof of correctness, upper bounds for efficiency, and lower bounds for success probability. We proposed and gave a comparative analysis of three variants for Edwa
Product Description
popup.authors
Hrubiian Yevhen O.
Kovalchuk Liudmyla V.
Kudin Anton M.
Matiiko Оleksandra A.
Oksonenko Maksym P.
Олексійчук Антон Миколайович
Savchuk Mikhael M.
Fal Oleksii M.
Fesenko Andriy M.
Tsygankova Oksana V.
Yadukha Dariya V.
Yakovliev Serhiy V.
popup.nrat_date
2020-04-02
