Earticle

DES는 64비트 단위로 나뉘어 진 각각의 블록이 한번의 암호화 알고리즘을 거쳐 암호화 된다. 대칭알고리즘으로서 똑같은 키와 알고리즘이 암호화와 복호화에 쓰인다. 복호화 할 때 키를 반대로 적용하는 등의 약간의 차이는 있다. 키 길이는 64비트로 표현되는데 이 중에서 실제로는 56비트만이 키로서 사용되고 나머지 8비트는 패리티 체크 비트로 사용된다. 암호화는 64비트 블록과 56비트 키를 바탕으로 만든 16개의 보조키가 총 16번의 혼돈과 확산을 거쳐 완료된다. DES 알고리즘을 선택한 이유는 암호 강도에 대한 의문이 제기되고 있기는 하지만 상업적으로 가장 널리 보급되어 이용되고 있다. 또한 기본 알고리즘을 DES 로 채택한 현장에서 앞으로도 상당한 기간 동안 이용이 계속될 것으로 예상되는 DES 알고리즘을 효과적으로 활용하는 방안이 현장에서 참고되기를 기대한다.

DES is a 64-bit binary, and each block is divided into units of time are encrypted through an encryption algorith m. The same key as the symmetric algorithm for encryption and decryption algorithms are used. Conversely, when decryption keys, and some differences may apply. The key length of 64 bits are represented by two ten thousand an d two 56-bit is actually being used as the key remaining 8 bits are used as parity check bits. The 64-bit block and 56-bit encryption key that is based on a total of 16 times 16 modifier and spread through the chaos is completed. D ES algorithm was chosen on the strength of the password is questionable because the most widely available comme rcially, but has been used. In addition to the basic DES algorithm adopted in the future in the field by a considerabl e period are expected to continue to take advantage of the DES algorithm effectively measures are expected to be in the field note

Background/Objectives: The wireless internet service, which has positioned as an important element to support all industries, can be connected to notebook computers and smartphones everywhere. Using wireless internet access increases, the risk of hacking also increases. Methods/Statistical analysis: There is information leakage accident by modulating DNS address of home router and hacking threats by using wireless router always exists Findings: In this paper, we search hacking techniques using vulnerabilities in wireless LAN, and analyze the need for security for wireless LANs through WEP encryption algorithms and improved encryption algorithms. Improvements/Applications: We also suggest countermeasures against hacking techniques such as DoS attacks, WEP Crack, and DNS Spoofing.

Wireless sensor networks are susceptible to a variety of network attacks. Due to the limited energy of nodes and selfish nodes in the network, the packet delivery rate is lower. To address these issues, we innovatively propose an energy-harvesting Q-learning secure routing algorithm with authenticated-encryption. The algorithm uses physical unclonable functions and optimized Q-learning to ensure that the transmission path is reliable. Meanwhile, we combine the LSTM-based prediction model to predict the energy value that the nodes replenish. In addition, simulations are performed to compare the performances of the proposed algorithm with other algorithms under different attacks. The proposed algorithm has greater improvements in the packet delivery rate, filtering selfish nodes, and reducing node energy consumption.

This With the expansion of information and communication technology, the term ubiquitous computing is a known concept used to describe the current era of interconnected digital systems, which is silently posing a new threat to private information leakage through encryption applications. This work aims to acquaint individuals with the privacy information forms of expression in networking technology and then proposes secure multi-party computation to achieve personal information protection. This work emphasizes that, for the time being, homomorphic computing research approaches privacy in ubiquitous environments without considering the various aspects and fundamental principles of privacy. Finally, this work highlights the need for multidisciplinary research in the area and the importance that homomorphic computing algorithm research receives input from other related disciplines, such as law and psychology. This research aims to contribute to the ongoing discourse on the nature of privacy and its role in ubiquitous environments, providing insights for future research. Although research on privacy in the area of ubiquitous computing expands in many different directions and covers various topics, privacy issues are still open, and it appears that feasible and effective solutions are still quite far from being realized. A critical analysis of this research on privacy in ubiquitous environments reveals a significant shift: up to now, it has been the government's role to provide the framework for privacy protection. Homomorphic encryption is an encryption scheme that allows operations on encrypted data, and it can be applied in any system using various public key algorithms. When data is transferred to the public area, various encryption algorithms are used to secure both the operations and storage of the data. However, to process data located on a remote proxy server while preserving privacy, homomorphic encryption is crucial, especially for network-based operations.

