A shared key generation method, and an information processing terminal

Abstract

The invention relates to a shared key generation method, and an information processing terminal. The information processing terminal generates a shared key by a public key cryptosystem using an identifier. The information processing terminal calculates a first calculation value by using an algorithm that outputs an element on an extension field of a prime field from two points on an additive cyclic group on an elliptic curve that is defined by the prime field. The information processing terminal holds the first calculation value. The information processing terminal calculates a second calculation value from a variable using an identifier of a sharer that shares the shared key, a private key of the information processing terminal, and the algorithm. The information processing terminal generates the shared key by executing a final exponentiation to each of the exponentiation of the first calculation value and the second calculation value.

Description

Technical field [0001] The embodiments discussed herein relate to a computer-readable recording medium, a shared key generation method, and an information processing terminal. Background technique [0002] With the development and popularization of technologies related to calculators and networks, opportunities to exchange important data via wireless communication networks, the Internet, and the like have increased. Since it is relatively easy to eavesdrop, forge, or deceive communication paths in wireless communication networks and the Internet, in order to maintain security, the need for authentication of communication partners and the need for cryptographic communication technology based on authentication to protect communication content are increased. The widely used cryptographic communication technologies include Transport Layer Security (TLS) that employs various public key cryptographic techniques. [0003] As an example of such a public key cryptographic technique, an ide...

AI Technical Summary

Problems solved by technology

However, the corresponding calculation is performed by using a multiplication operation or a square operation, and thus the calculation cost is large

When using the Barreto-Naehrig curve (BN curve) (256 bits), which is currently widely used, in the case of the Miller algorithm in the pairing function and the final exponentiation operation, the number of executions of the square operation is 318 in total and the number of times of the multiplication operation is The total number of executions is 193, and thus computationally expensive

Images