• Transactions on Electrical and Electronic Materials
• /
• v.18 no.2
• /
• pp.70-73
• /
• 2017

We investigated n-i-p type single junction hydrogenated amorphous silicon oxide solar cells. These cells were without front surface texture or back reflector. Maximum power point efficiency of these cells showed that an optimized device structure is needed to get the best device output. This depends on the thickness and defect density ($N_d$) of the active layer. A typical 10% photovoltaic device conversion efficiency was obtained with a $N_d=8.86{\times}10^{15}cm^{-3}$ defect density and 630 nm active layer thickness. Our investigation suggests a correlation between defect density and active layer thickness to device efficiency. We found that amorphous silicon solar cell efficiency can be improved to well above 10%.

• Current Photovoltaic Research
• /
• v.2 no.2
• /
• pp.41-47
• /
• 2014

Extensive investigation on silicon based thin film reveals a wide range of film characteristics, from low optical gap to high optical gap, from amorphous to micro-crystalline silicon etc. Fabrication of single junction, tandem and triple junction solar cell with suitable materials, indicate that fabrication of solar cell of a relatively moderate efficiency is possible with a better light induced stability. Due to these investigations, various competing materials like wide band gap silicon carbide and silicon oxide, low band gap micro-crystalline silicon and silicon germanium etc were also prepared and applied to the solar cells. Such a multi-junction solar cell can be a technologically promising photo-voltaic device, as the external quantum efficiency of such a cell covers a wider spectral range.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.3
• /
• pp.419-426
• /
• 2021

A high-performance elliptic curve cryptography processor (HP-ECCP) was designed to support five field sizes of 192, 224, 256, 384 and 521 bits over GF(p) defined in NIST FIPS 186-2, and it provides eight modes of arithmetic operations including ECPSM, ECPA, ECPD, MA, MS, MM, MI and MD. In order to make the HP-ECCP resistant to side-channel attacks, a modified left-to-right binary algorithm was used, in which point addition and point doubling operations are uniformly performed regardless of the Hamming weight of private key used for ECPSM. In addition, Karatsuba-Ofman multiplication algorithm (KOMA), Lazy reduction and Nikhilam division algorithms were adopted for designing high-performance modular multiplier that is the core arithmetic block for elliptic curve point operations. The HP-ECCP synthesized using a 180-nm CMOS cell library occupied 620,846 gate equivalents with a clock frequency of 67 MHz, and it was evaluated that an ECPSM with a field size of 256 bits can be computed 2,200 times per second.

• KIPS Transactions on Computer and Communication Systems
• /
• v.12 no.2
• /
• pp.69-76
• /
• 2023

Hundreds of thousands of passwords are lost or forgotten every year, making the necessary information unavailable to legitimate owners or authorized law enforcement personnel. In order to recover such a password, a tool for password cracking is required. Using GPUs instead of CPUs for password cracking can quickly process the large amount of computation required during the recovery process. This paper optimizes on GPUs using CUDA, with a focus on decryption of the currently most popular PDF 1.4-1.6 version. Techniques such as eliminating unnecessary operations of the MD5 algorithm, implementing 32-bit word integration of the RC4 algorithm, and using shared memory were used. In addition, autotune techniques were used to search for the number of blocks and threads that affect performance improvement. As a result, we showed throughput of 31,460 kp/s (kilo passwords per second) and 66,351 kp/s at block size 65,536, thread size 96 in RTX 3060, RTX 3090 environments, and improved throughput by 22.5% and 15.2%, respectively, compared to the cracking tool hashcat that achieves the highest throughput.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.4 no.2
• /
• pp.369-378
• /
• 2014

The Reed-Muller code is one of the efficient algorithms for multiple bit error correction, however, its high-computation requirement inherent in the decoding process prohibits its use in practical applications. To solve this problem, this paper proposes a graphics processing unit (GPU)-based parallel error control approach using Reed-Muller R(r, m) coding for real-time wireless communication systems. GPU offers a high-throughput parallel computing platform that can achieve the desired high-performance decoding by exploiting massive parallelism inherent in the algorithm. In addition, we compare the performance of the GPU-based approach with the equivalent sequential approach that runs on the traditional CPU. The experimental results indicate that the proposed GPU-based approach exceedingly outperforms the sequential approach in terms of execution time, yielding over 70× speedup.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11a
• /
• pp.205-208
• /
• 2002

