ON SOME PROPERTIES OF GRAPH BASED PUBLIC KEYS

Abstract

In this paper we will evaluate degrees of nonlinear polynomial encryption transformation in $F_q^n$, which was defined in [11] in terms of the walk on the graph with vertex set $F_q^n\cup F_g^n$. Independently from the length of the walk, this transformation has degree $3$. It means that public user can do the encryption process in polynomial time.