A new countermeasure against brute-force attacks that use high performance computers for big data analysis

Hyun Ju Jo, Ji Won Yoon

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

Using high performance parallel and distributed computing systems, we can collect, generate, handle, and transmit ever-increasing amounts of data. However, these technical advancements also allow malicious individuals to obtain high computational power to attack cryptosystems. Traditional cryptosystem countermeasures have been somewhat passive in response to this change, because they simply increase computational costs by increasing key lengths. Cryptosystems that use the conventional countermeasures cannot preserve secrecy against various cryptanalysis approaches, including side channel analysis and brute-force attacks. Therefore, two new countermeasures have recently been introduced to address this problem: honey encryption and the structural code scheme. Both methods look different; however, they have similar security goals and they both feature distribution transforming encoders based on statistical schemes. We unify them into a statistical code scheme in this study. After explaining the statistical code scheme, we describe the structural code scheme, which has not been adopted as widely as the honey encryption.

Original languageEnglish
Article number406915
JournalInternational Journal of Distributed Sensor Networks
Volume2015
DOIs
Publication statusPublished - 2015

Fingerprint

Cryptography
Distributed computer systems
Parallel processing systems
Big data
Costs

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Engineering(all)

Cite this

@article{f53f215e33ef47c2bbefc7e9e0190ca9,
title = "A new countermeasure against brute-force attacks that use high performance computers for big data analysis",
abstract = "Using high performance parallel and distributed computing systems, we can collect, generate, handle, and transmit ever-increasing amounts of data. However, these technical advancements also allow malicious individuals to obtain high computational power to attack cryptosystems. Traditional cryptosystem countermeasures have been somewhat passive in response to this change, because they simply increase computational costs by increasing key lengths. Cryptosystems that use the conventional countermeasures cannot preserve secrecy against various cryptanalysis approaches, including side channel analysis and brute-force attacks. Therefore, two new countermeasures have recently been introduced to address this problem: honey encryption and the structural code scheme. Both methods look different; however, they have similar security goals and they both feature distribution transforming encoders based on statistical schemes. We unify them into a statistical code scheme in this study. After explaining the statistical code scheme, we describe the structural code scheme, which has not been adopted as widely as the honey encryption.",
author = "Jo, {Hyun Ju} and Yoon, {Ji Won}",
year = "2015",
doi = "10.1155/2015/406915",
language = "English",
volume = "2015",
journal = "International Journal of Distributed Sensor Networks",
issn = "1550-1329",
publisher = "SAGE Publications Inc.",

}

TY - JOUR

T1 - A new countermeasure against brute-force attacks that use high performance computers for big data analysis

AU - Jo, Hyun Ju

AU - Yoon, Ji Won

PY - 2015

Y1 - 2015

N2 - Using high performance parallel and distributed computing systems, we can collect, generate, handle, and transmit ever-increasing amounts of data. However, these technical advancements also allow malicious individuals to obtain high computational power to attack cryptosystems. Traditional cryptosystem countermeasures have been somewhat passive in response to this change, because they simply increase computational costs by increasing key lengths. Cryptosystems that use the conventional countermeasures cannot preserve secrecy against various cryptanalysis approaches, including side channel analysis and brute-force attacks. Therefore, two new countermeasures have recently been introduced to address this problem: honey encryption and the structural code scheme. Both methods look different; however, they have similar security goals and they both feature distribution transforming encoders based on statistical schemes. We unify them into a statistical code scheme in this study. After explaining the statistical code scheme, we describe the structural code scheme, which has not been adopted as widely as the honey encryption.

AB - Using high performance parallel and distributed computing systems, we can collect, generate, handle, and transmit ever-increasing amounts of data. However, these technical advancements also allow malicious individuals to obtain high computational power to attack cryptosystems. Traditional cryptosystem countermeasures have been somewhat passive in response to this change, because they simply increase computational costs by increasing key lengths. Cryptosystems that use the conventional countermeasures cannot preserve secrecy against various cryptanalysis approaches, including side channel analysis and brute-force attacks. Therefore, two new countermeasures have recently been introduced to address this problem: honey encryption and the structural code scheme. Both methods look different; however, they have similar security goals and they both feature distribution transforming encoders based on statistical schemes. We unify them into a statistical code scheme in this study. After explaining the statistical code scheme, we describe the structural code scheme, which has not been adopted as widely as the honey encryption.

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

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

U2 - 10.1155/2015/406915

DO - 10.1155/2015/406915

M3 - Article

VL - 2015

JO - International Journal of Distributed Sensor Networks

JF - International Journal of Distributed Sensor Networks

SN - 1550-1329

M1 - 406915

ER -