• Title/Summary/Keyword: Parallel Implementation

Search Result 880, Processing Time 0.031 seconds

Implementation of an Algorithm that Generates Minimal Spanning Ladders and Exploration on its relevance with Computational Thinking (최소생성사다리를 생성하는 알고리즘 구현 및 컴퓨팅 사고력과의 관련성 탐구)

  • Jun, Youngcook
    • The Journal of Korean Association of Computer Education
    • /
    • v.21 no.6
    • /
    • pp.39-47
    • /
    • 2018
  • This paper dealt with investigating the number of minimal spanning ladders originated from ladder game and their properties as well as the related computational thinking aspects. The author modified the filtering techniques to enhance Mathematica project where a new type of graph was generated based on the algorithm using a generator of firstly found minimal spanning graph by repeatedly applying independent ladder operator to a subsequence of ladder sequence. The newly produced YC graphs had recursive and hierarchical graph structures and showed the properties of edge-symmetric. As the computational complexity increased the author divided the whole search space into the each floor of the newly generated minimal spanning graphs for the (5, 10) YC graph and the higher (6, 15) YC graph. It turned out that the computational thinking capabilities such as data visualization, abstraction, and parallel computing with Mathematica contributed to enumerating the new YC graphs in order to investigate their structures and properties.

Implementation of Omni-directional Image Viewer Program for Effective Monitoring (효과적인 감시를 위한 전방위 영상 기반 뷰어 프로그램 구현)

  • Jeon, So-Yeon;Kim, Cheong-Hwa;Park, Goo-Man
    • Journal of Broadcast Engineering
    • /
    • v.23 no.6
    • /
    • pp.939-946
    • /
    • 2018
  • In this paper, we implement a viewer program that can monitor effectively using omni-directional images. The program consists of four modes: Normal mode, ROI(Region of Interest) mode, Tracking mode, and Auto-rotation mode, and the results for each mode is displayed simultaneously. In the normal mode, the wide angle image is rendered as a spherical image to enable pan, tilt, and zoom. In ROI mode, the area is displayed expanded by selecting an area. And, in Auto-rotation mode, it is possible to track the object by mapping the position of the object with the rotation angle of the spherical image to prevent the object from deviating from the spherical image in Tracking mode. Parallel programming for processing of multiple modes is performed to improve the processing speed. This has the advantage that various angles can be seen compared with surveillance system having a limited angle of view.

High-Speed Implementations of Block Ciphers on Graphics Processing Units Using CUDA Library (GPU용 연산 라이브러리 CUDA를 이용한 블록암호 고속 구현)

  • Yeom, Yong-Jin;Cho, Yong-Kuk
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.18 no.3
    • /
    • pp.23-32
    • /
    • 2008
  • The computing power of graphics processing units(GPU) has already surpassed that of CPU and the gap between their powers is getting wider. Thus, research on GPGPU which applies GPU to general purpose becomes popular and shows great success especially in the field of parallel data processing. Since the implementation of cryptographic algorithm using GPU was started by Cook et at. in 2005, improved results using graphic libraries such as OpenGL and DirectX have been published. In this paper, we present skills and results of implementing block ciphers using CUDA library announced by NVIDIA in 2007. Also, we discuss a general method converting source codes of block ciphers on CPU to those on GPU. On NVIDIA 8800GTX GPU, the resulting speeds of block cipher AES, ARIA, and DES are 4.5Gbps, 7.0Gbps, and 2.8Gbps, respectively which are faster than the those on CPU.

Comparison of Home Automation System Using IPV-4 and IPV-6 Based On Mitigate Reconnaissance Attacks

  • Ali, Muhammad Shujat;Siddiq, Imran;Faisal, Abdullah;Awan, Muhammad Zubair
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.2
    • /
    • pp.341-347
    • /
    • 2022
  • This research is designed to help and offer hold up to complete the requirements of aged and disable in a home. The control approach and the tone approach are used to manage the house appliances. The major organize system implementation in technology of wireless to offer distant contact from a phone Internet Protocol connectivity for access and calculating strategy and appliance remotely. The planned system no need a committed server PC with value of parallel systems and offers a new communication-protocol to observe and control a house environment with more than just the switch functionality. To express the possibility and efficiency of this system, devices like as lights switches, power plugs, and motion-sensors have been included with the planned home control system and supply more security manage on the control with low electrical energy activate method. The rank of switches is corresponding in all this control system whereby all user interfaces indicate the real time existing status. This system planned to manage electrical-appliances and devices in house with reasonably low cost of design, user friendly interface, easily install and provide high security. Research community generally specified that the network "Reconnaissance Attacks" in IPv6 are usually impossible due to they will take huge challenge to carry out address scanning of 264 hosts in an IPv6 subnet."It being deployed of IPv6 shows that it definitely enhances security and undermines the probability". This research of the IPv6 addressing-strategies at present utilizes and planned a new strategy and move toward to "mitigate reconnaissance attacks".

