Results 31 to 40 of about 762,592 (290)
Discrete Logarithm Based Protocols [PDF]
, 2007 The Exponential Security System (TESS) developed at the European Institute for System Security is the result of an attempt to increase the security in heterogenous computer networks. In this paper we present the cryptographic protocols in the kernel of TESS.
Horster, Patrick, Knobloch, Hans-Joachim
openaire +1 more source
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
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
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
Small generic hardcore subsets for the discrete logarithm : short secret DL-keys [PDF]
, 2000 Let G be a group of prime order q with generator g. We study hardcore subsets H is include in G of the discrete logarithm (DL) log g in the model of generic algorithms.
Schnorr, Claus Peter, C P Schnorr
core
Ligand‐dependent transcriptional heterogeneity in cell cycle gene expression delays G1/S entry
FEBS Letters, EarlyView.EGF and HRG induce distinct G1/S progression programs in ErbB2‐amplified BT474 breast cancer cells. Despite activating the potent ErbB2–ErbB3 heterodimer, HRG does not accelerate cell‐cycle entry. Instead, EGF promotes earlier restriction‐point passage via ERK–FOS signaling, whereas HRG activates the AKT–MYC axis, driving transcriptional heterogeneity ...
Ririn Rahmala Febri +5 more
wiley +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
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 +13 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
Security of almost ALL discrete log bits [PDF]
, 2005 Let G be a finite cyclic group with generator \alpha and with an encoding so that multiplication is computable in polynomial time. We study the security of bits of the discrete log x when given \exp_{\alpha}(x), assuming that the exponentiation function \
Schnorr, Claus Peter
core