Modification and Optimization of Solovey-Strassen's Fast Exponentiation Probablistic Test Binary Algorithm
| Title | Modification and Optimization of Solovey-Strassen's Fast Exponentiation Probablistic Test Binary Algorithm |
| Publication Type | Conference Paper |
| Year of Publication | 2019 |
| Authors | Myzdrikov, Nikita Ye., Semeonov, Ivan Ye., Yukhnov, Vasiliy I., Safaryan, Olga A., Reshetnikova, Irina V., Lobodenko, Andrey G., Cherckesova, Larissa V., Porksheyan, Vitaliy M. |
| Conference Name | 2019 IEEE East-West Design Test Symposium (EWDTS) |
| Keywords | Algorithm, binary exponentiation, C\# languages, C\# programming language, cryptography, exponentiation, Fermat, Fermat's little theorem, Information systems, Jacobi symbol, Jacobian matrices, Optimization, Probabilistic logic, probability, probability test, pubcrawl, Resiliency, Scalability, Software algorithms, Solovey-Strassen, Solovey-Strassen fast exponentiation probablistic test binary algorithm, test |
| Abstract | 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. |
| DOI | 10.1109/EWDTS.2019.8884469 |
| Citation Key | myzdrikov_modification_2019 |
- optimization
- test
- Solovey-Strassen fast exponentiation probablistic test binary algorithm
- Solovey-Strassen
- Software algorithms
- Scalability
- Resiliency
- pubcrawl
- probability test
- probability
- Probabilistic logic
- Algorithm
- Jacobian matrices
- Jacobi symbol
- Information systems
- Fermat's little theorem
- Fermat
- exponentiation
- C\# programming language
- C\# languages
- Cryptography
- binary exponentiation