Results 31 to 40 of about 3,524 (301)
Research Progress and Prospect of Ring Signatures [PDF]
Jisuanji kexue yu tansuo, 2023 As a special group signature, ring signature has been widely used in anonymous voting, anonymous deposit and anonymous transaction because it can not only complete the signature without the cooperation of ring members, but also ensure the anonymity of ...
XIE Jia, LIU Shizhao, WANG Lu, GAO Juntao, WANG Baocang
doaj +1 more source
An Efficient Collision Detection Method for Computing Discrete Logarithms with Pollard's Rho
Journal of Applied Mathematics, 2012 Pollard's rho method and its parallelized variant are at present known as the best generic algorithms for computing discrete logarithms. However, when we compute discrete logarithms in cyclic groups of large orders using Pollard's rho method, collision ...
Ping Wang, Fangguo Zhang
doaj +1 more source
IEEE Access, 2023 Attribute-based encryption is a valuable technique for ensuring data privacy and confidentiality in the realm of cloud computing. Using this cryptographic primitive, the data owner can securely store and share data within the cloud environment.
Vahid Yousefipoor, Taraneh Eghlidos
doaj +1 more source
IACR Communications in CryptologyThe Number Field Sieve and its variants are the best algorithms to solve the discrete logarithm problem in finite fields (except for the weak small characteristic case). The Factory variant accelerates the computation when several prime fields are targeted.
Haetham Al Aswad +2 more
openaire +3 more sources
Traps to the BGJT-algorithm for discrete logarithms [PDF]
LMS Journal of Computation and Mathematics, 2014 AbstractIn the recent breakthrough paper by Barbulescu, Gaudry, Joux and Thomé, a quasi-polynomial time algorithm is proposed for the discrete logarithm problem over finite fields of small characteristic. The time complexity analysis of the algorithm is based on several heuristics presented in their paper.
Qi Cheng 0001 +2 more
openaire +5 more sources
Analisa Kombinasi Algoritma Merkle-Hellman Knapscak dan Logaritma Diskrit pada Aplikasi Chat
Jurnal Teknologi Informasi dan Ilmu Komputer, 2018 Informasi melalui jaringan internet sangat rentan terhadap penyadapan oleh pihak yang tidak bertanggung jawab. Agar informasi tersebut aman, maka dibutuhkan teknik kriptografi untuk melindungi dan mengamankan informasi tersebut.
Aminudin Aminudin +2 more
doaj +1 more source
Implementation and Security Test of Zero-Knowledge Protocols on SSI Blockchain
Applied Sciences, 2023 The problem of digital identity acquires more relevance every day in the eyes of a society that spends more and more time connected to the Internet. It has evolved throughout its history to reach a decentralized model known as Self-Sovereign Identity ...
Cristina Vilchez Moya +3 more
doaj +1 more source
, 2017 The Discrete Logarithm Problem (DLP) is one of the most used mathematical problems in asymmetric cryptography design, the other one being the integer factorization. It is intrinsically related to the Diffie-Hellman problem (DHP). DLP can be stated in various groups. It must be hard in well-chosen groups, so that secure-enough cryptosystems can be built.
Guillevic, Aurore, Morain, François
openaire +2 more sources
Molecular Oncology, EarlyView.Tumors contain diverse cellular states whose behavior is shaped by context‐dependent gene coordination. By comparing gene–gene relationships across biological contexts, we identify adaptive transcriptional modules that reorganize into distinct vulnerability axes.
Brian Nelson +9 more
wiley +1 more source
Minimizing CNOT-count in quantum circuit of the extended Shor’s algorithm for ECDLP
Cybersecurity, 2023 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.
Xia Liu, Huan Yang, Li Yang
doaj +1 more source