As the rate of visual information interchange on the Internet increases, image encryption has become a key method to secure image information. Here, an efficient image encryption technique was investigated. It employed Genetic Algorithm (GA) and Secure Force Algorithm (SF), along with using chaotic maps' transpositions on bit-level to remove the deep correlations between pixels. This study examined the efficiency of the technique with respect to security analysis, using entropy, histogram, correlation, NPCR, UACI, and sensitivity tests. The obtained results were outstanding, the average entropy was 7.999 (theoretical value is 8). Besides that, the coefficient correlation was almost zero which means that plain and ciphered images have no relevance to each other. Ciphered image's histograms were fairly uniformed, confirming that ciphered images have no statistical resemblance to original images and making no suggestions about how to implement statistical attacks. Because the proposed cryptosystem is more stable in the face of prevalent attacks, it can be used for secure applications and secure communication.

빠르게 진화하는 정보 통신 기술로 인해서 새로 생성되는 데이터는 급속히 증가하고 있다. 센서, 스마트 폰, 소셜 네트워킹 사이트, 논리적 데이터 및 이니셔티브의 데이터가 이 엄청난 정보 폭발을 발생시키고 있다. Hadoop은 방대한 양의 데이터를 처리하는 데 사용되는 프레임워크이며 기업에서 중요한 정보를 저장하고 관리하 는데 많이 사용되고 있다. 또한, Hadoop은 분산형 파일 시스템으로 기능 및 보안 업데이트가 계속 진행되고 있다. 그러나 Hadoop은 민감한 데이터의 보안에 취약하다. 본 연구에서는 클라우드 시스템에 대한 보안 문제를 조사하 였다. 특히, 현재 클라우드 환경에서 사용할 수 있는 암호화 알고리즘을 조사하고 데이터 암호화 실험을 수행하였 다. 실험에서는 Salsa20, 3-DES, AES, MARS, Blowfish 등 총 6가지 알고리즘을 비교 하였고 논문에서 제안하 는 Salsa20을 사용하는 것이 최고 22%의 성능 향상이 있는 것을 확인하였다.

Data is rising tremendously in the rapidly evolving world of information and communications technology. Data from sensors, smartphones, social networking sites, logical data, and initiatives are fueling this enormous information explosion. Hadoop is a framework used to process vast amounts of data and is widely used by companies to store and manage important information. Additionally, Hadoop is a distributed file system, and feature and security updates are continuously being made. In this paper, encryption algorithms currently available in the cloud environment were investigated and data encryption experiments were conducted. In the experiment, a total of six algorithms, including Salsa20, 3-DES, AES, MARS, and Blowfish, were compared, and it was confirmed that using Salsa20 proposed in the paper improved performance by up to 22%.

현재 M2M 환경은 다양한 서비스가 기관 및 기업이나 일상생활로 확대되면서 관련 기술의 보안 취약성 발생 가능성이 이슈화되고 있다. 본 논문은 이러한 보안 취약성 문제를 해결하기 위해 M2M 환경의 디바이스 키 보호를 위한 암호 알고리즘 응용 기법을 제안한다. 제안 기법은 타원곡선 암호 기반으로 초기 키 교환과 서명 교환을 통해 보안 세션을 생성하였고, 화이트박스 암호는 보안 세션 키를 이용하여 화이트박스 테이블을 생성하는 암호화에 응용하였다. 암호 알고리즘 적용 결과, 타원곡선 암호는 통신 세션에 대한 경량 화된 상호인증, 세션 키 보호를 제공하고, 화이트 박스 암호는 기존 암호 알고리즘과는 다른 방식으로 암호화에 사용되는 세션 키 보호를 보장하였다. 제안하는 프로토콜은 데이터변조 및 노출, 중간자 공격, 데이터 위조 및 변조 공격에 대해 안전한 장점이 있다.

