The following pages link to (Q3726006):
Displaying 50 items.
- Enumeration of decomposable combinatorial structures with restricted patterns (Q659766) (← links)
- Irreducible polynomials and linear recurring arrays (Q678874) (← links)
- Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm (Q697496) (← links)
- Search of primitive polynomials over finite fields (Q749611) (← links)
- Fast scalable construction of ([compressed] static | minimal perfect hash) functions (Q776836) (← links)
- A short proof for explicit formulas for discrete logarithms in finite fields (Q802668) (← links)
- On algorithms to find \(p\)-ordering (Q831740) (← links)
- On the design of cryptographic primitives (Q850775) (← links)
- Studying the performance of artificial neural networks on problems related to cryptography (Q867941) (← links)
- Some uses of microcomputers in number theory research (Q912884) (← links)
- Analysis of the Herlestam and Johannesson discrete logarithm scheme in \(GF(2^ N)\) for large N (Q1059674) (← links)
- An application of factoring (Q1081302) (← links)
- Discrete logarithms in \(\mathrm{GF}(p)\) (Q1094455) (← links)
- One-way functions and circuit complexity (Q1096587) (← links)
- A key distribution system equivalent to factoring (Q1112781) (← links)
- A key-exchange system based on imaginary quadratic fields (Q1112782) (← links)
- Hyperelliptic cryptosystems (Q1121852) (← links)
- A note on discrete logarithms in finite fields (Q1196517) (← links)
- The computational efficacy of finite-field arithmetic (Q1210295) (← links)
- A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm (Q1261018) (← links)
- Elliptic curve cryptosystems and their implementation (Q1312102) (← links)
- Integers without large prime factors (Q1320524) (← links)
- On the largest degree of an irreducible factor of a polynomial in \(\mathbb{F}_q[X]\) (Q1382695) (← links)
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- Message encoding and retrieval for spread and cyclic orbit codes (Q1696050) (← links)
- Indiscreet logarithms in finite fields of small characteristic (Q1783724) (← links)
- Function field sieve method for discrete logarithms over finite fields (Q1854276) (← links)
- The order of a typical matrix with entries in a finite field (Q1903122) (← links)
- Nonabelian sets with distinct \(k\)-sums (Q1903729) (← links)
- Mathematical problems in cryptology (Q1910812) (← links)
- Interpolation of the Zech's logarithm: explicit forms (Q2080495) (← links)
- On the enumeration of polynomials with prescribed factorization pattern (Q2135566) (← links)
- Computing Frobenius maps and factoring polynomials (Q2366168) (← links)
- On the complexity of matrix reduction over finite fields (Q2467342) (← links)
- Smoothness testing of polynomials over finite fields (Q2513763) (← links)
- The index calculus method using non-smooth polynomials (Q2719078) (← links)
- Correspondences on Hyperelliptic Curves and Applications to the Discrete Logarithm (Q2902925) (← links)
- Accelerating Iterative SpMV for the Discrete Logarithm Problem Using GPUs (Q2949470) (← links)
- A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields (Q3137444) (← links)
- Sequences of consecutive smooth polynomials over a finite field (Q3425971) (← links)
- The Function Field Sieve in the Medium Prime Case (Q3593100) (← links)
- (Q3615928) (← links)
- Algorithms in Algebraic Number Theory (Q4005808) (← links)
- Irregularities in the Distribution of Irreducible Polynomials (Q4032495) (← links)
- An algorithm for evaluation of discrete logarithms in some nonprime finite fields (Q4210964) (← links)
- How random is the characteristic polynomial of a random matrix ? (Q4287012) (← links)
- Computation of low-weight parity checks for correlation attacks on stream ciphers (Q4608500) (← links)
- Faster individual discrete logarithms in finite fields of composite extension degree (Q4612570) (← links)
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method (Q4794653) (← links)
- (Q4940681) (← links)
