CONTEXT

The process cryptographic authentication is the most common being based on the RSA algorithm.

However, in the RSA algorithm, it is necessary to calculate on very large integers, including calculations of discrete exponentials. Such calculations can be slo

TECHNICAL DESCRIPTION

The method involves decoding of error correcting code from a public matrix (H) e.g. quasi-cyclic matrix, where the public matrix includes K row and 2 K columns and is a juxtaposition of a size identity block Kx K, and of a size circulating block Kx K. A circulating square block is defined by a vector of random size K, where the circulating block is composed of binary data and the number K is equal to 317. The quasi-cyclic matrix is used in a Stern protocol or Veron protocol.

BENEFITS

The method can be implemented easily in the cryptographic device at low cost with limited capacities of calculation and/or storage. The method reduces the quantity of public data to be stored in the method using decoding of the error correcting code from the public matrix, and utilizes the random matrices for fast calculations in the cryptographic device. The method provides the public matrix compatible with the protocol decoded by Stern syndrome, and dual protocol decoded by Stern syndrome.

INDUSTRIAL APPLICATIONS

This cryptographic authentication method can be used in a cryptographic device of a smart card.