The following pages link to Melsik K. Kyureghyan (Q439080):
Displaying 28 items.
- Recursive constructions of irreducible polynomials over finite fields (Q439081) (← links)
- (Q516790) (redirect page) (← links)
- Permutation polynomials and a new public-key encryption (Q516791) (← links)
- Iterated constructions of irreducible polynomials over finite fields with linearly independent roots (Q596584) (← links)
- (Q648073) (redirect page) (← links)
- Irreducible compositions of polynomials over finite fields (Q648074) (← links)
- Recursive constructions of N-polynomials over \(\text{GF}(2^s)\) (Q947101) (← links)
- (Q1604417) (redirect page) (← links)
- Recurrent methods for constructing irreducible polynomials over \(\text{GF}(2^s)\) (Q1604418) (← links)
- Recurrent methods for constructing irreducible polynomials over \(\mathbb F_{q}\) of odd characteristics. (Q1867478) (← links)
- Irreducible compositions of polynomials over finite fields of even characteristic (Q1928790) (← links)
- A recurrent construction of irreducible polynomials of fixed degree over finite fields (Q2121574) (← links)
- Recurrent methods for constructing irreducible polynomials over \(\mathbb F_q\) of odd characteristics. II (Q2500603) (← links)
- (Q2911201) (← links)
- A Recurrent Method for Constructing Irreducible Polynomials over Finite Fields (Q3090887) (← links)
- New recursive construction of normal polynomials over finite fields (Q3187277) (← links)
- Monotonicity checking (Q3439281) (← links)
- Recursive Constructions of N-polynomials over GF (2s) (Q3439282) (← links)
- (Q3476921) (← links)
- (Q3754705) (← links)
- (Q3758005) (← links)
- (Q3769010) (← links)
- (Q3772321) (← links)
- (Q3772322) (← links)
- (Q3788106) (← links)
- (Q3807330) (← links)
- FACTORIZATION OF SOME COMPOSITE POLYNOMIALS OVER FINITE FIELDS (Q4916169) (← links)
- Monotonicity Checking (Q5504224) (← links)
