Home A method for counting the number of polynomial equivalence classes
Article Open Access

A method for counting the number of polynomial equivalence classes

  • Tianze Wang EMAIL logo and Dongdai Lin
Published/Copyright: March 29, 2013
Download Article (PDF)
Become an author with De Gruyter Brill
Submit Manuscript Author Information
Journal of Mathematical Cryptology
From the journal Journal of Mathematical Cryptology Volume 7 Issue 1

Received: 2012-07-01
Revised: 2012-12-08
Accepted: 2013-02-08
Published Online: 2013-03-29
Published in Print: 2013-07-01

© 2013 by Walter de Gruyter Berlin Boston

Articles in the same Issue

  1. Masthead
  2. Oblivious evaluation of multivariate polynomials
  3. Self-pairings on hyperelliptic curves
  4. An efficient characterization of a family of hyper-bent functions with multiple trace terms
  5. A method for counting the number of polynomial equivalence classes
https://doi.org/10.1515/jmc-2012-0017
Keywords for this article
Enumerative problem; isomorphism of polynomials; equivalence class; multivariate public key cryptosystem
Creative Commons
BY-NC-ND 3.0

Articles in the same Issue

  1. Masthead
  2. Oblivious evaluation of multivariate polynomials
  3. Self-pairings on hyperelliptic curves
  4. An efficient characterization of a family of hyper-bent functions with multiple trace terms
  5. A method for counting the number of polynomial equivalence classes
Sign up now to receive a 20% welcome discount
Institutional Access
How does access work?
Have an idea on how to improve our website?
Please write us.
© 2025 De Gruyter Brill
Downloaded on 3.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/jmc-2012-0017/html
Scroll to top button