Results 21 to 30 of about 3,908 (312)
, 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
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
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
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
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
Individual discrete logarithm with sublattice reduction
Designs, Codes and Cryptography, 2023 Designs, Codes and Cryptography ...
Al Aswad, Haetham, Pierrot, Cécile
openaire +4 more sources
Interrogating the immune landscape of microsatellite stable RAS‐mutated colon cancer
Molecular Oncology, EarlyView.COLOSSUS project RAS‐mutated MSS colon cancer study explored transcriptomics and immune cell density by immunohistochemistry (IHC), Immunoscore (IS), ISIC/TuLIS scores, mutation counts, and detected different prevalences but similar microenvironment composition across immune markers with clinical relevance for future immunotherapy combination ...
Rodrigo Dienstmann +61 more
wiley +1 more source
Collision bounds for the additive Pollard rho algorithm for solving discrete logarithms
Journal of Mathematical Cryptology, 2014 We prove collision bounds for the Pollard rho algorithm to solve the discrete logarithm problem in a general cyclic group 𝐆$\mathbf {G}$. Unlike the setting studied by Kim et al., we consider additive walks: the setting used in practice to solve the ...
Bos Joppe W. +2 more
doaj +1 more source
FEBS Open Bio, EarlyView.KLK7, a tissue kallikrein‐related peptidase, is elevated in advanced colorectal cancer and associated with shorter survival. High KLK7 levels in ascites correlate with peritoneal metastasis. In mice, KLK7 overexpression increases metastasis. In vitro, KLK7 enhances cancer cell proliferation, migration, adhesion, and spheroid formation, driving ...
Yosr Z. Haffani +6 more
wiley +1 more source