The following pages link to Joachim von zur Gathen (Q165879):
Displaying 50 items.
- (Q3041304) (← links)
- (Q3062274) (← links)
- Polynomial factorization over ${\mathbb F}_2$ (Q3147181) (← links)
- (Q3156433) (← links)
- Zimmermann Telegram: The Original Draft (Q3181712) (← links)
- Subset sum pseudorandom numbers: fast generation and distribution (Q3182467) (← links)
- Parallel Algorithms for Algebraic Problems (Q3216142) (← links)
- (Q3316587) (← links)
- (Q3340960) (← links)
- Tests for Permutation Polynomials (Q3360269) (← links)
- Comparative Analysis of Random Generators (Q3387110) (← links)
- CLAUDE COMIERS: THE FIRST ARITHMETICAL CRYPTOGRAPHY (Q3452625) (← links)
- Values of polynomials over finite fields (Q3495444) (← links)
- Hensel and Newton Methods in Valuation Rings (Q3703974) (← links)
- Factorization of Multivariate Polynomials Over Finite Fields (Q3728101) (← links)
- Representations and Parallel Computations for Rational Functions (Q3735077) (← links)
- Computing Powers in Parallel (Q3776614) (← links)
- (Q3839011) (← links)
- Secant Spaces to Curves (Q3957560) (← links)
- (Q4109684) (← links)
- A Bound on Solutions of Linear Integer Equalities and Inequalities (Q4181607) (← links)
- Normal bases via general Gauss periods (Q4223138) (← links)
- (Q4226694) (← links)
- (Q4226936) (← links)
- (Q4227316) (← links)
- (Q4227317) (← links)
- Computing components and projections of curves over finite fields (Q4229409) (← links)
- Modern computer algebra (Q4248250) (← links)
- (Q4252713) (← links)
- (Q4314359) (← links)
- Gauss periods: orders and cryptographical applications (Q4372701) (← links)
- (Q4406533) (← links)
- Irreducible trinomials over finite fields (Q4417173) (← links)
- Finding Points on Curves over Finite Fields (Q4429696) (← links)
- (Q4470462) (← links)
- (Q4502647) (← links)
- The CREW PRAM Complexity of Modular Inversion (Q4507327) (← links)
- (Q4508389) (← links)
- (Q4525713) (← links)
- Density of real and complex decomposable univariate polynomials (Q4555471) (← links)
- Iteration entropy (Q4629386) (← links)
- (Q4724729) (← links)
- (Q4725742) (← links)
- Fast parallel matrix and GCD computations (Q4745254) (← links)
- Factoring a binary polynomial of degree over one million (Q4810180) (← links)
- Computing special powers in finite fields (Q4813594) (← links)
- (Q4938671) (← links)
- Compositions and collisions at degree <i>p</i> <sup>2</sup> (Q5244521) (← links)
- Counting curves and their projections (Q5248552) (← links)
- (Q5301694) (← links)