With the diverse services of the current M2M environment being expanded to the organizations, the corporations, and the daily lives, the possibility of the occurrence of the vulnerabilities of the security of the related technologies have become an issue. In order to solve such a problem of the vulnerability of the security, this thesis proposes the technique for applying the cryptography algorithm for the protection of the device key of the M2M environment. The proposed technique was based on the elliptic curve cryptography Through the key exchange and the signature exchange in the beginning, the security session was created. And the white box cipher was applied to the encryption that creates the white box table using the security session key. Application results cipher algorithm, Elliptic Curve Cryptography provides a lightweight mutual authentication, a session key for protecting the communication session and a conventional white-box cipher algorithm and was guaranteed the session key used to encrypt protected in different ways. The proposed protocol has secure advantages against Data modulation and exposure, MITM(Man-in-the-middle attack), Data forgery and Manipulation attack.

Perceptual encryption (PE) is becoming popular for protecting image data as they are computationally inexpensive and retain certain image properties that are necessary for compression. PE methods not only provide security during transmission of image data but can also enable privacy-preserving computations on them. However, the presence of color information in the cipher image makes the existing PE algorithms vulnerable to jigsaw puzzle attacks. Therefore, this paper presents an extension of block-based PE methods that utilizes different keys for each color component when changing orientation of a block and pixel values in a block. Thus, offers better encryption performance as the color distribution of the original is changed significantly and the keyspace is expanded. The analysis on Tecnick dataset shows that the proposed PE method preserves compression performance of the existing methods while improving their encryption efficiency. In addition, the main advantage of the proposed method is that of being compatible with a widely used JPEG image standard, which makes it suitable for different outsourced multimedia applications such as, privacy-preserving deep learning, cloud-based photo storage, and social networking services.

최근 클라우드 컴퓨팅이 발전함에 따라 데이터베이스 아웃소싱에 대한 관심이 증가하고 있다. 그러나 데이터베이스 를 아웃소싱하는 경우, 데이터 소유자의 정보가 내부 및 외부 공격자에게 노출되는 문제점을 지닌다. 따라서 본 논 문에서는 프라이버시 보호를 지원하는 십진수 기반의 암호화 연산 프로토콜을 제안한다. 제안하는 프로토콜은 이진 수 기반의 암호화 연산 프로토콜과 달리 bit length 만큼 반복 연산을 수행하지 않기 때문에 연산의 효율성을 향상 시킨다. 아울러 십진수 기반의 암호화 연산 프로토콜을 이용한 kNN 질의처리 알고리즘을 제안한다. 제안하는 kNN 질의처리 알고리즘은 암호화 연산의 효율성을 향상시킨 십진수 기반의 프로토콜을 사용함으로써 높은 질의 처 리 성능을 제공한다. 한편 제안하는 알고리즘의 보안 분석을 수행하여, 데이터 보호, 질의 보호, 접근 패턴 보호를 지원함을 증명한다. 마지막으로 성능평가를 통해, 제안하는 kNN 질의처리 알고리즘이 기존 알고리즘에 비해서 약 5배의 질의처리 성능 향상이 있음을 보인다.

With the development of cloud computing, interest in database outsourcing has recently increased. However, when the database is outsourced, there is a problem in that the information of the data owner is exposed to internal and external attackers. Therefore, in this paper, we propose decimalbased encryption operation protocols that support privacy preservation. The proposed protocols improve operational efficiency compared to binary-based encryption operation protocols by eliminating the need for repetitive operations based on bit length. In addition, we propose a privacy-preserving kNN query processing algorithm using decimal-based encryption operation protocols. The proposed kNN query processing algorithm provides high query processing performance by utilizing efficient decimal-based protocols which enhance the efficiency of the encryption operations. Meanwhile, the security analysis of the proposed algorithm is performed to prove its data protection, query protection, and access pattern protection. Through our performance analysis, the proposed kNN query processing algorithm shows about 5 times better query processing performance, compared with the existing algorithms.

