Zobrazeno 1 - 10
of 1 089
pro vyhledávání: '"discrete logarithm problem"'
Autor:
Suman Majumder, Sangram Ray, Dipanwita Sadhukhan, Mou Dasgupta, Ashok Kumar Das, Youngho Park
Publikováno v:
IEEE Open Journal of the Computer Society, Vol 5, Pp 329-342 (2024)
Radio Frequency Identification (RFID) promotes the fundamental tracking procedure of the Internet of Things (IoT) network due to its autonomous data collection as well as transfer incurring low costs. To overcome the insecure exchange of tracking dat
Externí odkaz:
https://doaj.org/article/67b663a2802640138047a5b43bf661d1
Autor:
Eman Abouelkheir, Shamia El-Sherbiny
Publikováno v:
IEEE Access, Vol 12, Pp 55918-55924 (2024)
Preserving the privacy of sensitive data such as mercantile, medical, political or financial might utilize encryption, these encrypted data, in some cases, may be needed to be decrypted by other party, for this issue, the dual receiver encryption, DR
Externí odkaz:
https://doaj.org/article/9aadfd3713564b41b07b620b031886e7
Autor:
Suman Majumder, Sangram Ray, Dipanwita Sadhukhan, Mou Dasgupta, Ashok Kumar Das, Youngho Park
Publikováno v:
IEEE Open Journal of the Communications Society, Vol 5, Pp 583-598 (2024)
Traditional voting systems mainly comprise of paper polling, electronic ballot system (EVM), mechanical devices, etc., and demand the physical presence of the voters. In the new age of digitization, the electronic voting system has come up with a uni
Externí odkaz:
https://doaj.org/article/893c828bf2ac430eac591149a9252d54
Publikováno v:
Cybersecurity, Vol 6, Iss 1, Pp 1-27 (2023)
Abstract The elliptic curve discrete logarithm problem (ECDLP) is a popular choice for cryptosystems due to its high level of security. However, with the advent of the extended Shor’s algorithm, there is concern that ECDLP may soon be vulnerable. W
Externí odkaz:
https://doaj.org/article/95e13729b237487fa7399b1280c091e2
Publikováno v:
Journal of Telecommunications and Information Technology, Vol 1, Iss 1 (2024)
This paper investigates how to reduce the elliptic curve discrete logarithm problem over prime fields to the quadratic unconstrained binary optimization (QUBO) problem in order to obtain as few logical qubits as possible. In the best case scenario, i
Externí odkaz:
https://doaj.org/article/e8152b5847b943b7939593c576759432
Publikováno v:
Information, Vol 15, Iss 5, p 282 (2024)
Security and efficiency remain a serious concern for Internet of Things (IoT) environments due to the resource-constrained nature and wireless communication. Traditional schemes are based on the main mathematical operations, including pairing, pairin
Externí odkaz:
https://doaj.org/article/9da3288183a24ff085285ee8e9a3e497
Publikováno v:
Journal of Cloud Computing: Advances, Systems and Applications, Vol 12, Iss 1, Pp 1-13 (2023)
Abstract Personal health record (PHR) is a medical model in which patients can upload their medical records and define the access control by themselves. Since the limited local storage and the development of cloud computing, many PHR services have be
Externí odkaz:
https://doaj.org/article/a3022f214ca74daaac3fcad46fbe7938
Autor:
Dmitriy N. Moldovyan
Publikováno v:
Computer Science Journal of Moldova, Vol 31, Iss 1(91), Pp 111-124 (2023)
The known designs of digital signature schemes with a hidden group, which use finite non-commutative algebras as algebraic support, are based on the computational complexity of the so-called hidden discrete logarithm problem. A similar design, used t
Externí odkaz:
https://doaj.org/article/c0e034fbc2014da9bfc046ccab04db9b
Autor:
Han Jiao, Zhuang Jincheng
Publikováno v:
Journal of Mathematical Cryptology, Vol 16, Iss 1, Pp 278-288 (2022)
The discrete logarithm problem (DLP) in semigroups has attracted some interests and serves as the foundation of many cryptographic schemes. In this work, we study algorithms and lower bounds for DLP in semigroups. First, we propose a variant of the d
Externí odkaz:
https://doaj.org/article/74c44e5eef4a4b14b7b72a733e101b07
Autor:
A.A. Moldovyan, N.A. Moldovyan
Publikováno v:
Computer Science Journal of Moldova, Vol 30, Iss 2(89), Pp 243-258 (2022)
A new form of the hidden discrete logarithm problem, called split logarithm problem, is introduced as primitive of practical post-quantum digital signature schemes, which is characterized in using two non-permutable elements $A$ and $B$ of a finite n
Externí odkaz:
https://doaj.org/article/fb626adb7a08455ea50dba477e91e227