• International Journal of Computer Science & Network Security
• /
• 제23권7호
• /
• pp.49-60
• /
• 2023

The amount of data generated by electronic systems through e-commerce, social networks, and data computation has risen. However, the security of data has always been a challenge. The problem is not with the quantity of data but how to secure the data by ensuring its confidentiality and privacy. Though there are several research on cloud data security, this study proposes a security scheme with the lowest execution time. The approach employs a non-linear time complexity to achieve data confidentiality and privacy. A symmetric algorithm dubbed the Non-Deterministic Cryptographic Scheme (NCS) is proposed to address the increased execution time of existing cryptographic schemes. NCS has linear time complexity with a low and unpredicted trend of execution times. It achieves confidentiality and privacy of data on the cloud by converting the plaintext into Ciphertext with a small number of iterations thereby decreasing the execution time but with high security. The algorithm is based on Good Prime Numbers, Linear Congruential Generator (LGC), Sliding Window Algorithm (SWA), and XOR gate. For the implementation in C, thirty different execution times were performed and their average was taken. A comparative analysis of the NCS was performed against AES, DES, and RSA algorithms based on key sizes of 128kb, 256kb, and 512kb using the dataset from Kaggle. The results showed the proposed NCS execution times were lower in comparison to AES, which had better execution time than DES with RSA having the longest. Contrary, to existing knowledge that execution time is relative to data size, the results obtained from the experiment indicated otherwise for the proposed NCS algorithm. With data sizes of 128kb, 256kb, and 512kb, the execution times in milliseconds were 38, 711, and 378 respectively. This validates the NCS as a Non-Deterministic Cryptographic Algorithm. The study findings hence are in support of the argument that data size does not determine the execution.

• 디지털산업정보학회논문지
• /
• 제16권2호
• /
• pp.1-9
• /
• 2020

Many cryptographic and error control coding algorithms rely on finite field GF(2m) arithmetic. Hardware implementation of these algorithms needs an efficient realization of finite field arithmetic operations. Finite field multiplication is complicated among the basic operations, and it is employed in field exponentiation and division operations. Various algorithms and architectures are proposed in the literature for hardware implementation of finite field multiplication to achieve a reduction in area and delay. In this paper, a low area and delay efficient semi-systolic multiplier over finite fields GF(2m) using the modified Montgomery modular multiplication (MMM) is presented. The least significant bit (LSB)-first multiplication and two-level parallel computing scheme are considered to improve the cell delay, latency, and area-time (AT) complexity. The proposed method has the features of regularity, modularity, and unidirectional data flow and offers a considerable improvement in AT complexity compared with related multipliers. The proposed multiplier can be used as a kernel circuit for exponentiation/division and multiplication.

• International Journal of Computer Science & Network Security
• /
• 제23권5호
• /
• pp.65-72
• /
• 2023

Cloud Computing is one of the current research areas in computer science. Recently, Cloud is the buzz word used everywhere in IT industries; It introduced the notion of 'pay as you use' and revolutionized developments in IT. The rapid growth of modernized cloud computing leads to 24×7 accessing of e-resources from anywhere at any time. It offers storage as a service where users' data can be stored on a cloud which is managed by a third party who is called Cloud Service Provider (CSP). Since users' data are managed by a third party, it must be encrypted ensuring confidentiality and privacy of the data. There are different types of cryptographic algorithms used for cloud security; in this article, the algorithms and their security measures are discussed.

• 스마트미디어저널
• /
• 제12권9호
• /
• pp.9-18
• /
• 2023

블랙박스 암호는 하드웨어로 구성된 암호화 장치를 기반으로 '디바이스와 사용자는 신뢰할 수 있다'는 가정하에 동작하는 암호이다. 그러나 공격자에게 내부 구조가 공개되는 순간 키 추출 등의 다양한 공격이 존재함과 동시에 최근 들어 신뢰할 수 없는 개방형 플랫폼에서 암호 알고리즘을 적용하는 경우가 증가하여 블랙 박스 암호 시스템에 대한 위협은 더욱 커져가고 있다. 그로 인해, 개방형 플랫폼에서 암호 알고리즘을 안전하게 동작하고자 암호화 과정에서 암호 키를 숨김으로써 공격자의 키 유출을 어렵게 하는 화이트 박스 암호화 기술이 제안되었다. 하지만, 이러한 화이트 박스 기반 암호는 기존의 암호와는 다르게 정해진 규격이 존재하지 않아 구조적 안전성을 검증하는 것이 어렵다. 이에 CHES에서는 보다 안전한 화이트 박스 암호 활용을 위해 The WhibOx Contest를 주기적으로 개최하여, 다양한 화이트 박스 암호에 대한 안전성 분석이 수행 되었다. 이 중 2016년 Bos가 제안한 Differential Computation Analysis(DCA) 공격법은 현재까지도 안전성 분석에 널리 활용되고 있는 강력한 화이트 박스 블록 암호에 대한 공격 기술에 해당한다. 이에 본 논문은 화이트 박스 암호에 대한 동향을 분석하고, 화이트 박스 블록 암호에 대한 부채널 정보 기반 암호분석 기술인 DCA, HODCA 공격 분석 및 관련 대응 기술 동향을 정리한다.

