Dynamic key generation for polymorphic encryption

D. Duane Booher; Bertrand Cambou; Albert H. Carlson; Christopher Philabaum

doi:10.1109/CCWC.2019.8666500

Dynamic key generation for polymorphic encryption

D. Duane Booher, Bertrand Cambou, Albert H. Carlson, Christopher Philabaum

Applied Physics and Materials Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

11 Scopus citations

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.

Original language	English (US)
Title of host publication	2019 IEEE 9th Annual Computing and Communication Workshop and Conference, CCWC 2019
Editors	Satyajit Chakrabarti, Himadri Nath Saha
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	482-487
Number of pages	6
ISBN (Electronic)	9781728105543
DOIs	https://doi.org/10.1109/CCWC.2019.8666500
State	Published - Mar 12 2019
Event	9th IEEE Annual Computing and Communication Workshop and Conference, CCWC 2019 - Las Vegas, United States Duration: Jan 7 2019 → Jan 9 2019

Publication series

Name	2019 IEEE 9th Annual Computing and Communication Workshop and Conference, CCWC 2019

Conference

Conference	9th IEEE Annual Computing and Communication Workshop and Conference, CCWC 2019
Country/Territory	United States
City	Las Vegas
Period	1/7/19 → 1/9/19

Keywords

Cybersecurity
PUF
Physically Unclonable Function
polymorphic encryption
private key
public key

ASJC Scopus subject areas

Computer Networks and Communications

Access to Document

10.1109/CCWC.2019.8666500

Cite this

Booher, D. D., Cambou, B., Carlson, A. H., & Philabaum, C. (2019). Dynamic key generation for polymorphic encryption. In S. Chakrabarti, & H. N. Saha (Eds.), 2019 IEEE 9th Annual Computing and Communication Workshop and Conference, CCWC 2019 (pp. 482-487). Article 8666500 (2019 IEEE 9th Annual Computing and Communication Workshop and Conference, CCWC 2019). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CCWC.2019.8666500

Dynamic key generation for polymorphic encryption. / Booher, D. Duane; Cambou, Bertrand; Carlson, Albert H. et al.
2019 IEEE 9th Annual Computing and Communication Workshop and Conference, CCWC 2019. ed. / Satyajit Chakrabarti; Himadri Nath Saha. Institute of Electrical and Electronics Engineers Inc., 2019. p. 482-487 8666500 (2019 IEEE 9th Annual Computing and Communication Workshop and Conference, CCWC 2019).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Booher, DD, Cambou, B, Carlson, AH & Philabaum, C 2019, Dynamic key generation for polymorphic encryption. in S Chakrabarti & HN Saha (eds), 2019 IEEE 9th Annual Computing and Communication Workshop and Conference, CCWC 2019., 8666500, 2019 IEEE 9th Annual Computing and Communication Workshop and Conference, CCWC 2019, Institute of Electrical and Electronics Engineers Inc., pp. 482-487, 9th IEEE Annual Computing and Communication Workshop and Conference, CCWC 2019, Las Vegas, United States, 1/7/19. https://doi.org/10.1109/CCWC.2019.8666500

Booher DD, Cambou B, Carlson AH, Philabaum C. Dynamic key generation for polymorphic encryption. In Chakrabarti S, Saha HN, editors, 2019 IEEE 9th Annual Computing and Communication Workshop and Conference, CCWC 2019. Institute of Electrical and Electronics Engineers Inc. 2019. p. 482-487. 8666500. (2019 IEEE 9th Annual Computing and Communication Workshop and Conference, CCWC 2019). doi: 10.1109/CCWC.2019.8666500

Booher, D. Duane ; Cambou, Bertrand ; Carlson, Albert H. et al. / Dynamic key generation for polymorphic encryption. 2019 IEEE 9th Annual Computing and Communication Workshop and Conference, CCWC 2019. editor / Satyajit Chakrabarti ; Himadri Nath Saha. Institute of Electrical and Electronics Engineers Inc., 2019. pp. 482-487 (2019 IEEE 9th Annual Computing and Communication Workshop and Conference, CCWC 2019).

@inproceedings{1500002412a64a4e8aa29a2b82c6ec09,

title = "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 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.",

keywords = "Cybersecurity, PUF, Physically Unclonable Function, polymorphic encryption, private key, public key",

author = "Booher, {D. Duane} and Bertrand Cambou and Carlson, {Albert H.} and Christopher Philabaum",

note = "Publisher Copyright: {\textcopyright} 2019 IEEE.; 9th IEEE Annual Computing and Communication Workshop and Conference, CCWC 2019 ; Conference date: 07-01-2019 Through 09-01-2019",

year = "2019",

month = mar,

day = "12",

doi = "10.1109/CCWC.2019.8666500",

language = "English (US)",

series = "2019 IEEE 9th Annual Computing and Communication Workshop and Conference, CCWC 2019",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "482--487",

editor = "Satyajit Chakrabarti and Saha, {Himadri Nath}",

booktitle = "2019 IEEE 9th Annual Computing and Communication Workshop and Conference, CCWC 2019",

}

TY - GEN

T1 - Dynamic key generation for polymorphic encryption

AU - Booher, D. Duane

AU - Cambou, Bertrand

AU - Carlson, Albert H.

AU - Philabaum, Christopher

PY - 2019/3/12

Y1 - 2019/3/12

N2 - 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.

AB - 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.

KW - Cybersecurity

KW - PUF

KW - Physically Unclonable Function

KW - polymorphic encryption

KW - private key

KW - public key

UR - http://www.scopus.com/inward/record.url?scp=85063904703&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85063904703&partnerID=8YFLogxK

U2 - 10.1109/CCWC.2019.8666500

DO - 10.1109/CCWC.2019.8666500

M3 - Conference contribution

AN - SCOPUS:85063904703

T3 - 2019 IEEE 9th Annual Computing and Communication Workshop and Conference, CCWC 2019

SP - 482

EP - 487

BT - 2019 IEEE 9th Annual Computing and Communication Workshop and Conference, CCWC 2019

A2 - Chakrabarti, Satyajit

A2 - Saha, Himadri Nath

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 9th IEEE Annual Computing and Communication Workshop and Conference, CCWC 2019

Y2 - 7 January 2019 through 9 January 2019

ER -

Dynamic key generation for polymorphic encryption

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this