Mikolaj Karpinski

Prof. Dr. Mikolaj Karpinski

Institute of Security and Computer Science, University of the National Education Commission, Krakow, Kraków, Małopolskie, Poland
orcid

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 January 2017
Verified
Conference Paper
Closed access
Mikolaj KarpinskiMikolaj Karpinski
Mikolaj Karpinski
SIStepan Ivasiev
Stepan Ivasiev
IYIhor Yakymenko
Ihor Yakymenko
MKMykhajlo Kasianchuk
Mykhajlo Kasianchuk
TGTomasz Gancarczyk
Tomasz Gancarczyk
Factorization is one of the most important problems in the theory of numbers and a modern asymmetric cryptography. Known methods of factorization are quite cumbersome; therefore, require significant computational resources for processing multi-bit numbers. The relevance of the factorization problem is dictated also by uncertainty regarding the theoretical foundation of stability for the disclosure of asymmetric cryptosystems. The advanced method of factorization of multi-bit numbers on the basis of Fermat's theorem with the help of the system of residual classes has been developed in this article. The operation of squaring is excluded from proposed method. Arithmetic operations are performed with numbers, which are smaller than the selected module. Last one allows to shifted zone of bit computing resources on several orders to deeper side and replaces the operation of finding the square root, which is caused of computational complexity of the Fermat's algorithm onto generating a binary key of factorization.

3 March 2023 in Information
Verified
Journal Article
Open access
PDF file
OKOlha Kovalchuk
Olha Kovalchuk
Mikolaj KarpinskiMikolaj Karpinski
Mikolaj Karpinski
SBSerhiy Banakh
Serhiy Banakh
MKMykhailo Kasianchuk
Mykhailo Kasianchuk
Ruslan ShevchukRuslan Shevchuk
Ruslan Shevchuk
NZNataliya Zagorodna
Nataliya Zagorodna
Increasing internal state security requires an understanding of the factors that influence the commission of repetitive crimes (recidivism) since the crime is not caused by public danger but by the criminal person. Against the background of informatization of the information activities of law enforcement agencies, there is no doubt about the expediency of using artificial intelligence algorithms and blockchain technology to predict and prevent crimes. The prediction machine-learning models for identifying significant factors (individual characteristics of convicts), which affect the propensity to commit criminal recidivism, were applied in this article. For predicting the probability of propensity for criminal recidivism of customers of Ukrainian penitentiary institutions, a Decision Tree model was built to suggest the probability of repeated criminal offenses by convicts. It was established that the number of convictions to the actual punishment and suspended convictions is the main factors that determine the propensity of customers of penitentiary institutions to commit criminal recidivism in the future. Decision Tree models for the classification of convicts prone or not prone to recidivism were built. They can be used to predict new cases for decision-making support in criminal justice. In our further research, the possibility of using the technology of distributed registers/blockchain in predictive criminology will be analyzed.

1 September 2018
Verified
Conference Paper
Closed access
VBVladimir.V. Barannik
Vladimir.V. Barannik
Mikolaj KarpinskiMikolaj Karpinski
Mikolaj Karpinski
VTV.V. Tverdokhleb
V.V. Tverdokhleb
DBDmitry.V. Barannik
Dmitry.V. Barannik
VHV.V. Himenko
V.V. Himenko
MAMarek Aleksander
Marek Aleksander
In this article we consider the methodological basis for constructing a method for monitoring the bit rate of a video stream in conditions of changes in the parameters of network channels. The work of the method using the interpolation mechanisms of the discrete-cosine transform of the frame and also the recombination of the transformants bit planes described. Shows the essence of mean square error level control mechanism during the video stream transmitting.

2 June 2015 in Environmental Fluid Mechanics
Verified
Journal Article
Open access
PDF file
Robert BialikRobert Bialik
Robert Bialik
VNVladimir I. Nikora
Vladimir I. Nikora
Mikolaj KarpinskiMikolaj Karpinski
Mikolaj Karpinski
Paweł M. RowińskiPaweł M. Rowiński
Paweł M. Rowiński
The motion of bedload particles is diffusive and occurs within at least three scale ranges: local, intermediate and global, each of which with a distinctly different diffusion regime. However, these regimes, extensions of the scale ranges and boundaries between them remain to be better defined and quantified. These issues are explored using a Lagrangian model of saltating grains over the uniform fixed bed. The model combines deterministic particle motion dynamics with stochastic characteristics such as probability distributions of step lengths and resting times. Specifically, it is proposed that a memoryless exponential distribution is an appropriate model for the distribution of rest periods while the probability that a particle stops after a current jump follows a binomial distribution, which is a distribution with lack of memory as well. These distributions are incorporated in the deterministic Lagrangian model of saltating grains and extensive numerical simulations are conducted for the identification of the diffusive behavior of particles at different time scales. Based on the simulations and physical considerations, the local, intermediate, and global scale ranges are quantified and the transitions from one range to another are studied for a spectrum of motion parameters. The obtained results demonstrate that two different time scales should be considered for parameterization of diffusive behavior within intermediate and global scale ranges and for defining the local–intermediate and intermediate–global boundaries. The simulations highlight the importance of the distributions of the step lengths and resting times for the identification of the boundaries (or transition intervals) between the scale ranges.

30 January 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
Volodymyr MaksymovychVolodymyr Maksymovych
Volodymyr Maksymovych
Mariia ShabaturaMariia Shabatura
Mariia Shabatura
Oleh HarasymchukOleh Harasymchuk
Oleh Harasymchuk
Mikolaj KarpinskiMikolaj Karpinski
Mikolaj Karpinski
DANIEL JANCARCZYKDANIEL JANCARCZYK
DANIEL JANCARCZYK
PSPawel Sawicki
Pawel Sawicki
Pseudorandom sequence generation is used in many industries, including cryptographic information security devices, measurement technology, and communication systems. The purpose of the present work is to research additive Fibonacci generators (AFG) and modified AFG (MAFG) with modules p prime numbers, designed primarily for their hardware implementation. The known AFG and MAFG, as with any cryptographic generators of pseudorandom sequences, are used in arguments with tremendous values. At the same time, there are specific difficulties in defining of their statistical characteristics. In this regard, the following research methodologies were used in work: for each variant of AFG and MAFG, two models were created—abstract, which is not directly related to the circuit solution, and hardware, which corresponds to the proposed structure; for relatively small values of arguments, the identity of models was proved; the research of statistical characteristics, with large values of arguments, was carried out using an abstract model and static tests NIST. Proven identity of hardware and abstract models suggest that the principles laid down in the organization of AFG and MAFG structures with modules of prime numbers ensure their effective hardware implementation in compliance with all requirements for their statistical characteristics and the possibility of application in cryptographic information security devices.

25 September 2021 in Sensors
Verified
Journal Article
Open access
PDF file
Mikolaj KarpinskiMikolaj Karpinski
Mikolaj Karpinski
Lyudmila V KovalchukLyudmila V Kovalchuk
Lyudmila V Kovalchuk
RKRoman Kochan
Roman Kochan
Roman OliynykovRoman Oliynykov
Roman Oliynykov
MRMariia Rodinko
Mariia Rodinko
ŁWŁukasz Więcław
Łukasz Więcław
Two double-spend attack strategies on a proof-of-stake consensus are considered. For each strategy, the probability of its success is obtained, which depends on the network parameters and the number of confirmation blocks. These results can be used to define how many confirmation blocks a vendor should wait after a correspondent transaction before sending goods or services.