Open AccessRandomized Primality Tests
Author(s) -
Олександра Козачок
Publication year - 2021
Publication title -
mogilânsʹkij matematičnij žurnal
Language(s) - English
Resource type - Journals
eISSN - 2663-0648
pISSN - 2617-7080
DOI - 10.18523/2617-70803202038-47
Subject(s) - primality test , simplicity , computer science , randomized algorithm , probabilistic logic , theoretical computer science , cryptography , algorithm , mathematics , artificial intelligence , discrete mathematics , prime number , philosophy , epistemology
Randomization and probabilistic approach in the algorithms development occupy prominent place.Due to limited computing resources and complexity many tasks in some cases it’s impossible to obtain accurate results or it’s too costly, so the results may contain some uncertainty. There are also cases when the indeterminacy of the algorithm is its advantage, for example in cryptography problems, or a useful characteristic: in simulations of processes containing undefined parameters.In this paper, we consider the basic concepts and statements concerning randomized algorithms for checking numbers for simplicity, we present the necessary theorems.