Open AccessConstructing Collective Signature Schemes Using Problem of Finding Roots Modulo
Author(s) -
Tuan Nguyen Kim,
Duy Ho Ngoc,
Nikolay A. Moldovyan
Publication year - 2022
Publication title -
computers, materials and continua/computers, materials and continua (print)
Language(s) - English
Resource type - Journals
eISSN - 1546-2226
pISSN - 1546-2218
DOI - 10.32604/cmc.2022.025653
Subject(s) - modulo , discrete logarithm , signature (topology) , public key cryptography , mathematics , key (lock) , prime (order theory) , blind signature , set (abstract data type) , cryptography , theoretical computer science , field (mathematics) , digital signature , group signature , computer science , discrete mathematics , algorithm , pure mathematics , combinatorics , computer security , encryption , geometry , programming language , hash function
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom