Skip to main content
SpringerLink
Log in

Works of the Kiev school of theoretical cryptography

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

This paper presents works of the Kiev school of theoretical cryptography that are carried out mainly during the last two decades in the fields of cryptographic methods of information security, cryptanalysis, and related mathematical disciplines.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. I. N. Kovalenko, “On an algorithm of subexponential complexity for decoding heavily corrupted linear codes,” Dop. AN URSR, Ser. A, No. 10, 16–17 (1988).

  2. I. N. Kovalenko and M. N. Savchuk, “Some methods of decoding corrupted linear codes,” Data Registration, Storage, and Processing, 1, No. 2, 62–68 (1999).

    Google Scholar 

  3. I. N. Kovalenko and M. N. Savchuk, “On a statistical algorithm to decode heavily corrupted linear codes,” in: Applied Probability and Stochastic Processes, Kluwer, Berkeley (1999), pp. 73–82.

    Google Scholar 

  4. K. Efremov and M. Savchuk, “Estimates of complexity and reliability of algorithms of decoding heavily corrupted linear codes,” in: Proc. IXth Intern. Sci.-Pract. Conf. “Information Security in Informational-Telecommunication Systems,” Kiev (2006), p. 24.

  5. A. N. Alekseychuk, “Systems of linear equations with corrupted right sides over a residue ring modulo 2N,” Zakhist Informatsii, No. 4, 12–19 (2001).

  6. A. N. Alekseychuk and S. M. Ignatenko, “Estimates of efficiency of universal methods for reconstruction of corrupted linear recurrents over a residue ring modulo 2N,” Zbirn. Nauk. Prats’ of IPME of NANU, No. 20, 40–48 (2003).

  7. A. N. Alekseychuk and S. M. Ignatenko, “Method of optimization of algorithms for solution of systems of linear equations with corrupted right sides over a residue ring modulo 2N,” Data Registration, Storage, and Processing, 7, No. 1, 21–29 (2005).

    Google Scholar 

  8. I. N. Kovalenko, A. A. Levitskaya, and N. M. Savchuk, Selected Topics in Probabilistic Combinatorics [in Russian], Naukova Dumka, Kiev (1986).

    Google Scholar 

  9. A. N. Alekseychuk, “Uniqueness conditions of the moments problem in the class of q-distributions,” Diskret. Mat., 11, No. 4, 48–57 (1999).

    Google Scholar 

  10. A. N. Alekseychuk, “Nonasymptotic bounds of the probability distribution of the rank of a random matrix over a finite field,” Diskret. Mat., 19, No. 2, 85–93 (2007).

    Google Scholar 

  11. G. V. Balakin, “Systems of random equations over a finite field,” Trudy po Diskretnoi Matematike, 2, 21–37 (1998).

    MathSciNet  Google Scholar 

  12. A. A. Levitskaya, “Systems of random equations over finite algebraic structures,” Cybernetics and Systems Analysis, No. 1, 67–93 (2005).

  13. A. N. Alekseychuk, “A probabilistic scheme of independent random elements distributed over a finite lattice. I. Exact probability distributions of functionals of union of random elements,” Cybernetics and Systems Analysis, No. 5, 629–638 (2004).

  14. A. N. Alekseychuk, “A probabilistic scheme of independent random elements distributed over a finite lattice. II. The method of lattice moments,” Cybernetics and Systems Analysis, No. 6, 824–841 (2004).

  15. A. N. Alekseychuk “Random covers of finite homogeneous lattices,” Theory of Stoch. Processes, 12(28), Nos. 1–2, 12–19 (2006).

    MathSciNet  Google Scholar 

  16. A. N. Alekseychuk, “On uniqueness of the problem of moments in the class of q-distributions,” Diskr. Mat., 10, No. 1, 95–110 (1998).

    Google Scholar 

  17. I. N. Kovalenko, “Upper bounds on the number of complete maps,” Cybernetics and Systems Analysis, No. 1, 65–68 (1996).

  18. I. M. Kovalenko and C. Cooper, “The upper bound for the number of complete mappings,” Teor. Imovirn. Mat. Stat., 53, 69–75 (1995).

    MATH  Google Scholar 

  19. C. Cooper, R. Gilchrist, I. N. Kovalenko, and D. Novacovic, “Estimation of the number of good permutations with applications to cryptography,” Cybernetics and Systems Analysis, No. 5, 688–693 (1999).

  20. N. Yu. Kuznetsov, “Applying fast simulation to find the number of good permutations,” Cybernetics and Systems Analysis, No. 6, 830–837 (2007).

  21. R. Gilchrist and I. N. Kovalenko, “On estimation of the probability of absence of collisions of some random mappings,” Cybernetics and Systems Analysis, No. 1, 102–107 (2000).

  22. L. V. Kovalchuk, “Pseudoirreducible polynomials: Probabilistic irreducibility testing,” Cybernetics and Systems Analysis, No. 4, 610–616 (2004).

  23. M. N. Savchuk, “Some limit theorems in the scheme of equiprobable placement of particles by sets,” Teor. Veroyatn. Mat. Stat., No. 28, 122–130 (1983).

  24. M. Savchuk, “Some limiting theorems in ball batch allocation scheme with random levels defined by another allocation scheme,” in: Probabilistic Methods in Discrete Mathematics, Teor. Veroyatn. Prim., Moscow (1993), pp. 428–436.

    Google Scholar 

  25. M. N. Savchuk, “Limit behavior of a random waiting time before filling a given subset of cells in the scheme of equiprobable placement of particles by sets,” in: Models and Methods of Operations Research and Risk and Reliability Theories, Cybernetics Institute of NANU, Kiev (1992), pp. 3–10.

    Google Scholar 

  26. M. N. Savchuk, “Asymptotic analysis of a variational probability series for series with different outcomes in a multinomial scheme,” Dop. NAN Ukr., No. 3, 101–105 (1999).

  27. M. N. Savchuk, “On limit distributions of maximal and minimal frequencies in a scheme of placement of a random number of particles among cells,” in: Mathematical Methods of Simulation and System Analysis under Conditions of Incomplete Information, Cybernetics Institute of AN UkrSSR, Kiev (1991), pp. 9–12.

    Google Scholar 

  28. M. N. Savchuk, “Convergence of multidimensional random processes connected with separable statistics in placement schemes to Gaussian diffusion processes,” in: Analysis of Stochastic Systems by Operations Research Methods and Reliability Theorems, Cybernetics Institute of AN UkrSSR, Kiev (1987), pp. 43–47.

    Google Scholar 

  29. M. N. Savchuk and V. F. Sinyavskii, “On an algorithm for determination of moments of changing parameters of a Bernoullian sequence,” Probl. Upravlen. Inf., No. 1, 84–89 (1999).

  30. M. N. Savchuk, “Analysis of a method for improving characteristics of a random binary sequence,” Kibern. Vychisl. Tekhn., No. 118, 57–61 (1998).

  31. V. Sharapov, “Algorithm for testing random and pseudorandom sequences using contextual simulation,” in: Proc. Xth Anniv. Intern. Sci. Pract. Conf. “Information Security in Informational-Telecommunication Systems,” ChP “EKMO” and NITs “Tezis” of NTUU “KPI,” Kiev (2007), pp. 30–31.

  32. L. Koval’chuk and V. Bezditnyi, “Checking the independence of statistical tests destined for estimation of cryptographic properties of GPV,” Zakhyst Informatsii, No. 2 (29), 18–23 (2006).

  33. L. Koval’chuk, S. Melnik, and V. Bezdetnyi, “Probabilistic characteristics of generation of nonuniformly distributed keys,” Radiotekhnika (Kharkiv), 141, 181–188 (2005).

    Google Scholar 

  34. M. N. Savchuk, “Using the Monte Carlo method for identification of Boolean functions of a large number of variables,” Kibern. Vychisl. Tekhn., No. 117, 3–7 (1998).

  35. S. A. Pometun, “Investigation of algebraic attacks on stream and block encoders,” in: Proc. Xth Anniv. Intern. Sci. Pract. Conf. “Information Security in Informational-Telecommunication Systems,” ChP “EKMO” and NITs “Tezis” of NTUU “KPI,” Kiev (2007), pp. 28–29.

  36. S. A. Pometun, “Generalized higher-order correlation and nonlinearity of Boolean functions for the description of probability of algebraic attacks,” in: Proc. 3th Intern. Sci. Conf. on Problems of Security and Counteraction to Terrorism, in: MaBIT, Moscow (2007), pp. 153–163.

    Google Scholar 

  37. S. A. Pometun, “Probabilistic algebraic cryptanalysis of the encoder ‘SFINKS’ with a definite class of filtering functions,” Legal, Normative, and Metrological Support of the Information Protection System in Ukraine, No. 1 (16), 73–78 (2008).

  38. S. A. Pometun, “Algebraic attacks on stream encoders as a generalization of correlation attacks,” Systemn. Doslidzh. to Inform. Tekhnologi”, No. 2, 29–40 (2008).

  39. S. A. Pometun, “On the number of Boolean functions with a given algebraic immunity,” Prikl. Radioelektronica, No. 3, 322–325 (2008).

  40. S. A. Pometun, “Investigation of probabilistic scenarios of algebraic attacks on stream ciphers," Probl. Upravlen. Inf., No. 1, 143–156 (2009).

  41. A. N. Alekseychuk and R. V. Proskurovskii, “Lower bound of the probability of distinguishing between inner states of a combining gamma generator with nonuniform movement,” in: Legal, Normative, and Metrological Support of the Information Protection System in Ukraine, No. 2 (13), Kyiv (2006), pp. 159–169.

  42. A. N. Alekseychuk, R. V. Proskurovskii, and L. V. Skrypnik, “A statistical attack on a combining gamma generator with nonuniform movement in the mode of reinitialization of the initial state,” in: Proc. MGU Conf. “Mathematics and Security of Information Technologies,” MTsNMO, Moscow (2007), pp. 264–269.

    Google Scholar 

  43. A. M. Oleksiychuk and R. V. Proskurovskyi, “Estimation of the average error probability of the Bayesian criterion for testing hypotheses in the problem of cryptanalysis of a combining gamma generator with nonuniform movement,” Teor. Imovirn. Mat. Stat., No. 78, 152–159 (2008).

  44. A. N. Alekseychuk, “Optimal balanced mappings in constructions of gamma generators with nonuniform movement of shift registers and protocols of transmission of keys along a tapped communication channel,” Registration, Storage, and Processing of Data, 10, No. 4, 47–56 (2008).

    Google Scholar 

  45. V. A. Ivanov, “On a method of random coding,” Diskret. Mat., 11, No. 3, 99–108 (1999).

    Google Scholar 

  46. A. N. Alekseychuk, “Random coding in a communication channel with additive noise distributed over a finite Abelian group,” Zakhyst Informatsii, No. 3, 7–16 (2002).

  47. A. N. Alekseychuk, “Optimal random coding of equiprobable messages in a q-ary symmetric channel,” Zakhyst Informatsii, No. 4, 49–58 (2002).

  48. L. Zavadskaya, A. Mellit, and A. Fal’, “On methods of cryptanalysis of stream ciphers,” in: Proc. 6th Intern. Sci.-Pract. Conf. “Information Security in Informational-Telecommunication Systems,” Kyiv (2003), p. 55.

  49. A. N. Alekseychuk and L. V. Kovalchuk, “Upper bounds of maximum values of average differential and linear characteristic probabilities of Feistel cipher with adder modulo 2m,” Theory of Stochastic Processes, 12 (28), Nos. 1–2, 20–32 (2006).

    MathSciNet  Google Scholar 

  50. L. V. Koval’chuk, “Upper estimates for average probabilities of differential approximations of Boolean mappings,” in: Proc. Intern. Sci. Conf. on Security and Counteraction to Terrorism (Intellectual Center of MGU, November 2–3, 2005), MTsNMO, Moscow (2006), pp. 163–167.

    Google Scholar 

  51. L. V. Skrypnik and L. V. Koval’chuk, “Upper bounds for average probabilities of differentials of Boolean mappings,” Zakhyst Informatsii, No. 3, 7–12 (2006).

  52. A. N. Alekseychuk, “Upper bounds for parameters describing the resistance of non-Markov block ciphers to differential and linear cryptanalysis methods,” Zakhyst Informatsii, No. 3, 20–28 (2006).

  53. L. V. Koval’chuk, “Generalized Markov ciphers: Construction of an estimate of practical resistance to differential cryptanalysis,” in: Proc. MGU Conf. “Mathematics and Security of Information Technologies,” MTsNMO, Moscow (2007), pp. 595–599.

    Google Scholar 

  54. A. M. Alekseychuk, L. V. Koval’chuk, and S. V. Pal’chenko, “Cryptographic parameters of replacement units describing the resistance of GOST-like block ciphers to linear and differential cryptanalysis methods,” Zakhyst Informatsii, No. 2, 12–23 (2007).

  55. A. N. Alekseychuk, L. V. Koval’chuk, E. V. Skrynnik, and A. S. Shevtsov, “Estimates of practical resistance of the block cipher Kalina against differential linear cryptanalysis methods and algebraic attacks based on homomorphisms,” Prikladn. Radioelektronika, 7, No. 3, 203–209 (2008).

    Google Scholar 

  56. A. N. Alekseychuk and A. S. Shevtsov, “Indices and estimates of resistance of block ciphers against first-order statistical attacks,” Registration, Storage, and processing of data, 8, No. 4, 53–63 (2006).

    Google Scholar 

  57. S. Vaudenay, “Decorrelation: A theory for block cipher security,” J. Cryptology, 16, No. 4, 249–286 (2003).

    Article  MATH  MathSciNet  Google Scholar 

  58. L. Koval’chuk and S. Pal’chenko, “Upper estimates for probabilities of generalized differentials of round transformations of GOST-like ciphers,” in: Proc. XIIth Intern. Sci.-Pract. Conf. “Information Security in Informational-Telecommunication Systems,” ChP “EKMO” and NITs “Tezis” of NTUU “KPI,” Kiev (2009), pp. 22–23.

    Google Scholar 

  59. S. V. Yakovlev, “Investigation of quality criteria and development of an algorithm for generation of long-term key elements of the encoder GOST 28147–89,” in: Proc. IVth All-Ukrainian Sci.-Pract. Conf. of Students, Graduate Students, and Young Scientists “Information Security Technologies,” Kyiv (2006), p. 34.

  60. S. V. Yakovlev, “Balanced quality criteria of long-term key elements of the GOST 28147–89 data encipherment algorithm,” Inform. Tekhologii and Comp. Inzheneriya, No 1, 51–58 (2009).

    Google Scholar 

  61. S. V. Yakovlev, “The Feistel cascade scheme and its resistance to differential and linear analysis,” in: Legal, Normative, and Metrological Support of the Information Protection System in Ukraine, No. 1 (18), Kyiv (2009), pp. 103–108.

  62. A. V. Fesenko, “Analysis of a public-key cryptosystem whose key is based on a piecewise linear image,” in: Proc. Xth Ann. Intern. Sci.-Pract. Conf. “Information Security in Informational-Telecommunication Systems,” ChP “EKMO” and NITs “Tezis” of NTUU “KPI,” Kiev (2007), pp. 32–33.

    Google Scholar 

  63. A. V. Fesenko, “Construction of a keyless attack on a cryptosystem based on a piecewise-linear mapping,” Probl. Upravlen. Inf., No. 5, 149–156 (2008).

  64. A. V. Fesenko, “Construction of a keyless attack on a cryptosystem based on a piecewise linear mapping,” Probl. Upravlen. Inf., No. 1, 130–142 (2009).

  65. M. M. Savchuk and A. V. Fesenko, “Investigations of the possibility of using symmetric ciphers for construction of postquantum cryptographic protocols,” in: Proc. 6th Intern. Conf. “INTERNET–EDUCATION–SCIENCE–2008,” Vol. 2, UNIVERSUM–Vinnytsya, Vinnytsya (2008), pp. 411–412.

  66. M. M. Savchuk and A. V. Fesenko, “Symmetric commutative and locally-commutative ciphers for construction of classical and postquantum protocols,” Inform. Tekhnologii ta Komp’yutern. Inzheneriya, No. 2 (12), 43–51 (2008).

  67. M. N. Savchuk and V. G. Sharapov, “Analysis of a method for testing random sequences that is based on context simulation,” Legal, Normative, and Metrological Support of the Information Protection System in Ukraine, No. 1(16), 82–89 (2008).

  68. M. N. Savchuk and V. G. Sharapov, “A multidimensional statistical test for binary sequences,” Legal, Normative, and Metrological Support of the Information Protection System in Ukraine, No. 1 (18), 65–72 (2009).

  69. A. Anisimov, T. Avanesov, V. Tkachenko, and O. Fal’ (translation and sci.-techn. editing), DSTU ISO/IEC 18014–1:2006. Information Technologies. Protection Methods. Timestamping Service. Part 1. Fundamentals (DSTU ISO/IEC 18014–2:2002.IDT), Derzhspozhivstandart Ukrainy, Kyiv (2008).

  70. A. Anisimov, T. Avanesov, V. Tkachenko, and O. Fal’, DSTU ISO/IEC 18014–2:2006. Information Technologies. Protection Methods. Timestamping Service. Part 2. Mechanisms Producing Connected Tokens (DSTU ISO/IEC 18014–2:2002.IDT), Derzhspozhivstandart Ukrainy, Kyiv (2008).

  71. A. Anisimov, T. Avanesov, V. Tkachenko, and O. Fal’, DSTU ISO/IEC 18014–3:2006. Information Technologies. Protection Methods. Timestamping Service. Part 3. Mechanisms Producing Connected Tokens (DSTU ISO/IEC 18014–3:2002.IDT), Derzhspozhivstandart Ukrainy, Kyiv (2008).

  72. A. A. Kostin, N. A. Moldovyan, and A. M. Fal’, “On a realization of blind signature and collective signature protocols on the basis of digital signature standards,” in: Proc. VIth Intern. Conf. “Information Security of Russia (IBRR–2009),” SPOISU, St.-Petersburg (2009), p. 111.

    Google Scholar 

  73. National Standard of Ukraine. Information Technologies. Cryptographic Information Protection. Digital Signature Based on Elliptic Curves. Formation and Checking. DSTU 4145–2002. State Committee of Ukraine for Technical Regulation and Consumer Policy, Kyiv (2003).

  74. A. A. Levitskaya, “Invariance theorems for a class of systems of random nonlinear equations over an arbitrary finite ring with left unity,” Cybernetics and Systems Analysis, No. 6, 884–891 (2008).

  75. A. N. Alekseychuk and A. S. Shevtsov, “Upper estimates of imbalance of bilinear approximations for round functions of block ciphers,” Cybernetics and Systems Analysis, No. 3, 378–387 (2010).

  76. P. A. Endovitskii, “Refining the asymptotic approximation of the group size in the birthday paradox,” Cybernetics and Systems Analysis, No. 3, 518–522 (2010).

  77. A. A. Levitskaya, “Solving the problem of invariance of probabilistic characteristics for a priory solvable systems of random nonlinear equations over a finite commutative ring with unity,” Cybernetics and Systems Analysis, No. 3, 365–377 (2010).

Download references

Author information

Authors and Affiliations

  1. Physicotechnical Institute of the National Technical University of Ukraine “Kiev Polytechnic Institute”, Kiev, Ukraine

    M. N. Savchuk

Authors
  1. M. N. Savchuk
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. N. Savchuk.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 52–68, May–June 2010

Rights and permissions

Reprints and permissions

About this article

Cite this article

Savchuk, M.N. Works of the Kiev school of theoretical cryptography. Cybern Syst Anal 46, 386–404 (2010). https://doi.org/10.1007/s10559-010-9214-1

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-010-9214-1

Keywords

Search

Navigation