نتایج جستجو برای: rao nam cryptosystem

تعداد نتایج: 16923  

Journal: :Groups Complexity Cryptology 2015
Vitalii Roman'kov

We propose a novel probabilistic public-key encryption, based on the RSA cryptosystem. We prove that in contrast to the (standardmodel) RSA cryptosystem each user can choose his own encryption exponent from a more extensive set of positive integers than it can be done by the creator of the concrete RSA cryptosystem who chooses and distributes encryption keys among all users. Moreover, we show t...

2017
Simon Ponthus Omar Kherad Nicole Petriccioli Johannes Alexander Lobrinus Pierre-André A Guerne

Necrotizing autoimmune myopathy (NAM) is a rare subgroup of idiopathic inflammatory myopathies (IIM). This pathology usually affects proximal limb muscles and in some cases the myocardium. Patients usually display proximal limb weakness. Muscular biopsy is required to confirm the diagnosis. We report the case of a 64-year-old woman with an atypical first presentation of NAM, manifested by chest...

2015
Paola A. Arias Rong Fu Maisa Rojas

the demise of the northern NAM and delays the reversal of the cross-equatorial flow over South America, reducing moisture transport to the SAM and delaying its onset. In addition, the thermodynamic response to warming appears to cause local drier land conditions over both regions, reinforcing the observed changes in these monsoons. Although previous studies have identified the isolated influenc...

Journal: :Informatica, Lith. Acad. Sci. 2003
Chou Chen Yang Ting Yi Chang Jian Wei Li Min-Shiang Hwang

In the generalized group-oriented cryptosystem, the sender can send a conditional message to a group of users such that only the specified sets of users in this group can cooperate to decrypt this message. In this paper, we will use an ElGamal cryptosystem and an elliptic curve ElGamal cryptosystem to achieve the purposes of generalization and group-orientation, respectively. Both of our scheme...

Journal: :Security and Communication Networks 2011
Mohsen Toorani Abolfazl Falahati

In this paper, it is proved that Lin et al.'s scheme that tried to strengthen the Hill cipher against the known-plaintext attack has several security flaws and is vulnerable to the chosenciphertext attack. This paper also introduces a secure and efficient symmetric cryptosystem based on affine transformation. The proposed cryptosystem includes an encryption algorithm that is an improved variant...

2007
Keita Xagawa Akinori Kawachi Keisuke Tanaka

We propose a lattice-based cryptosystem by modifying the Regev’05 cryptosystem (STOC 2005), and design a proof of secret-key knowledge. Lattice-based public-key identification schemes have already been proposed, however, it is unknown that their public keys can be used for the public keys of encryption schemes. Our modification admits the proof of knowledge on its secret key, however, we need a...

2016
Awani Upadhyay Aditya Pisupati Timothy Jegla Matt Crook Keith J Mickolajczyk Matthew Shorey Laura E Rohan Katherine A Billings Melissa M Rolls William O Hancock Wendy Hanna-Rose

TRPV ion channels are directly activated by sensory stimuli and participate in thermo-, mechano- and chemo-sensation. They are also hypothesized to respond to endogenous agonists that would modulate sensory responses. Here, we show that the nicotinamide (NAM) form of vitamin B3 is an agonist of a Caenorhabditis elegans TRPV channel. Using heterologous expression in Xenopus oocytes, we demonstra...

Journal: :CoRR 2018
Sam Safavi Bikash Joshi Guilherme França José Bento

The framework of Integral Quadratic Constraints (IQC) introduced by Lessard et al. (2014) reduces the computation of upper bounds on the convergence rate of several optimization algorithms to semi-definite programming (SDP). In particular, this technique was applied to Nesterov’s accelerated method (NAM). For quadratic functions, this SDP was explicitly solved leading to a new bound on the conv...

Journal: :IACR Cryptology ePrint Archive 2002
Fangguo Zhang Shengli Liu Kwangjo Kim

In ISC 2002, J. Zheng [8] proposed a new public key cryptosystem whose security is based upon the algebraic problem of reducing a high degree matrix to its canonical form by similarity transformations. In this paper, we show that factoring a polynomial over a finite field can be used to break down Zheng’s public key cryptosystem. The complexity of our attack is polynomial time. In other word, t...

2006
Matthieu Finiasz Serge Vaudenay

Inspired by fast correlation attacks on stream ciphers, we present a stream cipher-like construction for a public-key cryptosystem whose security relies on two problems: finding a low-weight multiple of a given polynomial and a Hidden Correlation problem. We obtain a weakly secure public-key cryptosystem we call TCHo (as for Trapdoor Cipher, Hardware Oriented). Using the Fujisaki-Okamoto constr...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید