A Novel Mathematical Formal Proof in Zhang-Wang's Cryptographic Algorithm

Main Article Content

Junwei Yang, Xiangkun Tong, Chenglian Liu, Sonia C-I Chen

Abstract

Formal verification is to use mathematical methods to prove that our scheme is correct. This scheme is just a pronoun. It may be expressed as a hardware, a software or an algorithm. Errors in hardware are more difficult to modify than errors in software, so formal proofs and inspections often appear in the argument for hardware design. But, it does not mean that the software does not need to be formally verified. In addition to digital circuits or combinational circuits, cryptographic protocols also need to be formally verified. Formal proof can only ensure whether the result of logical inference is consistent with the previous stage, and can not guarantee whether there are defects in the process of logical inference. In this article the authors take as an example of Zhang-Wang's digital signature algorithm, and point out two formal proof methods of Boolean algebra and Galois field respectively.

Article Details

How to Cite
Sonia C-I Chen, . J. Y. X. T. C. L. . (2021). A Novel Mathematical Formal Proof in Zhang-Wang’s Cryptographic Algorithm. CONVERTER, 449-458. https://doi.org/10.17762/converter.143
Section
Articles