Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Cryptographic techniques and network security

Cryptographic techniques and network security

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IEE Proceedings F (Communications, Radar and Signal Processing) — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Electrical Engineers
Published

In the paper some of the cryptographic techniques, algorithms and applications in computer networks are reviewed. Symmetric and asymmetric cryptosystems, possible cryptanalytical attacks, cryptosecurity and the relevance of complexity theory to the security of ciphers are described. The major threats and counter-measures in computer-network communications are outlined. Finally, cryptographic applications and limitations in computer networks are examined.

Inspec keywords: cryptography; computer networks

Other keywords: cryptographic systems; ciphers; algorithms; cryptosystems; computer networks; cryptographic techniques; complexity theory; computer communications; network security; cryptography

Subjects: Control applications in data transmission; Computer networks and techniques; Computer communications; Codes

References

    1. 1)
      • N.J.A. Sloane . (1982) Encryption by random rotations, Cryptography.
    2. 2)
      • Friedman, W.: `Methods for the solution of running-key ciphers', Riverbank publ. 16, Riverbank Labs., 1918, Geneva.
    3. 3)
      • ‘Data encyption standard’, FIPS PUB 46, National bureau of standards, Washington, DC Jan. 1977.
    4. 4)
      • D. Denning . (1982) , Cryptography and data security.
    5. 5)
      • Shamir, A.: `On the cryptocomplexity of the knapsack system', Proc. 11th ACM Symposium on Theory of computing, 1979, p. 118–129.
    6. 6)
      • F. Kasiski . (1863) , Die geheim schriften und die dechiffrirkunst.
    7. 7)
      • Adleman, L.: `A subexponential algorithm for the discrete logarithm problem with applications to cryptography', Proc. 20th IEEE symposium on foundations of computer science, 1979, p. 55–60.
    8. 8)
      • F. Ayoub . Encryption with keyed random permutations. Electron. Lett. , 583 - 585
    9. 9)
      • Ayoub, F.: `Trapdoors, random structures and encryption functions design', IEE Colloquium on Techniques and implication of digital privacy and authentication systems, 1981, London.
    10. 10)
      • S.M. Matyas . Digital signatures—an overview. Computer networks , 87 - 94
    11. 11)
      • C. Meyer , S. Matyas . (1982) , Cryptography: a new dimension in computer data security.
    12. 12)
      • G. Brassard . A note on the complexity of cryptography. IEEE Trans. , 232 - 233
    13. 13)
      • R.S. Fabry . Capability based addressing. CACM , 403 - 412
    14. 14)
      • L. Hill . Cryptography in an algebraic alphabet. Am. Math. Monthly , 306 - 312
    15. 15)
      • A. Shamir . On the generation of cryptographically strong pseudo-random sequences. ACM Trans. Comput. Syst. , 38 - 44
    16. 16)
      • J.L. Smith . (1971) , The design of Lucifer, a cryptographic device for data communications.
    17. 17)
      • H. Beker , F. Piper . (1982) , Cipher systems.
    18. 18)
      • G. Vernam . Cipher printing telegraph systems for secret wire and radio telegraphic communications. J. AIEE , 109 - 115
    19. 19)
      • F. Ayoub . (1983) The design of complete encryption networks using cryptographically equivalent permutations, Computers and security.
    20. 20)
      • Davies, D.: `New techniques for cryptography in networks', Proc. European computing congress, 1978, p. 121–132.
    21. 21)
      • R.L. Rivest , A. Shamir , L. Adleman . A method for obtaning digital signatures and public-key cryptosystems. CACM , 120 - 126
    22. 22)
      • H. Beker , F. Piper . Communications security: a survey of cryptography. IEE Proc. A , 357 - 376
    23. 23)
      • J.A. Gordon , H. Retkin . (1982) Are big S-boxes best?, Cryptography.
    24. 24)
      • G.J. Simmons . Symmetric and asymmetric encryption. ACM Comput. Surveys , 305 - 330
    25. 25)
      • Rivest, R.: `The impact of technology on cryptography', Proc. IEEE International communications conference, June 1978, Toronto, Canada.
    26. 26)
      • C. Shannon . Communiction theory of secrecy systems. Bell Syst. Tech. J. , 656 - 715
    27. 27)
      • (1976) , An evaluation of the NBS data encryption standards.
    28. 28)
      • W. Diffie , M. Hellman . A critique of the proposed data encryption standard. CACM , 164 - 165
    29. 29)
      • C.A. Deavours . The black chamber: a column, how the british broke enigma. Cryptologia , 129 - 132
    30. 30)
      • M.E. Hellman . (1976) , Results of an initial attempt to cryptanalyse the NBS data encryption standard.
    31. 31)
      • S.R. Kimbleton , G.M. Schneider . Computer communications networks: approaches, objectives and performance considerations. ACM Comput. Surveys , 129 - 173
    32. 32)
      • F. Ayoub . Probabilistic completeness of substitution permutation encryption networks. IEE Proc E, Comput. & Digital Tech. , 195 - 199
    33. 33)
      • M.R. Garey , D.S. Johnson . (1979) , Computers and interactibility: a guide to the theory of NP-completeness.
    34. 34)
      • Kent, S.T.: `Encryption-based protection for interactive user/computer communication', Proc. fifth data communications Symposium, September 1977, p. 5-7–5-13.
    35. 35)
      • W. Diffie , M.E. Hellman . New directions in cryptography. IEEE Trans. , 644 - 654
    36. 36)
      • M. Perlam . (1976) , Generation of key in cryptographic system for secure communications.
    37. 37)
      • (1978) , The Beale ciphers.
    38. 38)
      • Cohen, E., Jefferson, D.: `Protection in the HYDRA operating system', Proc. 5th symposium on operating system principles, 1975, p. 141–160.
    39. 39)
      • M.V. Wilkes , R.M. Needham . (1979) , The cambridge CAP computer and its operating system.
    40. 40)
      • A.G. Konheim . (1981) , Cryptography: a primer.
    41. 41)
      • S.G. Akl . Digital signatures: a tutorial survey. IEEE computer , 15 - 24
    42. 42)
      • R.M. Needham , M.D. Schroeder . Using encryption for authentication in large networks of computers. CACM , 993 - 999
    43. 43)
      • G.B. Prudy . A high security log-in procedure. CACM , 442 - 445
    44. 44)
      • G. Chaitin . Information-theoretic computaional complexity. IEEE Trans. , 10 - 15
    45. 45)
      • Shamir, A.: `A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem', Proc. 23rd Ann. Symposium on Foundations of computer science, 1982, p. 145–152.
    46. 46)
      • McEliece, R.: `A public-key cryptosystem based on algebraic coding theory', DSN progress report, January–February 1978.
    47. 47)
      • Janardan, R.: `A public-key cryptosystem based on the matrix cover problem', Proc. Crypto 82, 1982, University of california.
    48. 48)
      • D. Davies . , Limits to computations.
    49. 49)
      • M.V. Wilkes . (1975) , Time sharing computer systems.
    50. 50)
      • W. Diffie , M. Hellman . Exhaustive cryptanalysis of the National Bureau of Standards proposed Data Encryption Standard. IEEE Comput , 74 - 84
    51. 51)
      • D. Davies . (1981) , Tutorial: the security of data in networks.
    52. 52)
      • D. Kahn . (1967) , The code breakers.
    53. 53)
      • D.E. Knuth . (1981) , The art of computer programming: semi-numerical algorithms.
    54. 54)
      • A. Evans , W. Kantrowitz , E. Weiss . A user authentication system not requiring secrecy in the computer. CACM , 437 - 442
    55. 55)
      • A. Turing . On computable numbers with an application to the Entschiedungs-problem. Proc. London Math. Soc. Ser. 2 , 230 - 265
    56. 56)
      • S.B. Herbert , R.L. Enison . Quasi-random number sequences from a long-period TLP generator (short note). ACM Comput. Surveys , 357 - 370
    57. 57)
      • G.J. Popek , C.S. Kline . Encryption and secure computer networks. ACM Comput. Surveys , 331 - 356
    58. 58)
      • L. Lamport . Password authentication with insecure communication. CACM , 770 - 772
    59. 59)
      • F. Ayoub . (1983) , On the design of SP-encryption networks.
    60. 60)
      • A. Lempel . Cryptology in transition. ACM Comput. Surveys , 285 - 303
    61. 61)
      • D. Denning , P.J. Denning . Data security. ACM Comput. Surveys , 227 - 250
    62. 62)
      • W. Diffie , M. Hellman . Privacy and authentication: an introduction to cryptography. Proc. IEEE , 397 - 427
    63. 63)
      • R. Morris , N.J.A. Sloane , A.D. Wyner . Assessment of the National Bureau of Standards proposed data encryption standard. Cryptologia , 281 - 291
    64. 64)
      • R.C. Merkle , M.E. Hellman . Hiding information and signatures in trapdoor knapsacks. IEEE Trans. , 525 - 530
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-f-1.1984.0103
Loading

Related content

content/journals/10.1049/ip-f-1.1984.0103
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address