dc.contributor.author | SHEGEVA, Snejana | |
dc.date.accessioned | 2019-10-29T10:11:30Z | |
dc.date.available | 2019-10-29T10:11:30Z | |
dc.date.issued | 2005 | |
dc.identifier.citation | SHEGEVA, Snejana. Modernization of the Solovay-Strassen test. In: Microelectronics and Computer Science: proc. of the 4th intern. conf., September 15-17, 2005. Chişinău, 2005, vol. 2, pp. 137-139. ISBN 9975-66-038-X. | en_US |
dc.identifier.isbn | 9975-66-038-X | |
dc.identifier.uri | http://repository.utm.md/handle/5014/5549 | |
dc.description.abstract | Today’s version of the Solovay-Strassen test appears more complicated than the Miller-Rabin test mostly because of the need to compute the Jacobi symbol. This computation is required because the Solovay-Strassen test uses random numbers, which may possibly not be prime, as bases for the testing. However, choosing only prime numbers allows us to avoid the harder implementation of the Jacobi symbol and use instead the Legendre symbol. The calculation of the Legendre symbol can be performed by a simple procedure that computes the residue when a tested number is divided by a base. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Technical University of Moldova | en_US |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 United States | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/us/ | * |
dc.subject | Solovay-Strassen test | en_US |
dc.subject | Jacobi symbol | en_US |
dc.subject | Legendre symbol | en_US |
dc.subject | indicative numbers | en_US |
dc.title | Modernization of the Solovay-Strassen test | en_US |
dc.type | Article | en_US |
The following license files are associated with this item: