Tuan Nguyen Kim1,*, Duy Ho Ngoc2, Nikolay A. Moldovyan3
CMC-Computers, Materials & Continua, Vol.72, No.1, pp. 1105-1122, 2022, DOI:10.32604/cmc.2022.025653
- 24 February 2022
Abstract Digital signature schemes are often built based on the difficulty of the discrete logarithm problems, of the problem of factor analysis, of the problem of finding the roots modulo of large primes or a combination of the difficult problems mentioned above. In this paper, we use the new difficult problem, which is to find the root in the finite ground field to build representative collective signature schemes, but the chosen modulo p has a special structure distinct , where is an even number and are prime numbers of equal magnitude, about . The characteristics of the More >
Login
Register