• ETRI Journal
• /
• 제30권1호
• /
• pp.170-172
• /
• 2008

A substitution box (S-box) plays a central role in cryptographic algorithms. In this paper, an efficient method for designing S-boxes based on chaotic maps is proposed. The proposed method is based on the mixing property of piecewise linear chaotic maps. The S-box so constructed has very low differential and linear approximation probabilities. The proposed S-box is more secure against differential and linear cryptanalysis compared to recently proposed chaotic S-boxes.

• 한국정보보호학회:학술대회논문집
• /
• 한국정보보호학회 2001년도 종합학술발표회논문집
• /
• pp.390-395
• /
• 2001

정보보호에 대한 사람들의 인식과 관심이 높아짐에 따라 그에 따른 다양한 정보보호제품들이 나오고 있다. 국내외의 정보보호제품들은 각 제품별로 그에 따른 여러 가지의 보안 알고리즘을 사용하여 구현되어 지고 있다. 하지만 그러한 제품들의 신뢰성 판단여부는 아직까지는 경험에 의존되어지고 있는 현실이다. 이에 본 논문에서는 각 보안 알고리즘의 객관적 검증 방법을 제안하고 검증 도구를 구현함으로써 이에 대한 대안을 제시하고자 한다.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2009년도 춘계학술대회
• /
• pp.805-808
• /
• 2009

Security has become a major concern for many real world applications for wireless sensor networks (WSN). In this domain, many security solutions have been proposed. Usually, all these approaches are based on wellknown cryptographic algorithms. At the same time, performance studies have shown that the applicability of sensor networks strongly depends on effective routing decisions or energy aware wireless communication. In this paper, we analyses vulnerability and security mechanisms in wireless sensor networks.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2011년도 춘계학술발표대회
• /
• pp.848-850
• /
• 2011

모바일 환경의 발전 따라 어플리케이션의 수요 증가로 데이터 보안의 관심도가 높아지고 있다. 본 논문에서는 모바일 환경에서 시나리오에 따른 암호 알고리즘을 비교 분석하였다. 시나리오는 단말저장형 데이터, 단방향전송형 데이터, 실시간전송형 데이터로 정의하고 각각의 시나리오에 적합한 암호알고리즘을 분석하였다.

• ETRI Journal
• /
• 제42권6호
• /
• pp.951-964
• /
• 2020

This paper presents a lightweight true random number generator (TRNG) using beta radiation that is useful for Internet of Things (IoT) security. In general, a random number generator (RNG) is required for all secure communication devices because random numbers are needed to generate encryption keys. Most RNGs are computer algorithms and use physical noise as their seed. However, it is difficult to obtain physical noise in small IoT devices. Since IoT security functions are required in almost all countries, IoT devices must be equipped with security algorithms that can pass the cryptographic module validation programs of each country. In this regard, it is very cumbersome to embed security algorithms, random number generation algorithms, and even physical noise sources in small IoT devices. Therefore, this paper introduces a lightweight TRNG comprising a thin-film beta-radiation source and integrated circuits (ICs). Although the ICs are currently being designed, the IC design was functionally verified at the board level. Our random numbers are output from a verification board and tested according to National Institute of Standards and Technology standards.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(II)
• /
• pp.845-849
• /
• 1987

Finite field arithmetic logic is central in the implementation of Reed-Solomon coders and in some cryptographic algorithms. There is a need for good multiplication and basis conversion algorithms. In this paper, a new multiplication circuit is developed for the finite field GF($2^m$) based on a conventional basis. It is composed of AND gates and EXCLUSIVE-OR gates and is regular, simple, expandable and therefore, naturally suitable for VLSI implementations.