Strongly asymmetric PKD cryptographic algorithms: an implementation using the matrix model

This work follows the paper of the authors: Strongly asymmetric PKD cryptographic algorithms, which in- troduces a whole family of algorithms for key exchange (the double - parametrization algorithm), and here we discuss pos- sible con guration of a particular case (a model) of this fam- ily. We decided, here, to verify the implementation of the model based on matrices. The approach will be discussed in the following. Moreover we will show the problems encountered and re- solved in the nal implementation and the technical issues.