Results 81 to 90 of about 137 (116)

Factorization and primality testing David M. Bressoud

Journal of Computational and Applied Mathematics, 1990
openaire   +1 more source

On the fundamental subdirect factorization theorems of primal algebra theory

Mathematische Zeitschrift, 1969
openaire   +2 more sources

Primality and factorization

, 1983
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Clever Factorization Algorithms and Primality Testing

Springer Undergraduate Mathematics Series, 2018
The main theoretical way of attacking RSA, at least when it is used with best practices, is by factoring the modulus. The most obvious way of factoring a number n is to try dividing by 2, 3, 5, 7, and so on, through all the primes less than \(\sqrt{n}\), until we find a factor.
Simon Rubinstein-Salzedo, Rubinstein-Salzedo Simon   +1 more
exaly   +2 more sources

Primality Testing and Integer Factorization in Public-Key Cryptography

Advances in Information Security, 2004
Song Y Yan
exaly   +2 more sources

Integer Factorization and Primality Testing: A Randomized Approach

Alok Chauhan, Abhyuday Chauhan
exaly   +2 more sources

Applications: Algorithms, Primality and Factorization, Codes

2011
This chapter describes some industrial applications of number theory, via computer science. We succinctly describe the main algorithms as well as their theoretical complexity or computation time. We use the notation O(f(n)) to denote a function ≤Cf(n); furthermore, the unimportant—at least from a theoretical point of view—constants which appear will be
openaire   +1 more source

Parsimonious kernel extreme learning machine in primal via Cholesky factorization

Neural Networks, 2016
Recently, extreme learning machine (ELM) has become a popular topic in machine learning community. By replacing the so-called ELM feature mappings with the nonlinear mappings induced by kernel functions, two kernel ELMs, i.e., P-KELM and D-KELM, are obtained from primal and dual perspectives, respectively.
openaire   +3 more sources

Sparse LSSVM in Primal Using Cholesky Factorization for Large-Scale Problems

IEEE Transactions on Neural Networks and Learning Systems, 2016
For support vector machine (SVM) learning, least squares SVM (LSSVM), derived by duality LSSVM (D-LSSVM), is a widely used model, because it has an explicit solution. One obvious limitation of the model is that the solution lacks sparseness, which limits it from training large-scale problems efficiently.
openaire   +2 more sources

Primality tests and factorization algorithms. I

2001
Schöne Übersichtsarbeit über Primzahltests; im vorliegenden Teil werden die theoretisch aufwendigeren Tests nach Adleman-Rumely-Pomerance-Cohen-Lenstra und Goldwasser-Kilian ausgespart. Für neueste Entwicklungen auf diesem Gebiet, vgl. ein Preprint von Agrawal, Kayal, Saxena (``PRIMES is in \(P\)''), wo ein deterministischer Polynomzeit-Algorithmus ...
openaire   +2 more sources