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

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

Journal: :RFC 2009
T. Charles Clancy Hannes Tschofenig

Status of This Memo This document specifies an Internet standards track protocol for the Internet community, and requests discussion and suggestions for improvements. Please refer to the current edition of the "Internet Official Protocol Standards" (STD 1) for the standardization state and status of this protocol. Distribution of this memo is unlimited. Abstract This memo defines an Extensible ...

Journal: :IJCNIS 2009
Faezah Jasman Sabira Khatun

The goal for the fourth generation (4G) of mobile communications system is to seamlessly integrate a wide variety of communication services such as high speed data, video and multimedia traffic as well as voice signals. One of the promising approaches to 4G is adaptive OFDM (AOFDM). In AOFDM, adaptive transmission scheme is employed according to channel fading condition with OFDM to improve the...

Journal: :Computer Communications 2007
Jang-Ping Sheu Jui-Che Cheng

When sensor networks deployed in unattended and hostile environments, for securing communication between sensors, secret keys must be established between them. Many key establishment schemes have been proposed for large scale sensor networks. In these schemes, each sensor shares a secret key with its neighbors via preinstalled keys. But it may occur that two end nodes which do not share a key w...

2000
Dan Boneh Antoine Joux Phong Q. Nguyen

We present an attack on plain ElGamal and plain RSA encryption. The attack shows that without proper preprocessing of the plaintexts, both ElGamal and RSA encryption are fundamentally insecure. Namely, when one uses these systems to encrypt a (short) secret key of a symmetric cipher it is often possible to recover the secret key from the ciphertext. Our results demonstrate that preprocessing me...

Journal: :IEEE Trans. Signal Processing 1998
Fulvio Gini Georgios B. Giannakis

Incoherent detection based on differential encoding has been successfully applied to phase-shift-keying (PSK) signals because it eliminates the need for carrier phase acquisition and tracking at the receiver. This paper generalizes the idea of differential encoding by using a nonlinear transformation called multilag high-order instantaneous moment (ml-HIM). The ml-HIM decoder is capable of remo...

Journal: :CoRR 2010
Shiro Ikeda Kazunori Hayashi Toshiyuki Tanaka

A practical communication channel often suffers from constraints on input other than the average power, such as the peak power constraint. In order to compare achievable rates with different constellations as well as the channel capacity under such constraints, it is crucial to take these constraints into consideration properly. In this paper, we propose a direct approach to compare the achieva...

Journal: :IEEE Journal on Selected Areas in Communications 2001
Eui-Rim Jeong Ginkyu Choi Yong Hoon Lee

A new data-aided frequency estimator is introduced for phase-shift keying signals transmitted over frequency-selective fading channels. This estimator is developed based on a maximum likelihood criterion. It assumes the use of a special class of pilots, called near-i.i.d. (independent identically distributed) sequences, with impulsive fourth-order moments. By the help of such pilots, the propos...

Journal: :IEEE Trans. Communications 2003
Johan Lassing Erik G. Ström Erik Agrell Tony Ottosson

The problem of calculating the average bit-error probability (BEP) of coherent -ary phase-shift keying (PSK) over a Gaussian channel has been studied previously in the literature. A solution to the problem for systems using a binary reflected Gray code (BRGC) to map bits to symbols was first presented by Lee. In this letter, we show that the results obtained by Lee are incorrect for 16. We show...

2008
Seny Kamara Jonathan Katz

Chosen-plaintext attacks on private-key encryption schemes are currently modeled by giving an adversary access to an oracle that encrypts a given message m using random coins that are generated uniformly at random and independently of anything else. This leaves open the possibility of attacks in case the random coins are poorly generated (e.g., using a faulty random number generator), or are un...

2002
John Black Phillip Rogaway Thomas Shrimpton

Encryption that is only semantically secure should not be used on messages that depend on the underlying secret key; all bets are off when, for example, one encrypts using a shared key K the value K. Here we introduce a new notion of security, KDM security, appropriate for key-dependent messages. The notion makes sense in both the public-key and shared-key settings. For the latter we show that ...

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

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