Securing the net-the fruits of incompetence

This paper reviews the most popular mathematical primitives that are used in current attempts to build secure networks. It sketches a possible security application on the Internet, and shows some of the basic concepts and set the stage for the mathematical primitives that are presented. The factoring and discrete logarithm problems are considered. No attempts are made to formalize notions such as “infeasible”, “hard” or “efficient&rdquo


Published in:
First Monday, 1, 4
Year:
1996
Publisher:
University of Illinois at Chicago Library
ISSN:
1396-0466
Keywords:
Laboratories:




 Record created 2010-06-24, last modified 2018-03-17

n/a:
Download fulltextPDF
External link:
Download fulltextURL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)