-
1 factoring algorithm
Безопасность: алгоритм разложения (больших чисел) на простые множители, алгоритм разложения ( больших чисел) на простые сомножители, алгоритм факторизации -
2 factoring algorithm
алгоритм разложения (больших чисел) на простые (со) множители, алгоритм факторизацииАнгло-русский словарь по компьютерной безопасности > factoring algorithm
-
3 generalpurpose factoring algorithm
общий алгоритм разложения на множители
Алгоритм, время выполнения которого зависит только от размера разлагаемого на множители числа. См. special purpose factoring algorithm (специальный алгоритм разложения на множители).
[ http://www.morepc.ru/dict/]Тематики
EN
Англо-русский словарь нормативно-технической терминологии > generalpurpose factoring algorithm
-
4 special-purpose factoring algorithm
алгоритм разложения на множители специального назначения
Алгоритм разложения на множители, который эффективен или неэффективен только для некоторых чисел.
[ http://www.rfcmd.ru/glossword/1.8/index.php?a=index&d=4485]Тематики
EN
Англо-русский словарь нормативно-технической терминологии > special-purpose factoring algorithm
-
5 quadratic sieve factoring algorithm
Англо-русский словарь по компьютерной безопасности > quadratic sieve factoring algorithm
-
6 algorithm
алгоритм (cryptoalgorithm) криптографический алгоритм, криптоалгоритм; алгоритм шифрования (криптографического закрытия)- private cryptographic algorithmАнгло-русский словарь по компьютерной безопасности > algorithm
См. также в других словарях:
Shor's algorithm — Shor s algorithm, first introduced by mathematician Peter Shor, is a quantum algorithm for integer factorization. On a quantum computer, to factor an integer N, Shor s algorithm takes polynomial time in log{N}, specifically O((log{N})^3),… … Wikipedia
Williams' p + 1 algorithm — In computational number theory, Williams p + 1 algorithm is an integer factorization algorithm, one of the family of algebraic group factorisation algorithms. It was invented by Hugh C. Williams in 1982. It works well if the number N to be… … Wikipedia
Berlekamp's algorithm — In mathematics, particularly computational algebra, Berlekamp s algorithm is a well known method for factoring polynomials over finite fields (also known as Galois fields ). The algorithm consists mainly of matrix reduction and polynomial GCD… … Wikipedia
Pollard's p - 1 algorithm — Pollard s p − 1 algorithm is a number theoretic integer factorization algorithm, invented by John Pollard in 1974. It is a special purpose algorithm, meaning that it is only suitable for integers with specific types of factors; it is the simplest … Wikipedia
Deutsch–Jozsa algorithm — The Deutsch–Jozsa algorithm is a quantum algorithm, proposed by David Deutsch and Richard Jozsa in 1992[1] with improvements by Richard Cleve, Artur Ekert, Chiara Macchiavello, and Michele Mosca in 1998.[2] Although it is of little practical use … Wikipedia
Euclidean algorithm — In number theory, the Euclidean algorithm (also called Euclid s algorithm) is an algorithm to determine the greatest common divisor (GCD) of two elements of any Euclidean domain (for example, the integers). Its major significance is that it does… … Wikipedia
Deutsch-Jozsa algorithm — The Deutsch Jozsa algorithm is a quantum algorithm, proposed by David Deutsch and Richard Jozsa in 1992 with improvements by R. Cleve, A. Ekert, C. Macchiavello, and M. Mosca in 1998.cite journal author = David Deutsch and Richard Jozsa title =… … Wikipedia
Cantor–Zassenhaus algorithm — In mathematics, particularly computational algebra, the Cantor–Zassenhaus algorithm is a well known method for factorising polynomials over finite fields (also called Galois fields).The algorithm consists mainly of exponentiation and polynomial… … Wikipedia
In-place algorithm — In place redirects here. For execute in place file systems, see execute in place. In computer science, an in place algorithm (or in Latin in situ) is an algorithm which transforms input using a data structure with a small, constant amount of… … Wikipedia
Lenstra–Lenstra–Lovász lattice basis reduction algorithm — The Lenstra–Lenstra–Lovász lattice basis reduction (LLL) is a polynomial time lattice reduction algorithm invented by Arjen Lenstra, Hendrik Lenstra and László Lovász. Given as input d lattice basis vectors with n dimensional integer coordinates… … Wikipedia
Bach's algorithm — is a probabilistic polynomial time algorithm for generating random numbers along with their factorization, named after its discoverer, Eric Bach. It is of interest because no algorithm is known that efficiently factors numbers, so the… … Wikipedia