ElGamal Public-Key Cryptosystem in Multiplicative Groups of Quotient Rings of Polynomials over Finite Fields
A. N. El-Kassar, Ramzi A. Haraty (2005)
Computer Science and Information Systems
Similarity:
A. N. El-Kassar, Ramzi A. Haraty (2005)
Computer Science and Information Systems
Similarity:
Haukkanen, Pentti (2003)
International Journal of Mathematics and Mathematical Sciences
Similarity:
A. V. Efimov (1989)
Banach Center Publications
Similarity:
W. Narkiewicz (1967)
Colloquium Mathematicae
Similarity:
Drakakis, Konstantinos (2006)
Journal of Applied Mathematics
Similarity:
K. Nageswara Rao (1968)
Annales Polonici Mathematici
Similarity:
Jean-Loup Mauclaire (2005)
Acta Arithmetica
Similarity:
Vichian Laohakosol, Suphawan Janphaisaeng (2010)
Czechoslovak Mathematical Journal
Similarity:
A quasi-permutation polynomial is a polynomial which is a bijection from one subset of a finite field onto another with the same number of elements. This is a natural generalization of the familiar permutation polynomials. Basic properties of quasi-permutation polynomials are derived. General criteria for a quasi-permutation polynomial extending the well-known Hermite's criterion for permutation polynomials as well as a number of other criteria depending on the permuted domain and range...
Patrick Morton (1996)
Compositio Mathematica
Similarity:
Gennady Bachman (2003)
Acta Arithmetica
Similarity:
Haukkanen, Pentti (1996)
International Journal of Mathematics and Mathematical Sciences
Similarity: