By Topic

The existence of good cryptosystems for key rates greater than the message redundancy (Corresp.)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

A general result related to Shannon's "random" cipher result is presented. By using the Fano inequality it is shown that the average probability of correct decryptment of a message digit is bounded away from one when the key rate is greater than the message redundancy for a given class of cryptosystems.

Published in:

IEEE Transactions on Information Theory  (Volume:25 ,  Issue: 4 )