Image Authentication Method Based on Phase Recovery and Elliptic Curve Digital Signature Algorithm
An elliptic curve and digital signature technology, applied in the field of information security, can solve problems such as optical information security system collisions, and achieve the effects of improving security, avoiding collision problems, and avoiding trusteeship problems
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Publication Date
- 2015-11-18
Smart Images
Figure 1 Figure 2 Figure 3
Abstract
Description
technical field
[0001] The invention relates to an image authentication method based on a phase recovery algorithm and an elliptic curve digital signature algorithm, and belongs to the technical field of information security. Background technique
[0002] In recent years, image encryption technology based on optical information processing has attracted widespread attention. Due to the natural advantages of optical information processing technology, such as parallel data processing capabilities, multi-dimensional coding freedom, and huge key space, it is considered by scholars from all over the world to be a new generation of information security technology.
[0003] As a typical optical information processing technology - phase recovery technology has become a very important research field, it is an important technology to solve the "inverse problem". With the deepening of research, its design idea has been widely used in other fields, for example, it has been widely used i...
Examples
Embodiment Construction
[0032] figure 1 The flow of authentication information generation in the present invention is given (only the authentication information generation flow of a single user is displayed, other users can generate authentication information according to the same flow), the authentication information generation process is as follows:
[0033] (1) The certification center generates and announces the parameters of the elliptic curve public key cryptosystem (E p (a,b),G,n):p is the specified finite field Z p A large prime number of , a and b are the elliptic curve y 2 ≡x 3 Coefficient of +ax+b(modp), G is the base point of the cyclic subgroup of points on the elliptic curve, and n is the order of the point G. In this embodiment, the secp160r1 elliptic curve on the prime number field recommended by StandardsforEfficientCryptography (SEC) and some simple parameters are selected. The parameters are:
[0034] Elliptic curve equation y 2 ≡x 3 +ax+b(modp)
[0035] p=FFFFFFFFFFFFFFFFF...