Abstract
It is commonplace to base computer security and information security on hard problems. Recent cryptosystems have been based on the knapsack problem [DE83, pp. 118-126; BRS5] and the problem of factoring an integer [DE83, pp. 104-1091. The former problem is N P complete [GA79, p. 2471. The place of the latter problem in complexity theory is not well understood, but it has been around in number theory for a long time.
Cite
CITATION STYLE
Blakley, G. R., & Rundell, W. (1988). Cryptosystems based on an analog of heat flow. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 293 LNCS, pp. 306–329). Springer Verlag. https://doi.org/10.1007/3-540-48184-2_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
