CRYPTOSYSTEMS BASED ON AN ANALOG OF HEAT-FLOW Academic Article

abstract

• Springer-Verlag Berlin Heidelberg 1988. 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.

authors

• Rundell, William

published proceedings

• LECTURE NOTES IN COMPUTER SCIENCE

author list (cited authors)

• BLAKLEY, G. R., & RUNDELL, W.

citation count

• 0

complete list of authors

• BLAKLEY, GR||RUNDELL, W

publication date

• January 1988

publisher

• Springer Nature  Publisher

published in

• Lecture Notes in Computer Science  Journal

Digital Object Identifier (DOI)

• 10.1007/3-540-48184-2_27

start page

• 306

end page

• 329

volume

• 293

URL

• http://dx.doi.org/10.1007/3-540-48184-2_27