Kefa Rabah
Department of Physics, Eastern Mediterranean University, Gazimagusa,
North Cyprus, via Mersin 10, Turkey
ABSTRACT
Since almost the beginning of time, it seems, man has had a need to keep information private and, in many situations, needed to decipher information previously made private by others. In our age of high technology these needs have grown exponentially and become more complex. Today, computer technology is on the verge of providing the ability for individuals and groups to communicate and interact with each other in a totally anonymous manner. Two persons may exchange messages, conduct business and negotiate electronic contracts without ever knowing the True Name, or legal identity, of the other. Interactions over networks will be untraceable, via extensive re-routing of encrypted packets and tamper-proof boxes which implement cryptographic protocols with nearly perfect assurance against any tampering. Reputations will be of central importance, far more important in dealings than even the credit ratings of today. These developments will alter completely the nature of government regulations: the ability to tax and control economic interactions, the ability to keep information secret and will even alter the nature of trust and reputation. All this will depend on how secure data can be moved from point-to-point from LAN to Global network data exchange. It is recognized that encryption (otherwise known as scrambling, enciphering or privacy transformation) represents the only means of protecting such data during transmission and, a useful means of protecting the content of data stored on various media, provided encryption of adequate strength can be devised and validated and is inherently integrable into network system architecture.
PDF References Citation
How to cite this article
Kefa Rabah, 2004. Data Security and Cryptographic Techniques: A Review. Information Technology Journal, 3: 106-132.
DOI: 10.3923/itj.2004.106.132
URL: https://scialert.net/abstract/?doi=itj.2004.106.132
DOI: 10.3923/itj.2004.106.132
URL: https://scialert.net/abstract/?doi=itj.2004.106.132
REFERENCES
- Smid, M.E. and D.K. Branstead, 1988. The data encryption standard: Past and future. Proc. IEEE, 76: 550-559.
Direct Link - Andleman, D. and J. Reeds, 1982. On the cryptanalysis of rotor machines and substitution-permutation networks. IEEE Trans. Inform. Thoer., 28: 578-584.
Direct Link - Bellovin, S.M. and M. Merritt, 1992. Encrypted key exchange: Password-based protocols secure against dictionary attacks. Proceedings of the IEEE Computer Society Symposium on Research in Security and Privacy, May 4-6, 1992, Washington, DC., USA., pp: 72-84.
Direct Link - Campbell, C., 1978. Design and specification of cryptographic capabilities. IEEE Commun. Magn., 16: 15-19.
Direct Link - Kocher, P.C., 1996. Timing attacks on implementations of Diffie-Hellman, RSA, DSS and Other systems. Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology, Aug. 18-22, Springer Verlag, London, UK., pp: 104-113.
Direct Link - Brown, L. and J. Seberry, 1990. On the deign of permutation in DES type cryptosystems. Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques on Advances in Cryptology, (WTACTAC'90), Springer Velag, New York, pp: 696-705.
Direct Link - Shannon, C.E., 1948. A mathematical theory of communication. Bell Syst. Tech. J., 27: 379-423.
Direct Link - Bellare, M. and P. Rogaway, 1994. Optimal asymmetric encryption. Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques, May 9-12, Perugia, Italy, pp: 92-111.
Direct Link - Pohlig, S. and M. Hellman, 1978. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans. Inform. Theory, 24: 106-110.
CrossRefDirect Link - Rivest, R.L., A. Shamir and L. Adleman, 1978. A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM., 21: 120-126.
CrossRefDirect Link - Pollard, J.M., 1974. Theorem on factorization and primality testing. Proc. Cambridge Philippines Soc., 76: 521-528.
Direct Link - Daemen, J., A. Bosselaers, R. Govaerts and J. Vandewalle, 1999. Collision for Schnorr`s hash function FFT-hash presented at crypto`91. Proceedings of the International Conference on the Theory and Applications of Cryptology: Advances in Cryptology, Nov. 11-14, Springer Verlag, London, pp: 477-480.
Direct Link