Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
International Journal of Computer and Information Sciences, Vol. 12, No. 4, 1983 Computationally Efficient Algorithms
 

Summary: International Journal of Computer and Information Sciences, Vol. 12, No. 4, 1983
Computationally Efficient Algorithms
for a One-Time Pad Scheme
A. G. Akritas, 1 S. S. lyengar, 2 and A. A. Rampuria 3
Received November 1982; revised June 1983
The use of cryptography for data protection has received a great deal of
attention in recent years. This paper presents computationally efficient
algorithms for the implementation of a one-time pad scheme. The algorithms to
encipher and decipher text were implementedon a PDP-I 1 computer using the
programming language C. To study the behavior of the keys used to encipher
and decipher text, we used the chi-square method, and the test results of two
runs are presented with some statistical analysis.
KEY WORDS: Cryptography; ciphers; security; algorithms; data protection;
cryptology; one-time pads.
1. INTRODUCTION
The use of cryptography for data protection has received a great deal of
attention in recent years (see, e.g., Refs. 7-10 and 17). In today's complex
society, as the need for fast electronic communication has grown, so has the
need to secure the information being communicated. Furthermore, interest in
cryptography is expected to rise with increasing use of the electronic fund

  

Source: Akritas, Alkiviadis G. - Department of Computer and Communication Engineering, University of Thessaly

 

Collections: Computer Technologies and Information Sciences