본 논문에서는 기존의 그리드 컴퓨팅을 위한 미들웨어인 Globus의 정보 서비스 시스템인 MDS의 확장된 정보시스템 설계를 기술한다. 제안된 시스템은 자원 접근 및 발견을 위해 P2P 기반의 결함 포용을 갖는 강건하고 적응형 정보 서비스를 제공한다. MDS 는 가상 조직(Virtual Organization, VO) 으로 이루어진 네트워크 상에 자원의 위치 및 상태 정보를 제공하는 디렉토리 서비스이다. 그러나 현재 MDS 시스템은 결함의 기점(Single-point failure) 및 중복으로 등록된 자원에 대한 추가적인 트래픽을 발생시킨다. P2P 기반 정보 서비스 시스템은 기존의 클라이언트/서버 기반의 정보 서비스에 비해 정보의 가용성이 높고 수동적인 정보 서비스 수행 객체인 VO의 자치성을 보장함으로써 그리드 컴퓨팅 자원에 대한 유효한 실시간 접근을 제공한다. 또한 그리드 컴퓨팅의 확장으로 그리드 컴퓨팅에 참여하는 자원의 수가 증가함에 따라 정보 서비스 시스템의 확장성 및 정보 서비스의 개체인 VO간의 자기 조직화(self-organization)를 지원한다.

• Korean Journal of Agricultural Science
• /
• v.48 no.4
• /
• pp.703-718
• /
• 2021

An irrigation monitoring system is an efficient approach to save water and to provide effective irrigation scheduling for rice cultivation in desert soils. This research aimed to design, fabricate, and evaluate the basic performance of an irrigation monitoring system based on information and communication technology (ICT) for rice cultivation under drip and micro-sprinkler irrigation in desert soils using a Raspberry Pi. A data acquisition system was installed and tested inside a rice cultivating net house at the United Arab Emirates University, Al-Foah, Al-Ain. The Raspberry Pi operating system was used to control the irrigation and to monitor the soil water content, ambient temperature, humidity, and light intensity inside the net house. Soil water content sensors were placed in the desert soil at depths of 10, 20, 30, 40, and 50 cm. A sensor-based automatic irrigation logic circuit was used to control the actuators and to manage the crop irrigation operations depending on the soil water content requirements. A developed webserver was used to store the sensor data and update the actuator status by communicating via the Pi-embedded Wi-Fi network. The maximum and minimum average soil water contents, ambient temperatures, humidity levels, and light intensity values were monitored as 33.91 ± 2 to 26.95 ± 1%, 45 ± 3 to 24 ± 3℃, 58 ± 2 to 50 ± 4%, and 7160-90 lx, respectively, during the experimental period. The ICT-based monitoring system ensured precise irrigation scheduling and better performance to provide an adequate water supply and information about the ambient environment.

• Journal of information and communication convergence engineering
• /
• v.16 no.3
• /
• pp.166-172
• /
• 2018

A pseudo-random sequence generated by using a primitive polynomial, trace function, and Legendre symbol has been researched in our previous work. Our previous sequence has some interesting features such as period, autocorrelation, and linear complexity. A pseudo-random sequence widely used in cryptography. However, from the aspect of the practical use in cryptographic systems sequence needs to generate swiftly. Our previous sequence generated by utilizing a primitive polynomial, however, finding a primitive polynomial requires high calculating cost when the degree or the characteristic is large. It’s a shortcoming of our previous work. The main contribution of this work is to find some relation between the generated sequence and irreducible polynomials. The purpose of this relationship is to generate the same sequence without utilizing a primitive polynomial. From the experimental observation, it is found that there are (p - 1)/2 kinds of polynomial, which generates the same sequence. In addition, some of these polynomials are non-primitive polynomial. In this paper, these relationships between the sequence and the polynomials are shown by some examples. Furthermore, these relationships are proven theoretically also.

• Journal of information and communication convergence engineering
• /
• v.15 no.2
• /
• pp.97-103
• /
• 2017

Implementation of faster pairing calculation is the basis of efficient pairing-based cryptographic protocol implementation. Generally, pairing is a costly operation carried out over the extension field of degree $k{\geq}12$. But the twist property of the pairing friendly curve allows us to calculate pairing over the sub-field twisted curve, where the extension degree becomes k/d and twist degree d = 2, 3, 4, 6. The calculation cost is reduced substantially by twisting but it makes the discrete logarithm problem easier if the curve parameters are not carefully chosen. Therefore, this paper considers the most recent parameters setting presented by Barbulescu and Duquesne [1] for pairing-based cryptography; that are secure enough for 128-bit security level; to explicitly show the quartic twist (d = 4) and sextic twist (d = 6) mapping between the isomorphic rational point groups for KSS (Kachisa-Schaefer-Scott) curve of embedding degree k = 16 and k = 18, receptively. This paper also evaluates the performance enhancement of the obtained twisted mapping by comparing the elliptic curve scalar multiplications.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.6
• /
• pp.1158-1165
• /
• 2004

This paper describes the design of a two stage 1V power supply SiGe Low Noise Amplifier operating at 5.25㎓ for 802.lla wireless LAN application. The achieved performance includes a gain of 17㏈, noise figure of 2.7㏈, reflection coefficient of 15㏈, IIP3 of -5㏈m, and 1-㏈ compression point of -14㏈m. The total power consumption of the circuit was 7㎽ including 0.5㎽ for the bias circuit.