Data Encryption Method Based on Double Difficulty

Abstract

Provided is a verifiable public key encryption method. The encryption method includes steps: initialization, encryption, and decryption. In terms of security, the method has a mathematics hypothesis with dual difficulties referring to factorization and Diffie-Hellman problem. In other words, an attacker has to simultaneously solve the mathematical problem of the two calculations if he wants to crack the encryption method. The encryption method is designed by partly employing the concept of the trapdoor one-way function, the method has semantic security and can resist chosen plaintext attack and chosen ciphertext attack, and good practical values are provided.

Description

technical field

[0001] The invention relates to the technical field of data encryption protection, in particular to a verifiable encryption method based on double difficulties. It is especially suitable for real-time encryption of data during mobile payment transactions. technical background

[0002] The security problem of mobile payment is a fatal problem faced by mobile e-commerce. The mobile payment process contains sensitive data such as information sent by mobile users to merchants and passwords sent by mobile users to banks. These data are related to the vital interests of users. , requiring higher confidentiality. However, there are many insecure factors in the mobile network, such as some people will use fake information or monitor personal information, so we need to establish a security mechanism to protect our secret information, and this mechanism is called cryptography technology, which mainly allows data to be stored on the network When uploading, it can ensu...

Images