The following pages link to Ian F. Blake (Q677137):
Displayed 50 items.
- A construction method for generalized Room squares (Q1225623) (← links)
- A note on generalized room squares (Q1246428) (← links)
- On an inverse for sections of a binomial matrix (Q1254581) (← links)
- A remark on the minimal polynomial of the product of linear recurring sequences (Q1267007) (← links)
- Lattice reduction: a toolbox for the cryptoanalyst (Q1272333) (← links)
- On Carmichael polynomials (Q1273709) (← links)
- Modern cryptography, probabilistic proofs and pseudo-randomness (Q1273742) (← links)
- Factoring modular polynomials (Q1273766) (← links)
- Number theoretic methods in cryptography. Complexity lower bounds (Q1276548) (← links)
- On the concatenated structure of a linear code (Q1277245) (← links)
- Linear complexity profiles: Hausdorff dimensions for almost perfect profiles and measures for general profiles (Q1296526) (← links)
- On the degrees of irreducible factors of polynomials over a finite field (Q1297409) (← links)
- Connections between the algorithms of Berlekamp and Niederreiter for factoring polynomials over \(\mathbb{F}_ q\) (Q1311315) (← links)
- Factorization of polynomials and some linear-algebra problems over finite fields (Q1311328) (← links)
- Two new decoding algorithms for Reed-Solomon codes (Q1311609) (← links)
- The complexity of sparse polynomial interpolation over finite fields (Q1320441) (← links)
- Quaternary constructions for the binary single-error-correcting codes of Julin, Best and others (Q1321554) (← links)
- On completely free elements in finite fields (Q1321563) (← links)
- On a convolution of linear recurring sequences over finite fields. II (Q1322066) (← links)
- Factorization of polynomials over finite fields and characteristic sequences (Q1322768) (← links)
- Error-correcting codes (Q1327871) (← links)
- A binary perfect code of length 15 and codimension 0 (Q1329112) (← links)
- The weight hierarchies of the projective codes from nondegenerate quadrics (Q1329118) (← links)
- Divisors of codes of Reed-Muller type (Q1332412) (← links)
- A key-exchange protocol using real quadratic fields (Q1335027) (← links)
- Dickson polynomials and irreducible polynomials over finite fields (Q1336063) (← links)
- Cross-correlations of quadratic form sequences in odd characteristic (Q1358669) (← links)
- Constructions and properties of \(k\) out of \(n\) visual secret sharing schemes (Q1358676) (← links)
- An expansion for the coordinates of the trace function over Galois rings (Q1360982) (← links)
- A prime number generator for devices for noise-resistant transmission of information along a radio channel (Q1363888) (← links)
- On the structure of Hermitian codes (Q1373284) (← links)
- Cyclic codes over finite rings (Q1377884) (← links)
- Equivalences between elliptic curves and real quadratic congruence function fields (Q1382095) (← links)
- Orders of Gauss periods in finite fields (Q1389144) (← links)
- Discrete logarithm based cryptosystems in quadratic function fields of characteristic 2 (Q1389154) (← links)
- On the key equation over a commutative ring (Q1580538) (← links)
- Solvability of systems of polynomial congruences modulo a large prime (Q1590076) (← links)
- Kangaroos, monopoly and discrete logarithms (Q1590361) (← links)
- Computing discrete logarithms in quadratic orders (Q1590363) (← links)
- On the security of the digital signature algorithm (Q1611356) (← links)
- Efficient algorithms for Koblitz curves over fields of characteristic three (Q1775021) (← links)
- Prime-number algorithm for public-key systems (Q1816016) (← links)
- Bounds for key distribution patterns (Q1819120) (← links)
- On the security of a practical identification scheme (Q1819122) (← links)
- On the contrast in visual cryptography schemes (Q1819123) (← links)
- On weights in duadic codes (Q1821758) (← links)
- On the complexity of the discrete logarithm and Diffie-Hellman problems (Q1827563) (← links)
- Subspaces and polynomial factorizations over finite fields (Q1842604) (← links)
- On the minimal polynomial of the product of linear recurring sequences (Q1891284) (← links)
- The Berlekamp-Massey algorithm and linear recurring sequences over a factorial domain (Q1894579) (← links)