• 한국HCI학회:학술대회논문집
• /
• 2006.02b
• /
• pp.543-548
• /
• 2006

2005년 발표된 애플사의 아이포드 셔플 디지털 음악 재생기는 오랫동안 잊혀지거나 제대로 사용되지 않았던 음악 재생 방법인 셔플(Shuffle)기능에 대한 재조명을 하고 이를 새로운 사용자 경험으로 만들어 냈다. 본 논문에서는 이와 같은iPod 셔플, 라디오등 음악 콘텐츠의 선곡과 플레이하는 방법에 대해 비교 분석하였으며 이를 통해 보다 향상된 방법으로서 컨텐츠 저장구조를 항해하는것이 가능하면서도 사용자의 특별한 의지에 의한 조종없이도 적절한 선곡을 제공하며 또한 특별한 그래픽 유저 인터페이스 장치를 필요로 하지 않는 방법이 필요함을 고찰하였다. 이러한 분석된 결과를 바탕으로 맥락적 컨텐츠 구성 방법에 관한 새로운 디자인안을 창출하였다. 이 디자인 안은 사용자 사용패턴 추출장치, 가상 채널 형성 장치, 환경 분석 장치로 구성된 지능화된 컴퓨터 시스템에 의해 사용자에게 맥락적인 무작위 음악 재생 방법을 제공하는 것이다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.05a
• /
• pp.659-662
• /
• 2013

과거에는 보안디바이스의 안전성을 탑재된 암호알고리즘의 안전성에 의존하였다. 하지만 부채널 분석을 통해 암호알고리즘의 안전성과는 별개로 부채널 정보에 의한 보안디바이스의 물리적 취약성이 존재함이 밝혀졌다. 이러한 보안디바이스의 물리적 취약성을 보완하기 위해서는 최소 2차 상관전력분석에 대한 대응법이 간구되어야 한다. 최근 2차 상관전력분석에 대한 실용적인 대응법으로 1차 마스킹과 셔플링을 혼합한 방법을 많이 활용하고 있다. 하지만 1차 마스킹과 셔플링이 혼합된 부채널 대응법을 1차 상관전력분석으로 분석하였을 경우, 특이한 피크가 발생한다. 본 논문에서는 마스킹과 셔플링이 혼합된 부채널 대응법을 1차 상관전력분석으로 분석하였을 때, 특이한 피트가 발생함을 실험적으로 확인하였고, 그 피크 발생 원인을 소개한다. 뿐만 아니라, 피크 발생 정보를 추가적인 부채널 분석 정보로 활용할 수 있는 방법을 소개한다.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.11
• /
• pp.97-104
• /
• 2020

In this paper, we propose a random number generator PP(PingPong256) and a shuffle technique to improve the problem that the encrypted image is damaged due to a lot of noise by the channel coding of wireless communication recommended in the special environment of space. The PP can constantly generate random numbers by entering an initial value of 512 bits. Random numbers can be encrypted through images and exclusive logical computations. Random numbers can be encrypted through images and exclusive logical computations. The shuffle technique randomly rearranges the image pixel positions while synchronizing the image pixel position and the random number array position and moving the random number arrangement in ascending order. Therefore, the use of PP and shuffle techniques in channel coding allows all pixels to be finely distributed and transmit high-quality images even in poor transmission environments.

• Journal of Advanced Navigation Technology
• /
• v.22 no.5
• /
• pp.429-435
• /
• 2018

In radar systems, FFT (fast Fourier transform) operation is necessary to obtain the range and velocity of target, and the design of an FFT processor which operates at high speed is required for real-time implementation. The perfect shuffle network is suitable for high-speed FFT processor. In particular, twice perfect shuffle network based on radix-4 is preferred for very high-speed FFT processor. Moreover, radar systems that requires various velocity resolution should support scalable FFT points. In this paper, we propose a 8~1024-point scalable FFT processor based on twice perfect shuffle network algorithm and present hardware design and implementation results. The proposed FFT processor was designed using hardware description language (HDL) and synthesized to gate-level circuits using $0.65{\mu}m$ CMOS process. It is confirmed that the proposed processor includes logic gates of 3,293K.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10B
• /
• pp.1807-1814
• /
• 1999

