REMARK ON A "NON-BREAKABLE DATA ENCRYPTION" SCHEME BY KISH AND SETHURAMAN Academic Article uri icon

abstract

  • We break a cryptosystem by Kish and Sethuraman and show that the authentication problem of their protocol can be fixed. We prove that finding an instance of this cryptosystem, which meets the design criteria, would show that P≠NP.

author list (cited authors)

  • KLAPPENECKER, A.

citation count

  • 5

publication date

  • December 2004