Results 41 to 50 of about 762,592 (290)
Molecular Oncology, EarlyView.This study identifies somatostatin receptor 4 (Sstr4) as a critical tumor suppressor against skin and head/neck cancers (HNSCC, cSCC, and BCC). The loss of Sstr4 removes a check on cell growth, causing hyperactivation of the MAPK‐ERK signaling pathway (↑).
Ali Taqvi +6 more
wiley +1 more source
Elliptic Curve Cryptosystem on the Base of Discrete Logarithm Generator [PDF]
, 1998 In this paper, we showed the theory of elliptic curve, discrete logarithm problem (DLD), elliptic curve discrete logarithm problem (EDLP), discrete logarithm generator and EIGamal cryptosystem and elliptic cryptosystem.
ODAKA, Tomohiro +7 more
core +1 more source
, 2010 V diplomskem delu obravnavamo problem diskretnega logaritma. Problem diskretnega logaritma je matematično-računski problem, ki služi kot osnova kriptografskim protokolom. Pri diskretnih logaritmih operiramo znotraj multiplikativne grupe G. Problem od nas
Petelinek, Barbara
core
Engineering IL‐4 resistant proinflammatory human myeloid cells for cancer immunotherapy
Molecular Oncology, EarlyView.We developed a scalable workflow to generate proinflammatory human myeloid cells. CRISPR/Cas9‐edited CD34+ hematopoietic stem and progenitor cells were expanded and differentiated with M‐CSF. Deletion of STAT6 or STAT6/NFKB1 enhanced macrophage proinflammatory gene expression and cytokine secretion in the presence of IL‐4 while maintaining antibody ...
Theresa Barberi, Alan D. Friedman
wiley +1 more source
Solution to the Problem of Calculating Discrete Logarithms [PDF]
Military Technology and ScienceIn 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
Computation of discrete logarithms in prime fields [PDF]
Designs, Codes and Cryptography, 1991 Let \(p\) be a prime and \(g\), \(x\) integers. The computation of \(y\) such that \(y\equiv g^ x(\mod p)\), \(0\leq y\leq p-1\), is referred to as discrete exponentiation. Given \(p\), \(g\) and \(y\) the computation of \(x\) is referred to as the discrete logarithm problem.
Brian A. LaMacchia, Andrew M. Odlyzko
openaire +2 more sources
Constructing Identity-Based Cryptosystems for Discrete Logarithm Based Cryptosystems [PDF]
, 2012 [[abstract]]In 1984, Shamir proposed the concept of the Identity-Based (ID-Based) cryptosystem. Instead of generating and publishing a public key for each user, the ID-Based scheme permits each user to choose his name or network address as his public key.
廖冠捷;Liao, Kuan-Chieh
core
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective We aim to comprehensively analyze how regional tumor and edema characteristics are associated with clinical presentations and survival outcomes in a large cohort of glioblastoma patients. Methods Patients with IDH‐wildtype glioblastoma who received brain MRI from 2010 to 2023 were included.
Daniel J. Zhou +16 more
wiley +1 more source
Picard Groups and Refined Discrete Logarithms [PDF]
LMS Journal of Computation and Mathematics, 2005 AbstractLet K denote a number field, and G a finite abelian group. The ring of algebraic integers in K is denoted in this paper by $/cal{O}_K$, and $/cal{A}$ denotes any $/cal{O}_K$-order in K[G]. The paper describes an algorithm that explicitly computes the Picard group Pic($/cal{A}$), and solves the corresponding (refined) discrete logarithm problem.
Werner Bley, Markus Endres
openaire +3 more sources
Security of discrete log cryptosystems in the random oracle and the generic model [PDF]
, 1999 We introduce novel security proofs that use combinatorial counting arguments rather than reductions to the discrete logarithm or to the Diffie-Hellman problem. Our security results are sharp and clean with no polynomial reduction times involved.
Jakobsson, Markus, Schnorr, Claus Peter
core