Results 21 to 30 of about 15,305 (259)
, 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
Cryptanalysis of a Proposal Based on the Discrete Logarithm Problem Inside Sn
Cryptography, 2018 In 2008, Doliskani et al. proposed an ElGamal-style encryption scheme using the symmetric group Sn as mathematical platform. In 2012, an improvement of the cryptosystem’s memory requirements was suggested by Othman. The proposal by Doliskani et al.
María Isabel González Vasco +2 more
doaj +1 more source
The discrete logarithm problem modulo one: cryptanalysing the Ariffin–Abu cryptosystem
Journal of Mathematical Cryptology, 2010 The paper provides a cryptanalysis of the AAβ-cryptosystem recently proposed by Ariffin and Abu. The scheme is in essence a key agreement scheme whose security is based on a discrete logarithm problem in the infinite (additive) group ℝ/ℤ (the reals ...
Blackburn Simon R.
doaj +1 more source
Comparative Study of Digital Signature Standards Based on Discrete Logarithm [PDF]
Jisuanji gongcheng, 2016 As Chinese state encryption administration is seeking the next generation of Digital Signature Standard(DSS),this paper analyzes and compares seven DSS listed in ISO/IEC 14888-3 and SM2 which are based on Discrete Logarithm Problem(DLP) or Elliptic Curve
FENG Zeyu,GONG Boru,ZHAO Yunlei
doaj +1 more source
Finite fields and cryptology [PDF]
Computer Science Journal of Moldova, 2003 The problem of a computationally feasible method of finding the discrete logarithm in a (large) finite field is discussed, presenting the main algorithms in this direction.
Ennio Cortellini
doaj
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
Multi-message and Multi-receiver Hybrid Signcryption Scheme Based on Discrete Logarithm [PDF]
Jisuanji gongcheng, 2016 Existing multi-receiver signcryption schemes exist some security problems.For example,multi-message can not be broadcast simultaneously and the receivers do not have fairness in decryption.In order to avoid those problems,this paper proposes a multi ...
WANG Caifen,JIANG Hong,YANG Xiaodong,ZHANG Yulei,NIU Shufen
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
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
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