Pages that link to "Item:Q3043212"
From MaRDI portal
The following pages link to Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers (Q3043212):
Displaying 30 items.
- Midpoint-free subsets of the real numbers (Q471786) (← links)
- A parallel version of the continued fraction integer factoring algorithm (Q547503) (← links)
- Factoring on a computer (Q799723) (← links)
- Some uses of microcomputers in number theory research (Q912884) (← links)
- Hyperelliptic cryptosystems (Q1121852) (← links)
- Maximal sets of mutually orthogonal Latin squares (Q1297474) (← links)
- Elliptic curve cryptosystems and their implementation (Q1312102) (← links)
- Investigating results and performance of search and construction algorithms for word-based LFSRs, \(\sigma\)-LFSRs (Q1752448) (← links)
- Sequences of numbers generated by addition in formal groups and new primality and factorization tests (Q1820186) (← links)
- Optimal characteristic polynomials for digital multistep pseudorandom numbers (Q1822442) (← links)
- A new family of BIBDs and non-embeddable (16,24,9,6,3)-designs (Q1823247) (← links)
- Factoring with the quadratic sieve on large vector computers (Q1825224) (← links)
- A role for generalized Fermat numbers (Q2953213) (← links)
- Covers of the integers with odd moduli and their applications to the forms $x^{m}-2^{n}$ and $x^{2}-F_{3n}/2$ (Q3055177) (← links)
- A Practical Analysis of the Elliptic Curve Factoring Algorithm (Q3137481) (← links)
- Old and new conjectured diophantine inequalities (Q3199494) (← links)
- A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier (Q3525682) (← links)
- (Q3582591) (← links)
- Gaussian Mersenne and Eisenstein Mersenne primes (Q3584848) (← links)
- Tables of Fibonacci and Lucas factorizations (Q3772275) (← links)
- Factoring with Cyclotomic Polynomials (Q3809851) (← links)
- A new lower bound for odd perfect numbers (Q3825135) (← links)
- Parameter Determination for Complex Number-Theoretic Transforms Using Cyclotomic Polynomials (Q3830938) (← links)
- Some Pseudoprimes and Related Numbers Having Special Forms (Q3834113) (← links)
- Primitive Polynomials Over Finite Fields (Q4032170) (← links)
- An Overview of Factoring (Q5019319) (← links)
- Factorization Using the Quadratic Sieve Algorithm (Q5019322) (← links)
- Widely Digitally Stable Numbers (Q5051821) (← links)
- Speeding up the computations on an elliptic curve using addition-subtraction chains (Q5202278) (← links)
- Small Two-Variable Exponential Diophantine Equations (Q5288238) (← links)
