| 摘要 |
The invention relates to an authentication and identification method that, on the one hand, uses different codes (7, 8) for the prover (1) and the verifier (2) and, on the other hand, forgoes the use of long-number modulo arithmetic by using simple basic components such as arithmetic operations in finite bodies GF(2<n>). A private code (7) is stored in the prover (1) so that the prover can be receive, in an encrypted manner, data elements (9), which are generated as random elements, and can itself be used once again as a code for an authentication method of a data set (10) to be transmitted. The verifier (2) receives the authenticator (11) formed in such a manner and verifies it. If the data set is generated by the verifier (2) and sent to the prover (1), the inventive method can serve to identify the prover (1). This method is particularly advantageous in the area of chip cards due to the fact that the space required thereon can be considerably reduced for the implementation of hardware. |
