On multivariate homogeneous polynomial decomposition

Authors:
Paula Bustillo;Jaime Gutierrez
Affiliations:
Universidad de Cantabria, Santander, Spain;Universidad de Cantabria, Santander, Spain
Venue:
CASC'10 Proceedings of the 12th international conference on Computer algebra in scientific computing
Year:
2010

Citing 5
Cited 0

Public quadratic polynomial-tuples for efficient signature-verification and message-encryption

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Asymmetric cryptography with S-Boxes

ICICS '97 Proceedings of the First International Conference on Information and Communication Security
High order derivatives and decomposition of multivariate polynomials

Proceedings of the 2009 international symposium on Symbolic and algebraic computation
The number of decomposable univariate polynomials. extended abstract

Proceedings of the 2009 international symposium on Symbolic and algebraic computation
An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

An algorithm for decomposing a list of homogeneous polynomials in several variables of the same degree was given in [2]. We show that there is a bijective relation among these decompositions and intermediate K-algebras of a special kind, but the relation cannot be extended to intermediate fields. We also try to find the dimension of the decomposable lists over an algebraically closed field.