scientific article; zbMATH DE number 554529
From MaRDI portal
Publication:4288335
Recommendations
Cited in
(18)- Efficient parallel algorithms to test square-freeness and factorize strings
- Highly parallel computations modulo a number having only small prime factors
- Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms
- An improved parallel block Lanczos algorithm over GF(2) for integer factorization
- Parallel integer relation detection: techniques and applications
- scientific article; zbMATH DE number 1696618 (Why is no real title available?)
- SIMD-Based Implementations of Sieving in Integer-Factoring Algorithms
- Implementing the Continued Fraction Factoring Algorithm on Parallel Machines
- scientific article; zbMATH DE number 4165009 (Why is no real title available?)
- scientific article; zbMATH DE number 1186932 (Why is no real title available?)
- Simple parallel algorithms for primality testing and integer factorization
- scientific article; zbMATH DE number 1424533 (Why is no real title available?)
- scientific article; zbMATH DE number 1424563 (Why is no real title available?)
- Factoring Numbers on the Massively Parallel Computer
- Analogue algorithm for parallel factorization of an exponential number of large integers. II: Optical implementation
- scientific article; zbMATH DE number 5492361 (Why is no real title available?)
- A parallel version of the continued fraction integer factoring algorithm
- Distributed programming paradigms with cryptography applications
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4288335)
