Skip to content
cs-conference-ranking.org

Valeriy O. Osipyan

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

11

Venues

1

Active years

2011–2024

Best venue rank

C

Where they publish

Papers

11 indexed papers, newest first.

YearVenueTitleAuthors
2024SINMathematical Models of Security Information Systems Based on the Generalized Multiplicative Knapsacks.Valeriy O. Osipyan, E. T. J. Algharib, Arseniy Zhuck, Kirill I. Litvinov
2020SINDevelopment of the mathematic model of disymmetric bigram cryptosystem based on a parametric solution family of multi-degree system of Diophantine equations✱.Valeriy O. Osipyan, Kirill I. Litvinov
2019SINDevelopment of information security system mathematical models by the solutions of the multigrade Diophantine equation systems.Valeriy O. Osipyan, Kirill I. Litvinov, R. Kh. Bagdasaryan, E. P. Lukashchik, S. G. Sinitsa, A. S. Zhuk
2018SINA mathematical model of the cryptosystem based on the linear Diophantine equation.Valeriy O. Osipyan, Kirill I. Litvinov
2017SINThe duality principle in the theory of development generalized A-M knapsack cryptosystems.Valeriy O. Osipyan, Valeriy S. Tlusten, Nina V. Laktionova, Nadezhda V. Vakhrusheva
2015SINMathematical modelling of cryptosystems based on Diophantine problem with gamma superposition method.Valeriy O. Osipyan
2014SINMathematical model of the polyalphabetic information security system based on the normal generalized knapsack.Valeriy O. Osipyan
2013SINInformation protection systems based on universal knapsack problem.Valeriy O. Osipyan
2013SINBuilding of mathematical model of flow data processing system based on given selection of elements of the set.Valeriy O. Osipyan, A. S. Zhuck, A. H. Arutyunyan, Y. A. Karpenko
2012SINBuilding of alphabetic data protection cryptosystems on the base of equal power knapsacks with Diophantine problems.Valeriy O. Osipyan
2011SINDifferent models of information protection system, based on the functional knapsack.Valeriy O. Osipyan