关键词: 一次一密, 有限域, 密钥交换, 公钥密码, 离散对数, 梅森素数

Abstract: This paper presents a feasible solution to the worldwide problem of implementing onetime encryption. The scheme uses a finite field key exchange algorithm (i.e., public key cryptography algorithm) with the order of Mersenne prime proposed by me. The sender and the receiver do not need to preallocate, transmit and store symmetric keys, but only require the sender and the receiver to disclose their public keys and keep their private keys secret. The private keys and related public keys are changed every time they communicate, which fully realizes the perfect confidentiality of one key at a time. The finite field public key cryptography algorithm with the order of Mersenne prime is based on modulo2 operation, which is convenient for software and hardware implementation. Theoretical analysis and computational simulation have proved its effectiveness, and it has a wide range of theoretical and practical application value.

Key words: onetime pad, finite field, key exchange, public key cryptology, discrete logarithms, Mersenne prime