نتایج جستجو برای: random key representation

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

Journal: :Journal of Computer and System Sciences 2011

Journal: :Electronic Communications in Probability 2002

Journal: :Progress of Theoretical Physics Supplement 2003

Journal: :Journal of Nonlinear Mathematical Physics 1998

2007
Dimitar Jetchev Ramarathnam Venkatesan

We prove that if one can predict the least significant bit of the Diffie–Hellman secret keys for elliptic curves with non-negligible advantage on a polynomial fraction of all curves over a given finite field Fp, then one can compute the entire Diffie–Hellman secret on a polynomial fraction of all curves over the same finite field. Our method combines rapid mixing properties of certain isogeny g...

2006
Jin Li Fangguo Zhang Yanming Wang

Key-insulated cryptosystem was proposed in order to minimize the damage of secret key exposure. In this paper, we propose a strong identity based (ID-based) key-insulated cryptosystem security model, including ID-based key-insulated encryption (IB-KIE) security model and ID-based key-insulated signature (IB-KIS) security model. Based on the security models, provably secure strong IB-KIE and IBK...

Abbas Nowzari-Dalini Javad Mohammadzadeh, Mohammad Ganjtabesh,

Background: RNA plays key role in many aspects of biological processes and its tertiary structure is critical for its biological function. RNA secondary structure represents various significant portions of RNA tertiary structure. Since the biological function of RNA is concluded indirectly from its primary structure, it would be important to analyze the relations between the RNA sequences and t...

2010
Osman Yagan Armand Makowski Osman Yağan Armand M. Makowski

The pairwise key distribution scheme of Chan et al. was proposed as an alternative to the key distribution scheme of Eschenauer and Gligor to enable network security in wireless sensor networks. We consider the random graph induced by this pairwise scheme under the assumption of full visibility, and show the existence of a zero-one law for graph connectivity.

2012
Chuah Chai Wen Ed Dawson Juan Manuel González Nieto Leonie Ruth Simpson

This paper presents a comprehensive formal security framework for key derivation functions (KDF). The major security goal for a KDF is to produce cryptographic keys from a private seed value where the derived cryptographic keys are indistinguishable from random binary strings. We form a framework of five security models for KDFs. This consists of four security models that we propose: Known Publ...

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

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