Results 31 to 40 of about 559 (211)

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., Dudeanu Alina, Jetchev Dimitar   +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

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, Eduardo García‐Galea, Alice O'Farrell, Zak Kinsella, Maxime Meylan, Florent Petitprez, Ingrid Arijs, Tom Venken, Hari Ps, Adrian Lärkeryd, Ian Miller, Janick Selves, Nadja Meindl‐Beinker, Fiorella Ruiz‐Pace, Elena Élez, Raquel Comas‐Navarro, Frank Lincoln, Dirk Fey, Gift Nyamundanda, Aoife Nolan, Joern Lewin, Raquel Perez‐Lopez, Jonathan Briody, Kathleen Bennett, Walter Kolch, David Matallanas, Alexander Kel, Enrique Arenas, Joaquín Arribas, Bart Ghesquière, Josep Tabernero, Julie Meilleroux, Deborah McNamara, Ray McDermott, Marvin Lim, Mary O'Reilly, Brian Bird, Lisa Stack, Lucia Moloney, Patrick Morris, Keith Egan, Maciej Milewski, Lars Scheuer, Joachim Behringer, Georg Bolz, Ramon Salazar, Cristina Santos, Andrea Ruiz, Orla Casey, Verena Murphy, Matthias Ebert, Livio Trusolino, Diether Lambrechts, Anguraj Sadanandam, Catherine Sautès‐Fridman, Jochen Prehn, Paolo Nuciforo, Jacques Fieschi, Florence Monville, Darran O'Connor, Wolf Fridman, Annette Byrne   +61 more
wiley   +1 more source

Solution to the Problem of Calculating Discrete Logarithms [PDF]

Military Technology and Science
In this paper we present two algorithms for computing discrete logarithms. We also introduce theorems that facilitate computing discrete logarithms and show how we break the Diffie-Hellman protocol, which is considered to be very secure.
Łukasz Matysiak
doaj   +1 more source

Discrete Logarithms

, 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

Developmental programmes drive cellular plasticity, disease progression and therapy resistance in lung adenocarcinoma

Molecular Oncology, EarlyView.
This study shows that lung adenocarcinomas exploit developmental branching morphogenesis to acquire a therapy resistant basal‐like tumour cell state. This process was found to be regulated by combined TP53 loss‐of‐function and type‐I interferon signalling, identifying a novel axis for biomarker and therapeutic target discovery.
Kamila J Bienkowska, Stephany Gallardo, Nur S. Zainal, Leena Arora, Matthew Ellis, Maria‐Antoinette Lopez, Judith Austine, Sai Pittla, Serena J Chee, Aiman Alzetani, Emily C Shaw, Christian H Ottensmeier, Gareth J Thomas, Christopher J Hanley   +13 more
wiley   +1 more source

Pairing-Free for Public Key Encryption With Equality Test Scheme

IEEE Access, 2021
The modular exponentiation has been proved better in terms of computational efficiency as compared to bilinear pairing. Therefore, discrete logarithm, a concept of modular exponentiation may be incorporated to present improved security schemes. With this
Huijun Zhu, Licheng Wang, Haseeb Ahmad, Dong Xie   +3 more
doaj   +1 more source

Discrete Logarithm Variants of VSH [PDF]

, 2006
Recent attacks on standardised hash functions such as SHA1 have reawakened interest in design strategies based on techniques common in provable security. In presenting the VSH hash function, a design based on RSA-like modular exponentiation, the authors introduce VSH-DL, a design based on exponentiation in DLP-based groups. In this article we explore a
Lenstra, Arjen, Page, Daniel, Stam, Martijn   +2 more
openaire   +1 more source

Analysing the significance of small conformational changes and low occupancy states in serial crystallographic data

FEBS Open Bio, EarlyView.
This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill, Yelyzaveta Pulnova, Elke De Zitter, Helen M. Ginn, Briony A. Yorke   +4 more
wiley   +1 more source

Asymmetric cipher protocol using conjugacy and discrete logarithm problem

Lietuvos Matematikos Rinkinys, 2009
The paper proposes asymmetric cipher protocol based on matrix field over some field F. The asymmetric cipher is based on two simultaneous problems: matrix conjugator search problem (MCSP) and matrix discrete logarithm problem (MDLP).
Andrius Raulynaitis, Agnė Venclovienė   +1 more
doaj   +1 more source