Skip to main content
SpringerLink
Log in

Statistically Equivalent Mappings of Finite Sets

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

A set-theoretic approach to the analysis of statistically equivalent mappings of a finite set is elaborated. Some model problems are resolved, namely, the investigation of collisions of mappings, analysis of the computational security of a sequence of mappings provided that the number of arguments increases without bound and computation of the asymptotic computational security for this sequence of mappings, analysis of the structure of classes of statistically equivalent mappings, and analysis of conditions under which a mapping is statistically equivalent to its superposition with a given set of mappings.

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. A. P. Alferov, A. Yu. Zubov, A. S. Kuzmin, et al., Foundations of Cryptography [in Russian], Gelios ARV, Moscow (2002).

    Google Scholar 

  2. A. Yu. Zubov, Perfect Ciphers [in Russian], Gelios ARV, Moscow (2003).

    Google Scholar 

  3. Yu. S. Kharin, V. I. Bernik, G. V. Matveev, et al., Mathematical and Computer Foundations of Cryptology [in Russian], Novoe Znanie, Minsk (2003).

    Google Scholar 

  4. B. Schneier, Applied Cryptography: Protocols, Algorithms, and Source Codes in C [Russian translation], TRIUMF, Moscow (2003).

    Google Scholar 

  5. V. V. Skobelev and V. G. Skobelev, Analysis of Cipher Systems [in Russian], IPMM of NASU, Donetsk (2009).

    Google Scholar 

  6. V. V. Skobelev, “Modeling automata over a ring by automata with finite memory,” Probl. Upravl. Inf., No. 3, 114–122 (2012).

  7. V. V. Skobelev and V. G. Skobelev, “On the complexity of analysis of automata over a finite ring,” Cybernetics and Systems Analysis, 46, No. 4, 533–545 (2010).

    Article  MATH  MathSciNet  Google Scholar 

  8. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms [Russian translation], Mir, Moscow (1979).

    Google Scholar 

  9. V. M. Goritskii, “Probabilistic cryptography in information protection systems: Code protection,” Electronics and Communications, No. 5, 140–145 (1998).

  10. V. V. Skobelev, “Analysis of families of the hash functions defined by automata over a finite ring,” Cybernetics and Systems Analysis, 49, No. 2, 209–216 (2013).

    Article  MATH  MathSciNet  Google Scholar 

  11. C. E. Shannon, “Communication theory of secrecy systems,” in: Selected Works on Information Theory and Cybernetics, IL, Moscow (1963), pp. 333–402.

  12. D. B. Bui and Yu. O. Bogatyryova, “The state-of-the-art in the theory of multisets” Bulletin of Taras Shevchenko National University of Kyiv, Ser. Physics & Mathematics, No. 1, 51–58 (2010).

Download references

Author information

Authors and Affiliations

  1. Institute of Applied Mathematics and Mechanics, National Academy of Sciences of Ukraine, Donetsk, Ukraine

    V. V. Skobelev

Authors
  1. V. V. Skobelev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. V. Skobelev.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 41–52, November–December, 2014.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Skobelev, V.V. Statistically Equivalent Mappings of Finite Sets. Cybern Syst Anal 50, 854–865 (2014). https://doi.org/10.1007/s10559-014-9676-7

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-014-9676-7

Keywords

Search

Navigation