By Topic

Complexity measure of encryption keys used for securing computer networks

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

2 Author(s)
M. A. Bahie-Eldin ; Egyptian Armed Forces, Egypt ; A. A. Omar

The best way to secure and to obtain safe electronic payment systems through computer networks is with encryption. The strength of the encryption technique is mainly depending upon the encryption key. One of the basic criteria to evaluate the strength of the key is the complexity measure. In this paper, the Ziv-Lempel (1976) complexity for binary random sequences, as well as for finite sequences employed to generate the encryption keys, is examined. The complexity versus the sequence length is investigated, and a comparison with the lower bound is carried out. The obtained results show many interesting points. First, the random sequence satisfies the lower bound for all different lengths. Second, the Ziv-Lempel complexity for linear feedback shift register (LFSR) sequences depends on both the initial condition and on the characteristic polynomial of the LFSR. Third, the complexity depends on the length of the sequence

Published in:

Computer Security Applications Conference, 1998. Proceedings. 14th Annual

Date of Conference:

7-11 Dec 1998