Design and Implementation of Distributed Cluster Supporting Dynamic Down-Scaling of the Cluster (노드의 동적 다운 스케일링을 지원하는 분산 클러스터 시스템의 설계 및 구현)

  • Woo-Seok Ryu
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.18 no.2
    • /
    • pp.361-366
    • /
    • 2023
  • Apache Hadoop, a representative framework for distributed processing of big data, has the advantage of increasing cluster size up to thousands of nodes to improve parallel distributed processing performance. However, reducing the size of the cluster is limited to the extent of permanently decommissioning nodes with defects or degraded performance, so there are limitations to operate multiple nodes flexibly in small clusters. In this paper, we discuss the problems that occur when removing nodes from the Hadoop cluster and propose a dynamic down-scaling technique to manage the distributed cluster more flexibly. To do this, we design and implement a modified Hadoop system and interfaces to support dynamic down-scaling of the cluster which supports temporary pause of a node and reconnection of it when necessary, rather than decommissioning the node when removing a node from the Hadoop cluster. We have verified that effective downsizing can be performed without performance degradation based on experimental results.

Principles and Considerations of Bender Element Tests (벤더엘리먼트 시험의 원리와 고려사항)

  • Lee Jong-Sub;Lee Chang-Ho
    • Journal of the Korean Geotechnical Society
    • /
    • v.22 no.5
    • /
    • pp.47-57
    • /
    • 2006
  • The shear wave velocity is related with the stiffness of granular skeleton and mass density. The shear stiffness of the granular skeleton remains unaffected by the presence of the fluid. Bender elements are convenient shear wave transducers for instrumenting soil cells due to optimal soil-transducer coupling. This study addresses the principles of the shear wave, the design and implementation of bender elements including electromagnetic coupling prevention, directivity, resonant frequency, detection of first arrival, and near field effects. It is shown that electromagnetic coupling effects can be minimized using parallel-type bender elements. Thus, the in-plane S-wave directivity is quasi-circular. The resonant frequency of bender element installations depends on the geometry of the bender element, the anchor efficiency and the soil stiffness. One of the most cumbersome parts in the bender element test is near field effects, which affect the selection of arrival time. The selection of the first arrival within the near field Is effectively solved by the multiple reflection technique and signal matching technique. Bender elements, which requires several considerations, may be effective tools for the subsurface characterization by using S-wave.

A New BISON-like Construction Block Cipher: DBISON

  • Zhao, Haixia;Wei, Yongzhuang;Liu, Zhenghong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.5
    • /
    • pp.1611-1633
    • /
    • 2022
  • At EUROCRYPT 2019, a new block cipher algorithm called BISON was proposed by Canteaut et al. which uses a novel structure named as Whitened Swap-Or-Not (WSN). Unlike the traditional wide trail strategy, the differential and linear properties of this algorithm can be easily determined. However, the encryption speed of the BISON algorithm is quite low due to a large number of iterative rounds needed to ensure certain security margins. Commonly, denoting by n is the data block length, this design requires 3n encryption rounds. Moreover, the block size n of BISON is always odd, which is not convenient for operations performed on a byte level. In order to overcome these issues, we propose a new block cipher, named DBISON, which more efficiently employs the ideas of double layers typical to the BISON-like construction. More precisely, DBISON divides the input into two parts of size n/2 bits and performs the round computations in parallel, which leads to an increased encryption speed. In particular, the data block length n of DBISON can be even, which gives certain additional implementation benefits over BISON. Furthermore, the resistance of DBISON against differential and linear attacks is also investigated. It is shown the maximal differential probability (MDP) is 1/2n-1 for n encryption rounds and that the maximal linear probability (MLP) is strictly less than 1/2n-1 when (n/2+3) iterative encryption rounds are used. These estimates are very close to the ideal values when n is close to 256.

