The following pages link to (Q4336113):
Displaying 12 items.
- Message authentication based on cryptographically secure CRC without polynomial irreducibility test (Q1696144) (← links)
- A note on the multiple-recursive matrix method for generating pseudorandom vectors (Q1786872) (← links)
- Full classification of permutation rational functions and complete rational functions of degree three over finite fields (Q2182062) (← links)
- A note on the reducibility of binary affine polynomials (Q2638417) (← links)
- Standard generators of finite fields and their cyclic subgroups (Q2687267) (← links)
- Analysis of Rabin's irreducibility test for polynomials over finite fields (Q2772930) (← links)
- Calculating the set of orders of elements in the finite linear groups (Q3545834) (← links)
- Gauss periods: orders and cryptographical applications (Q4372701) (← links)
- On Sets of Irreducible Polynomials Closed by Composition (Q5267794) (← links)
- On the degrees of polynomial divisors over finite fields (Q5360417) (← links)
- Factoring polynomials over finite fields: A survey (Q5928877) (← links)
- On eigenvalue gaps of integer matrices (Q6657193) (← links)
