Skip to main content
Log in

A concurrent solution to computer security

  • Published:
Artificial Intelligence Review Aims and scope Submit manuscript

Abstract

This paper illustrates methods by which parallel processing may be used to construct computer systems that offer a much higher level of security than at present. As an example, the problem of devising a secure network login protocol is considered. Such protocols exist, but are not widely used, because the algorithms require calculations involving large integers and these are computationally expensive. Some of the ways in which concurrent programming techniques may be used to ‘speed up’ the execution of such protocols are discussed and it is shown how it would be cost-effective to add parallel ‘accelerator’ boards to a computer system for the purpose of executing such algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • D. Chaum, J. Evertse, J. van de Graaf and R. Peralta (1986) Demonstrating possession of a discrete logarithm without revealing it, Proc. Crypto 86, Springer-Verlag, pp. 200–212.

  • R. S. Cok (1991) Parallel Programs for the Transputer, Prentice Hall International.

  • R. Cooper, W. Patterson and T. Richard (1989) Using multiple-radix arithmetic for fast parallel multiplication on a transputer system, Proc. 2nd Conf. North American Transputer Users' Group, pp. 215–221.

  • T. Elbra (1990) You don't need the law if you have security, Proc. 2nd National Conf. on Law, Computers and Artificial Intelligence, Exeter, pp. 79–87 (to appear in Law, Computers and Artificial Intelligence 1 (1)).

  • S. J. Gaskill (1990) Computer misure, Proc. 2nd National Conf. on Law, Computers and Artificial Intelligence, Exeter, pp. 21–34.

  • S. Goldwasser, S. Micali and C. Rackoff (1985) The knowledge complexity of interactive proof systems, 17th STOC.

  • Inmos (1988) Transputer Reference Manual, Prentice-Hall International.

  • C. Jaramillo, G. Richard, S. Sperry and W. Patterson (1989) An implementation of a zero-knowledge protocol for a secure network login procedure, Proc. IEEE 1989 Southeastcon, pp. 197–201.

  • D. E. Knuth (1981) The Art of Computer Programming. Vol. 2 Seminumerical Algorithms, 2nd Ed., Addison-Wesley.

  • R. Rivest, A. Shamir and L. Adleman (1978) A method for obtaining digital signatures and public cryptosystems, Comm. A.C.M., 21 (2), 120–126.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Turner, S.J. A concurrent solution to computer security. Artif Intell Rev 6, 191–201 (1992). https://doi.org/10.1007/BF00150233

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00150233

Key Words

Navigation