This paper considers connectivity-related reliability measures for a class of fault-tolerant shuffle exchange networks to characterize the degrading features over time in the presence of faulty switching elements. The mean number of connected input/output pairs, the mean number of survivable input are considered as connectivity measures. The measures for the unique-path shuffle exchange network(SEN) and its two fault-tolerant variants, extra-stage SEN(SEN+) and INDRA network are derived analytically, and then are compared with numerical experiments.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.5
• /
• pp.795-803
• /
• 2020

In this paper, we study known-key distinguishing and partial-collision attacks on GFN-2 structures with SP F-functions and various block lengths. Firstly, we show the known-key distinguishing attack is possible up to 15 rounds. Secondly, for the case that the last round function has the shuffle operation, we show that the partial-collision attack is possible up to 14 rounds. Finally, for the case that the last round function has no shuffle operation, we show that the partial-collision attacks are possible up to 11 rounds.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.965-968
• /
• 2012

스마트 디바이스 내에 내재된 암호 알고리즘의 이론적인 안전성이 보장되었더라도 연산 수행 시 소모되는 전력소모, 전자기파와 같은 물리적 정보와의 관계를 분석하는 부채널 공격에 대해 취약하다. 이에 대해 부채널 공격의 대표적 대응 기법으로 셔플링 기법과 마스킹 기법이 제안되었다. 특히 셔플링을 활용한 대응 기법은 효율성을 최대한 유지하면서 분석의 난이도를 높이는 기법으로 잘 알려져 왔다. 본 논문에서는 AES 대칭키 암호의 부채널 대응 기법으로 8가지 AES 구현 기법을 셔플링 하여 구현할 경우 부채널 분석에 미치는 영향에 대해 연구하였다. 실험 결과 실제 기대되어지는 분석 난이도는 셔플링을 하지 않은 것에 비해 64배 정도 공격 복잡도가 높아져야 하지만, 실제는 7배정도의 공격 복잡도 증가로 분석이 되었다.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.9
• /
• pp.397-406
• /
• 2017

In case of using the existing encrypted algorithm for massive data encryption service under the cloud environment, the problem that requires much time in data encryption come to the fore. To make up for this weakness, a partial encryption method is used generally. However, the existing partial encryption method has a disadvantage that the encrypted data can be inferred due to the remaining area that is not encrypted. This study proposes a partial encryption method of increasing the encryption speed and complying with the security standard in order to solve this demerit. The proposed method consists of 3 processes such as header formation, partial encryption and block shuffle. In step 1 Header formation process, header data necessary for the algorithm are generated. In step 2 Partial encryption process, a part of data is encrypted, using LEA (Lightweight Encryption Algorithm), and all data are transformed with XOR of data in the unencrypted part and the block generated in the encryption process. In step 3 Block shuffle process, the blocks are mixed, using the shuffle data stored with the random arrangement form in the header to carry out encryption by transforming the data into an unrecognizable form. As a result of the implementation of the proposed method, applying it to a mobile device, all the encrypted data were transformed into an unrecognizable form, so the data could not be inferred, and the data could not be restored without the encryption key. It was confirmed that the proposed method could make prompt treatment possible in encrypting mass data since the encryption speed is improved by approximately 273% or so compared to LEA which is Lightweight Encryption Algorithm.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.11a
• /
• pp.222-222
• /
• 2004

• KIISE Transactions on Computing Practices
• /
• v.23 no.12
• /
• pp.677-683
• /
• 2017

Apache Storm is a representative real-time distributed processing system, which is able to process data streams quickly over distributed servers. Storm currently provides several stream grouping methods to distribute data traffic to multiple servers. Among them, the shuffle grouping may cause a processing delay problem and the local-or-shuffle grouping used to solve the problem may cause the problem of concentrating the traffic on a specific node. In this paper, we propose the locality-aware grouping to solve the problems that may arise in the existing Storm grouping methods. Experimental results show that the proposed locality-aware grouping is considerably superior to the existing shuffle grouping and the local-or-shuffle grouping. These results show that the new grouping is an excellent approach considering both the locality and load balancing which are limitations of the existing Storm.