0

I have an application that needs to combine two cascaded (symmetric) encryption keys using the Pohlig-Hellman cipher.

For example:

The system needs two keys for encryption $c = E_a(E_b(x))$ while it only needs one key for decryption $D_{a\otimes b}(c)=x$. The system may NOT need to consider Known Plaintext Attack or Chosen-plaintext Attack because the key is only used once.

Is it possible that the PH-based method can support encrypting large blocks? For example, can it support 1GB file encryption?

I am quite new to this area. Very much appreciated it if you could provide any tutorials on this.

Yuhang Ye
  • 1
  • 1

0 Answers0