Loading [MathJax]/extensions/MathMenu.js
Dynamic Key Generation for Polymorphic Encryption | IEEE Conference Publication | IEEE Xplore

Dynamic Key Generation for Polymorphic Encryption


Abstract:

Frequency analysis can be effective in breaking block ciphers of very long messages encrypted with single keys, even when protected by cipher-block-chaining schemes. To m...Show More

Abstract:

Frequency analysis can be effective in breaking block ciphers of very long messages encrypted with single keys, even when protected by cipher-block-chaining schemes. To mitigate these attacks, we suggest the use of polymorphic encryption methods, which leverage large numbers of independently generated keys to encrypt long messages with blocks of variable size. The generation of multiple keys, when based on pseudo random numbers, could in turn become a weak element of the scheme. In this paper, we describe a simple file encryption/decryption application that utilizes a simulated secured Physically Unclonable Function crypto table to provide independent key generation for the design of polymorphic encryption. The communicating parties can dynamically generate tens of thousands of keys; the number of which varies with the length of the plain text to encrypt. Our proposed implementation, based on PC to PC communication, is able to encrypt 1Gbyte files with 50,000 keys in about 30 seconds.
Date of Conference: 07-09 January 2019
Date Added to IEEE Xplore: 14 March 2019
ISBN Information:
Conference Location: Las Vegas, NV, USA

References

References is not available for this document.