요즈음, 원격 처방전 및 원격 진료가 시범적으로 운영되고 있다. 그러나 대부분의 원격지 병원에서 환자 생체 데이터를 암호화 하지 않고 전송하는 경우, 해커가 환자 처방전 데이터를 해킹해서 처방전 약물을 바꾸면 환자는 심각한 장애를 받을 수 있다. 따라서, 본 논문에서는, 이러한 문제점을 해결하기 위해 원격 처방전과 의료 정보시스템에 환자의 비밀번호, 개인 식별 정보, 바이오 정보 등을 암호화하는 알고리즘과 안전한 보안 구현 방안이 제시되었다.

Nowadays, telemedicine and remote prescription has been operating as a pilot basis. However, in case of remote hospitals without encrypting the biometric data transmission and its contents, the patient prescription data hacked from hackers who changed prescription medications can be serious obstacles to the patient. Therefore, in this paper, to solve this problem, password encryption, personal identification information, biometric data security on the patient's prescription and remote medical information system, and implementation of the encryption algorithm are proposed.

정보보호용 디바이스에 RSA 시스템과 같은 암호 알고리듬을 그대로 탑재하여 사용할 경우 전력 분석이나 오류 주입 등과 같은 구현 공격에 의해 비밀 키가 노출될 수 있다. 본 논문에서는 덧셈 체인에 기반한 이중 멱승 알고리듬이 입력 메시지에 대한 오류 주입 공격에 취약하며 덧셈 체인을 구해야 하는 비효율성을 지적하고 이를 해결할 수 있는 새로운 이중 멱승 알고리듬을 제안한다. 제안하는 이중 멱승 알고리듬은 기존에 제시된 전력 분석 공격 및 오류 주입 공격을 방어할 수 있으며 안전한 RSA-CRT(RSA based on Chinese Remainder Theorem) 시스템을 구현하기 위해 효과적으로 활용할 수 있다.

When some cryptographic algorithms used in cryptosystem such as RSA are naively implemented on a security device, the secret key of cryptosystem can be exposed to an attacker by the power analysis and fault injection attacks In this paper, we point out that the double addition chain exponentiation algorithm is vulnerable to the fault injection attack on input message and has inefficiency due to the computing of addition chain. We proposed a novel double exponentiation algorithm, which defeats most previous power analysis and fault injection attacks and can be adopted for secure RSA-CRT implementation.

This paper presents the novel selective encryption algorithm for vector map protection for storage, transmission, distribution to authorized users. In proposed algorithm, we just select some values of polylines and polygons in DCT domain to encrypt by random algorithms and cryptography. Experimental results verified that proposed algorithm is effectively and security. Maps are changed whole after encryption process, and unauthorized users cannot access to copy or use them. Encrypted maps do not alter the size of file and not have loss accuracy. The error between original map and decrypted map is approximate zero.

With the rapid development of social network, more and more information is being presented in the form of multimedia, so the security of multimedia files, especially video files, has been capturing the attention of the researchers. Video encryption is widely applied to the DRM system, video conference, medical and military fields and so on. A general video encryption algorithm is proposed to solve the problem that the existing multiple formats (compression formats and container formats) of video requires a unified encryption scheme. Meanwhile, the proposed scheme can not only provide variable levels of security, but also have good performance of compression efficiency and computational complexity, which can ensure that the encrypted video data can be operation.

Cryptography can be defined as the art of secret writing or protecting information by transforming it (encrypting it) into an unreadable format, called cipher text and then transmitting it across insecure networks, so that it cannot be read by anyone except the intended recipient. Only those who possess a secret key can decipher (or decrypt) the message into plain text. Encrypted information can sometimes be broken by cryptanalysis, also called code breaking, although modern cryptography techniques are virtually unbreakable. Various algorithms help achieve flawless encryption results which are mostly unbreakable. This paper is an attempt to improve one such algorithm, i.e. RC6 by adding on to its existing functionalities.

This paper presents a computationally efficient encryption scheme for RGB images. Firstly, the original plain-image is decomposed to three component images of R, G and B. Secondly, an improved gravitation model is used for value transformation by setting different encryption keys on each component. Thirdly, the improved Arnold transform is applied for position permutation. Finally, we obtain the encrypted image by composing the three component cipher-images. Experimental results show that encrypted image achieved by our algorithm can effectively resist security attacks.