Optimized implementation of block cipher PIPO in parallel-way on 64-bit ARM Processors (64-bit ARM 프로세서 상에서의 블록암호 PIPO 병렬 최적 구현)

  • Eum, Si-Woo;Kwon, Hyeok-Dong;Kim, Hyun-Jun;Jang, Kyung-Bae;Kim, Hyun-Ji;Park, Jae-Hoon;Sim, Min-Joo;Song, Gyeong-Ju;Seo, Hwa-Jeong
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2021.05a
    • /
    • pp.163-166
    • /
    • 2021
  • ICISC'20에서 발표된 경량 블록암호 PIPO는 비트 슬라이스 기법 적용으로 효율적인 구현이 되었으며, 부채널 내성을 지니기에 안전하지 않은 환경에서도 안정적으로 사용 가능한 경량 블록암호이다. 본 논문에서는 ARM 프로세서를 대상으로 PIPO의 병렬 최적 구현을 제안한다. 제안하는 구현물은 8평문, 16평문의 병렬 암호화가 가능하다. 구현에는 최적의 명령어 활용, 레지스터 내부 정렬, 로테이션 연산 최적화 기법을 사용하였다. 구현은 A10x fusion 프로세서를 대상으로 한다. 대상 프로세서상에서, 기존 레퍼런스 PIPO 코드는 64/128, 64/256 규격에서 각각 34.6 cpb, 44.7 cpb의 성능을 가지나, 제안하는 기법은 8평문 64/128, 64/256 규격에서 각각 12.0 cpb, 15.6 cpb, 16평문 64/128, 64/256 규격에서 각각 6.3 cpb, 8.1 cpb의 성능을 보여준다. 이는 기존 대비 각 규격별로 8평문 병렬 구현물은 약 65.3%, 66.4%, 16평문 병렬 구현물은 약 81.8%, 82.1% 더 좋은 성능을 보인다.

Identification of indirect effects in the two-condition within-subject mediation model and its implementation using SEM

  • Eujin Park;Changsoon Park
    • Communications for Statistical Applications and Methods
    • /
    • v.30 no.6
    • /
    • pp.631-652
    • /
    • 2023
  • In the two-condition within-subject mediation design, pairs of variables such as mediator and outcome are observed under two treatment conditions. The main objective of the design is to investigate the indirect effects of the condition difference (sum) on the outcome difference (sum) through the mediator difference (sum) for comparison of two treatment conditions. The natural condition variables mean the original variables, while the rotated condition variables mean the difference and the sum of two natural variables. The outcome difference (sum) is expressed as a linear model regressed on two natural (rotated) mediators as a parallel two-mediator design in two condition approaches: the natural condition approach uses regressors as the natural condition variables, while the rotated condition approach uses regressors as the rotated condition variables. In each condition approach, the total indirect effect on the outcome difference (sum) can be expressed as the sum of two individual indirect effects: within- and cross-condition indirect effects. The total indirect effects on the outcome difference (sum) for both condition approaches are the same. The invariance of the total indirect effect makes it possible to analyze the nature of two pairs of individual indirect effects induced from the natural conditions and the rotated conditions. The two-condition within-subject design is extended to the addition of a between-subject moderator. Probing of the conditional indirect effects given the moderator values is implemented by plotting the bootstrap confidence intervals of indirect effects against the moderator values. The expected indirect effect with respect to the moderator is derived to provide the overall effect of moderator on the indirect effect. The model coefficients are estimated by the structural equation modeling approach and their statistical significance is tested using the bias-corrected bootstrap confidence intervals. All procedures are evaluated using function lavaan() of package {lavaan} in R.

Efficient CHAM-Like Structures on General-Purpose Processors with Changing Order of Operations (연산 순서 변경에 따른 범용 프로세서에서 효율적인 CHAM-like 구조)

  • Myoungsu Shin;Seonkyu Kim;Hanbeom Shin;Insung Kim;Sunyeop Kim;Donggeun Kwon;Deukjo Hong;Jaechul Sung;Seokhie Hong
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.34 no.4
    • /
    • pp.629-639
    • /
    • 2024
  • CHAM is designed with an emphasis on encryption speed, considering that in the ISO/IEC standard block cipher operation mode, encryption functions are used more often than decryption functions. In the superscalar architecture of modern general-purpose processors, different ordering of operations can lead to different processing speeds, even if the computation configuration is the same. In this paper, we analyze the implementation efficiency and security of CHAM-like structures, which rearrange the order of operations in the ARX-based block cipher CHAM, for single-block and parallel implementations in a general-purpose processor environment. The proposed structures are at least 9.3% and at most 56.4%efficient in terms of encryption speed. The security analysis evaluates the resistance of the CHAM-like structures to differential and linear attacks. In terms of security margin, the difference is 3.4% for differential attacks and 6.8%for linear attacks, indicating that the security strength is similar compared to the efficiency difference. These results can be utilized in the design of ARX-based block ciphers.