• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.5
• /
• pp.1094-1107
• /
• 2013

NTRU cryptosystem has been suggested for protecting wireless body area networks, which is secure in the sense of traditional cryptanalysis. In this paper, we fulfill the first power analysis attack on the ultra-low-power environment of wireless body area networks. Specifically, two practical differential power analyses on NTRU algorithm are proposed, which can attack the existing countermeasures of NTRU. Accordingly, we suggest three countermeasures against our attacks. Meanwhile, practical experiments show that although the attacks in this paper are efficient, our countermeasures can resist them effectively.

• Journal of Information Processing Systems
• /
• v.11 no.2
• /
• pp.239-247
• /
• 2015

Cryptography aims at transmitting secure data over an unsecure network in coded version so that only the intended recipient can analyze it. Communication through messages, emails, or various other modes requires high security so as to maintain the confidentiality of the content. This paper deals with IDEA's shortcoming of generating weak keys. If these keys are used for encryption and decryption may result in the easy prediction of ciphertext corresponding to the plaintext. For applying genetic approach, which is well-known optimization technique, to the weak keys, we obtained a definite solution to convert the weaker keys to stronger ones. The chances of generating a weak key in IDEA are very rare, but if it is produced, it could lead to a huge risk of attacks being made on the key, as well as on the information. Hence, measures have been taken to safeguard the key and to ensure the privacy of information.

• International Journal of Advanced Culture Technology
• /
• v.8 no.1
• /
• pp.157-164
• /
• 2020

The reinforcement of the token, which is based on the token economy currently applied in blockchain-based cryptography, plays a critical role in forming the cryptographic-related ecosystem. Therefore, in this paper, it was investigated the reinforcement principle of token supporting the Token economy for blockchain model. In order to create a healthy ecosystem based on the reinforcement system principle, it is necessary to find ways to secure scalability by seeking consensus between the participants and the market economy structure so that it can generate an influx of more participants than seeking to maximize profits of certain people. Desirable behavior is defined as an action required by ecosystem participants that have the property of making the token ecosystem sustainable, and to do so, each individual receives appropriate incentives (rewards) when taking this action, ultimately encouraging voluntary participation and action by all participants in the ecosystem to optimize the interests of both individuals and participants. The expected benefit of this study may contribute to the establishment of various business models based on the principle of the reinforcement system.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2005.11a
• /
• pp.247-250
• /
• 2005

Recently, a concept of bid-rigging is issued in electronic auction. To prevent this attack, Abe-Suzuki proposed firstly receipt-free scheme based on bidding-booth. Chen-Lee-Kim pointed out that Abe-Suzuki's scheme only provides receipt-freeness for losing bidders. Also, they introduced a new receipt-free sealed bid auction scheme using the homomorphic encryption technique. The main participants of their scheme are Auctioneer, Auction Issuer, Bidder and Seller. Bid-rigging can happen by a seller in their scheme. We propose receipt-free sealed-bid auction scheme using a universal re-encryption mixnet. For our receipt-free sealed-bid auction, we use Pseudo ID of a bidder and universal re-encryption technique of Golle et al. Also, our scheme satisfies privacy, correctness, public verifiability, non-reputation, and receipt-freeness.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.3 no.2
• /
• pp.58-63
• /
• 2010

Cryptography is primarily a computationally intensive process. In this paper we expand AES scheme for analysis of computation time with four criteria, first is the compression of plain data, second is the variable size of block, third is the selectable round, fourth is the selective function of whole routine. We have tested our encryption scheme by c++ using MinGW GCC. Through extensive experimentations of our scheme we found that the optimal block size.

• Journal of Astronomy and Space Sciences
• /
• v.32 no.2
• /
• pp.151-159
• /
• 2015

The fundamental conception in physics of the propagation of the electromagnetic wave polarization in matter is newly understood as the cardinal keyword in free-space quantum communication technology and cosmology in astrophysics. Interactive visualization of the propagation mechanism of polarized electromagnetism in a medium with its helicity has accordingly received attention from scientists exploiting the protocol of quantum key distribution (QKD) to guarantee unconditional security in cryptography communication. We have provided a dynamic polarization platform for presenting the polarization modes of a transverse electromagnetic wave, converting the state of polarization through the arrangement of optical elements, using Jones vectors calculations in Methematica. The platform graphically simulates the mechanism of production and propagation of the polarized waves in a medium while satisfying Maxwell's equations.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.15 no.1
• /
• pp.46-56
• /
• 2012

Traitor Tracing schemes are broadcast encryption systems where at least one of the traitors who were implicated in the construction of a pirate decoder can be traced. This traceability is required in various contents delivery system like satellite broadcast, DMB, pay-TV, DVD and so on. In this paper, we propose a public key traitor tracing scheme with key-update method. If the system manager can update a secret key which is stored in an authorized decode, it makes a pirate decoder useless by updating a secret key A pirate decoder which cannot update a secret key does not decrypt contents in next session or during tracing a traitor, this scheme has merits which will make a pirate decoder useless, therefore this scheme raises the security to a higher level.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.3
• /
• pp.1376-1395
• /
• 2018

UOV is one of the most important signature schemes in Multivariate Public Key Cryptography (MPKC). It has a strong security guarantee and is considered to be quantum-resistant. However, it suffers from large key size and its signing procedure is relatively slow. In this paper, we propose a new secure UOV variant (Circulant UOV) with shorter private key and higher signing efficiency. We estimate that the private key size of Circulant UOV is smaller by about 45% than that of the regular UOV and its signing speed is more than 14 times faster than that of the regular UOV. We also give a practical implementation on modern x64 CPU, which shows that Circulant UOV is comparable to many other signature schemes.

• Journal of Information Processing Systems
• /
• v.12 no.4
• /
• pp.681-687
• /
• 2016

Today's modern world requires a digital watermarking technique that takes the redundancy of an image into consideration for embedding a watermark. The novel algorithm used in this paper takes into consideration the redundancies of spatial domain and wavelet domain for embedding a watermark. Also, the cryptography-based secret key makes the algorithm difficult to hack and help protect ownership. Watermarking is blind, as it does not require the original image. Few coefficient matrices and secret keys are essential to retrieve the original watermark, which makes it redundant to various intentional attacks. The proposed technique resolves the challenge of optimizing transparency and robustness using a Canny-based edge detector technique. Improvements in the transparency of the cover image can be seen in the computed PSNR value, which is 44.20 dB.

• Journal of Information Technology Application
• /
• v.1 no.3_4
• /
• pp.91-112
• /
• 1999

대부분의 암호이론은 공개되어 있기 때문에 정보보안 기술의 안전성은 암호 알고리즘과 키 길이에 의존성이 크다. 본 논문에서는 해쉬함수와 카오스 함수를 이용하여 암·복호화를 위한 권장 키 길이보다 작은 길이의 일회성을 갖는 공개키와 비밀키를 생성하여 공개키 암호 알고리즘의 대표격인 RSA 암호방식에 적용하여 본다. 소인수 분해 알고리즘의 개선·발전과 시스템의 처리속도 증가에서 오는 키길이 증가 문제를 해결하므로 스마트 카드와 같은 제한된 메모리에서 실용적으로 사용할 수 있을 뿐만 아니라, 암·복호화를 수행하는 처리 시간을 단축 시킬 수 있으며, 키 관리면에서도 여러개의 공개키/비？키를 사용하는 경우보다 실용적이다.