Font Size:
On some properties of graph based public keys
Aneta Wroblewska
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.
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.
Full Text: PDF
This work is licensed under a Creative Commons Attribution 3.0 License.