Because the single chaotic mapping easily creates security weaknesses in the image encryption algorithm, the security needs to be improved. Aiming at this problem, a bit-level image encryption algorithm based on composite chaotic mapping (CCM-IEA) is proposed. First of all, the algorithm scrambles the plain image on bit level through the Cat mapping for the first time. And then the Henon mapping of two dimensional discrete is used to scramble for the second time. Finally, image diffusion is operated through the one dimensional Logistic mapping, and the data sensitivity is enhanced. The experimental results show that the performance of the CCM-IEA algorithm is better on the histogram, information entropy and correlation analysis. Compared with the single chaotic images encryption algorithm, the CCM-IEA algorithm has the ability to resist the information entropy analysis and correlation analysis. It can be seen that the CCM-IEA algorithm has high safety performance and good encryption effect.

S-box mainly plays the role of confusion in the encryption process as an important component. For the new encryption algorithm PRESENT proposed in 2007, S-box impacts on the security of the encryption algorithm directly. This paper briefly describes the process of PRESENT algorithm and proposes an improved S-box to solve the problem that the original PRESENT S-box has anti-fixed point. Then a random PRESENT encryption algorithm based on dynamic S-box is proposed. The dynamic multiple S-boxes technology is used to implement random PRESENT algorithm, to enhance the security of the cryptographic algorithm. Finally, the security analysis is done, and it suggests that dynamic S-box has a superior ability to resist differential attack and linear attack. By comparison to the diffusion rate of original PRESENT S-box, our dynamic S-box has better avalanche effect.

This paper proposes a new Text Encryption (N-TEA) Algorithm that compresses and encrypts input text before transmitting it to the receiver. The N-TEA algorithm uses a predefined static dictionary providing codewords of only 12 bits as maximum length, and occupying less than 16 Kbytes. The predefined dictionary stores characters, symbols, and few frequently used words. The dictionary is hashed, generating encrypted dictionary of large number of possibilities that is almost impossible to be discovered or broken without knowing the right hashing function. Several hashing functions could be applied for exchanging text data between parties. Although dictionary based text coding is not new, the proposed work is novel, very simple, and generic, having three main advantages over those in the literature. First, the used dictionary is for characters and symbols, instead of the complete dictionary of words and encryption is for the dictionary itself, instead of the original text. Second, no private/public keys are transmitted through communication channels, providing secured data exchange. Third, transmitted data is reduced by at least 25% of its original size at the same time the text is encrypted, transmitting compressed and encrypted data. Thus, the proposed N-TEA algorithm is adequate for real-time applications, resisting many kinds of attacks such as the Brute Force, Meet-in-the-Middle, and Birthday attacks.

The requirement of information security on network has become more and more important. Cryptography is a method to provide information confidentiality, authenticity and integrity. There are so many challenges to implement cryptography algorithm such as execution time, memory requirement, and computation power. Parallel computation is a promising technique to improve the performance of cryptography algorithm. Mainly divide-and-conquer strategy is used in parallel computation to solve the algorithms in parallel by partitioning and allocating, number of given subtask to available processing units. Parallel computation can be performed using multicore processors by parallelizing the execution of algorithm in multiple cores. In this paper we explore the implementation of AES (Advanced Encryption Algorithm) cryptography algorithm on dual core processor by using OpenMP API to reduce the execution time.

The paper presents a new Image Encryption Algorithm. First of all, we utilize the common plane analysis process and Logistic to generate seven groups of chaotic sequence of different range value, and then, the order of the "exclusive or" of Scrambling Figures in the plane analysis of 8 groups different information content was determined by the generated Chaotic sequences with different range values and the information in Bit Plane Analysis. We use 7 groups of different values of every Logistic and select the corresponding pixels of different groups to process ‘exclusive or’ operation, in the end we will get encrypted image. Decryption is the inverse process of encryption. This Algorithm implementation is simple, and due to the generated different chaotic sequence, this algorithm has large key spaces. Other than that, the experiment verifies that new Image Encryption Algorithm is free from the histogram, plain text attack, etc.