A FAST ASYMMETRIC KEY ENCRYPTION ALGORITHM FOR BULK DATA

  • Shin, Sang-Uk (Electronics and Telecommunications Reserch Institute) ;
  • Rhee, Kyung-Hyune (Department of Computer Science, Pukyong Naitonal University)
  • 발행 : 2001.09.01

초록

In this paper, we propose an efficient encryption algorithm, without exchanging session keys of a symmetric cryptosystem. The proposed scheme, called as the FAKE(Fast Asymmetric Key Encryption), first scrambles an entire input message and then encrypts small parts of the scrambled message using an asymmetric key encryption scheme. We use the all-or-nothing transform based on the hash function as a scrambling function, which was proposed by Shin, et al. Furthermore, the proposed scheme can additionally provide a digital signature service with only small overhead.

키워드

참고문헌

  1. Advances in Cryptology - EuroCrypt'94, Lecture Notes in Computer Science(LNCS) 950 v.950 Optimal Asymmetric Encryption - How to Encrypt with RSA M.Bellare;P.Rogaway
  2. Advances in Cryptology - EuroCrypt'96, LNCS v.1070 The Exact Security of Digital Signatures - How to Sign with RSA and Rabin M.Bellare;P.Rogaway
  3. Handbook of Applied Cryptography A.J.Menezes;P.C. van Oorschot;S.A.Vanston
  4. The Proceedings of the 1997 Fast Software Encryption Conference, LNCS v.1267 All-or-Nothing Encryption and The Package Transform R.L.Rivest
  5. PKC'99(International Workshop on Practice and Theory in Public Key Cryptography), LNCS v.1560 Hash functions and the MAC Using All-Or-Nothing Property Sang UK Shin;Kyung Hyune Rhee;Jae Woo Yoon