✦ LIBER ✦

Optimal normal bases in GF(pn)

✍ Scribed by R.C. Mullin; I.M. Onyszchuk; S.A. Vanstone; R.M. Wilson

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 715 KB
Volume: 22
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(88)90090-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Normal Bases over GF(q)

✍ Yaotsu Chang; T.K Truong; I.S Reed 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 97 KB

For q a power of a prime p, it is known that if m is a power of p or m itself is a prime different from p having q as one of its primitive roots, then the roots of any irreducible polynomial of degree m and of non-zero trace are linearly independent Ž . over GF q . As a consequence the roots of such

Optimal normal bases

✍ Shuhong Gao; Hendrik W. Lenstra 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 364 KB

Let K C L be a finite Galois extension of fields, of degree n. Let G be the Galois group, and let (act)o~G be a normal basis for L over K. An argument due to Mullin, Onyszchuk, Vanstone and W'flson (Discrete Appl. Math. 22 (1988/89), 149-161) shows that the matrix that describes the map x ~ otx on t

Unitary Similarity of Normal Matrices in

✍ A. Duane Porter; Leslie Ann Hanson 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 357 KB

Optimal Karatsuba-like formulae for cert

Optimal Karatsuba-like formulae for certain bilinear forms in GF(2)

✍ Ivan Oseledets 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 142 KB

Concurrent Error Detection in Multiplexe

Concurrent Error Detection in Multiplexer-Based Multipliers for Normal Basis of GF(2m) Using Double Parity Prediction Scheme

✍ Chiou-Yng Lee; Che Wun Chiou; Jim-Min Lin 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 333 KB

Finding optimal derivation strategies in

Finding optimal derivation strategies in redundant knowledge bases

✍ Russell Greiner 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 1014 KB

Greiner, R., Finding optimal derivation strategies in redundant knowledge bases (Research Note), Artificial Intelligence 50 (1991) 95-115. A backward chaining process uses a collection of rules to reduce a given goal to a sequence of database retrievals. A "derivation strategy" is an ordering on th