• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site
Of all publications in the section: 11
Sort:
by name
by year
Article
Гамаюнов Д. Ю., Сковорода А. А. Прикладная дискретная математика. 2017. № 36. С. 84-105.

In this paper, we propose a heuristic approach to static analysis of Android applications based on matching suspicious applications with the predefined malware models. Static models are built from Android capabilities and Android Framework API call chains used by the application. All of the analysis steps and model construction are fully automated. Therefore, the method can be easily deployed as one of the automated checks provided by mobile application marketplaces or other interested organizations. Using the proposed method, we analyzed the Drebin and ISCX malware collections in order to find possible relationships and dependencies between samples in collections, and a large fraction of Google Play apps collected between 2013 and 2016 representing benign data. Analysis results show that a combination of relatively simple static features represented by permissions and API call chains is enough to perform binary classification between malware and benign apps, and even find the corresponding malware family, with an appropriate false positive rate of about 3%. Malware collections exploration results show that modern Android malware rarely uses obfuscation or encryption techniques to make static analysis more difficult, which is quite the opposite of what we see in the case of the “Wintel” endpoint platform family. We also provide the experiment-based comparison with the previously proposed stateof-the-art Android malware detection method adagio. This method outperforms our proposed method in resulting detection coverage (98 vs 91 % of malicious samples are covered) while at the same time causing a significant number of false alarms corresponding to 9.3 % of benign applications on average.

Added: Sep 13, 2018
Article
Рожков М. И. Прикладная дискретная математика. 2014. № 1(23). С. 27-39.

The paper deals with the methods of construction of bijective mappings Bf;L;

the coordinate functions of which are set by the great length shift register with the function

of feedback L(x1; x2; : : : ; xn) and a removal nonlinear function f(x1; x2; : : : ; xk) of a small

number of arguments k, (k<<n). It is known, the orthogonality of the coordinate functions

is equivalent to the mapping Bf;L is bijective. The method is developed which reduce the

original problem to the veri cation of orthogonal systems of Boolean functions with shift

registers of limited length n < n0, that allows efficient use of its computing solutions.The

method allowed to build new in nite classes of bijective mappings Bf;L for the nonlinear

functions f, depending on four, ve and six variables. Earlier, similar results were known

for the function f depending on three arguments. The results can be useful for construction

and proof of the statistical properties of the random sequences generating on the basis of

lter generators.

Added: Mar 12, 2015
Article
Петухов А. А., Раздобаров А. В., Сигалов Д. А. Прикладная дискретная математика. 2017. № 35. С. 63-75.
Added: Dec 1, 2017
Article
Борисенко Б. Б. Прикладная дискретная математика. 2010. № 2(8). С. 12-29.
Added: Mar 15, 2013
Article
Нестеренко А. Ю., Пугачев А. В. Прикладная дискретная математика. 2015. № 4. С. 56-71.

A new hybrid encryption scheme based on ElGamal asymmetric encryption scheme with distributed secret keys is presented. The keys are used for defence against unauthorised intrusion of encrypted messages. The security of the scheme is based on elliptic curve discrete logarithm problem. The main feature of the scheme is the fact that plain message is not represented as a point of elliptic curve, hence, we can encrypt a long messages. We validate the cryptographic properties of the scheme and give some examples of its practical evaluations.

Added: Mar 14, 2016
Article
Миронкин В. О. Прикладная дискретная математика. 2018. № 42. С. 6-17.

The paper is devoted to research of a random variable equal to the length of aperiodicity segment of an arbitrary vertex x of a finite set S in the k-fold iteration graph of an equiprobable random mapping f: S --> S. The behavior of the local probability of aperiodicity is studied. Its two-sided estimates are obtained in the general form and for the cases of simple k, which are effectively computable for practical values of n (2 ^ {256} and more). Two-sided estimates are written for the length distribution function of a segment of aperiodicity.

Added: Mar 15, 2019
Article
Михайлович А. В. Прикладная дискретная математика. 2015. № 1. С. 17-26.

Closed classes of three-valued logic functions whose generating systems consist of symmetric functions taking values in the set {0, 1} and taking value 1 on bounded number of layers from {1, 2}^n are consideder. Criteria of existence of a basis and existence of finite basis are obtained for these classes. There shown how existence of a basis and existence of finite basis depend on existence of a basis and existence of finite basis in subclasses, generated by monotonous and non-monotonous functions individually.

Added: Mar 11, 2015
Article
Рожков М. И. Прикладная дискретная математика. 2015. № 1(27). С. 78-83.

The article is considered the problem of the decomposition of a given simple homogeneous Markov chain in the sum of the components of the circuit. It is described the class of circuits that allow this decomposition of an infinite number of ways.

Added: Apr 2, 2015
Article
Кочергин В. В., Михайлович А. В. Прикладная дискретная математика. 2015. № 4. С. 24-31.

Complexity of realization of Boolean functions and Boolean function systems over a basis which consist of all monotone functions and finite number of non-monotone funcitons is investigated. The weight of any monotone function from the basis equal 0. The weight of non-monotone function is positive. A. A. Markov studied special case of such basis. The non-monotone part of the basis consist of the only negation function. He showed that the minimum number of negation elements which are needed to realize an arbitrary function f equal ]log2(d(f)+1)[. Here d(f) is the maximum number of value changes from 1 to 0 over all increasing chains of arguments tuples.mThe aim of this paper is to prove that the complexity of a boolean function f realization equal ρ]log2(d(f)+1)[-O(1), where ρ is the minimum weight of non-monotone basis elements. Similar generalization of classical Markov result concerning realization of boolean funciton systems was obtained.

Added: Dec 8, 2015
Article
Гамаюнов Д. Ю., Шейдаев В. Ф. Прикладная дискретная математика. 2018. № 40. С. 72-86.

With this paper, we provide our research into the problem of secure communications in the presence of a global unlimited adversary. As a solution, we propose to use decentralised deniable communications. We have made use of our existing multi-party Off-the-Record protocol’s modification which is able to function over decentralised transport. Its Perfect Forward Secrecy (PFS) features were improved by adding Key Ratcheting procedure to the protocol’s flow. As a result, we propose a fully decentralised cryptosystem which has deniability and transcript consistency features, improved PFS and ability to resist the Sybil attack. We also give a detailed overview of the protocol model implementation in JavaScript designed to function in conditions of centralized server’s absence.

Added: Jun 27, 2018
Article
Кочергин В. В., Кочергин Д. В. Прикладная дискретная математика. 2017. Т. 38. С. 119-132.
Added: Oct 8, 2018