|
Browse All Reviews > Theory Of Computation (F) > Analysis Of Algorithms And Problem Complexity (F.2) > Numerical Algorithms And Problems (F.2.1) > Computations In Finite Fields (F.2.1...)
|
|
|
|
|
|
|
|
|
1-10 of 15
Reviews about "Computations In Finite Fields (F.2.1...)":
|
Date Reviewed |
|
Some new results on permutation polynomials over finite fields Ma J., Zhang T., Feng T., Ge G. Designs, Codes and Cryptography 83(2): 425-443, 2017. Type: Article
A permutation polynomial (PP) over a finite field Fq is a polynomial over Fq that maps Fq onto itself, that is, permutes the elements of
|
Jun 28 2017 |
|
Constructions of almost difference sets from finite fields Ding C., Pott A., Wang Q. Designs, Codes and Cryptography 72(3): 581-592, 2014. Type: Article
Let (G,+) be a group of order v, let D be a k-subset of G, and for each w in G define dD...
|
Sep 8 2014 |
|
Simultaneous modular reduction and Kronecker substitution for small finite fields Dumas J., Fousse L., Salvy B. Journal of Symbolic Computation 46(7): 823-840, 2011. Type: Article
From the computer implementation point of view, polynomial arithmetic poses a challenge, though the underlying theory is fairly well understood. In this paper, the authors have presented several algorithms for doing modular polynomial ...
|
Jul 22 2011 |
|
New proofs of the Assmus-Mattson theorem based on the Terwilliger algebra Tanaka H. European Journal of Combinatorics 30(3): 736-746, 2009. Type: Article
The Assmus-Mattson theorem [1] provides a direct link between linear codes and designs. This paper describes new approaches to this theorem....
|
Jul 20 2009 |
|
Quantum computation of zeta functions of curves Kedlaya K. Computational Complexity 15(1): 1-19, 2006. Type: Article
Quantum computation presupposes that an extremely reliable probabilistic result found “logarithmically fast” by a quantum computer is in practice preferable to an accurate (but exponential time) result. The ...
|
Nov 22 2006 |
|
Concurrent error detection in a bit-parallel systolic multiplier for dual basis of GF(2m) Lee C., Chiou C., Lin J. Journal of Electronic Testing: Theory and Applications 21(5): 539-549, 2005. Type: Article
Efficient finite field arithmetic is important in a number of applications, including error correcting and cryptography. The most time-consuming finite field operation is multiplication, and, for this reason, it has received a consider...
|
Jun 12 2006 |
|
Efficient parallel exponentiation in GF(q) using normal basis representations Lee M., Kim Y., Park K., Cho Y. Journal of Algorithms 54(2): 205-221, 2005. Type: Article
Finite field arithmetic has important applications in cryptography and coding theory. In recent years, various efficient algorithms have been developed using the normal basis representation, where every element in GF...
|
Jul 26 2005 |
|
On the computation of square roots in finite fields Müller S. Designs, Codes and Cryptography 31(3): 301-312, 2004. Type: Article
The efficient computation of square roots in finite fields is a matter of considerable importance in cryptography, especially in methods relying on elliptic curves. This paper presents an improved Atkin method, and an improved Cipolla-...
|
Jul 28 2004 |
|
A digital analogue of the Jordan curve theorem Šlapal J. Discrete Applied Mathematics 139(1-3): 231-251, 2004. Type: Article
Digital topology is an important tool in computer graphics and image processing. Until the work of Khalimsky et al. in the early 1990s, it was mainly an ad hoc affair, using graph-theoretic techniques; Khalimsky and his coauthors, in t...
|
Jul 19 2004 |
|
A New Construction of Massey-Omura Parallel Multiplier over GF(2^{m}) Reyhani-Masoleh A., Hasan M. IEEE Transactions on Computers 51(5): 511-520, 2002. Type: Article
The authors identify a redundancy in the original parallel Massey-Omura multiplier algorithm for fields of finite order, a power of 2 that is defined by an irreducible polynomial. By removing this redundancy, they suggest a new archit...
|
Nov 25 2002 |
|
|
|
|
|
|