Modification and Optimization of Solovey-Strassen's Fast Exponentiation Probablistic Test Binary Algorithm

Autor:	Irina Reshetnikova, Nikita Ye. Myzdrikov, Vasiliy I. Yukhnov, Olga Safaryan, Vitaliy M. Porksheyan, Andrey G. Lobodenko, Larissa V. Cherckesova, Ivan Ye. Semeonov
Rok vydání:	2019
Předmět:	Computer science business.industry media_common.quotation_subject Probabilistic logic Cryptography Prime (order theory) Test (assessment) Strassen algorithm Information system Simplicity Arithmetic business Exponentiation by squaring media_common
Zdroj:	EWDTS
DOI:	10.1109/ewdts.2019.8884469
Popis:	This article will consider the probability test of Solovey-Strassen, to determine the simplicity of the number and its possible modifications. This test allows for the shortest possible time to determine whether the number is prime or not. C# programming language was used to implement the algorithm in practice.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::c0eb20ab6154d056686c1e3dfb00a288 https://doi.org/10.1109/ewdts.2019.8884469 Zobrazit plný text záznamu