• Title/Summary/Keyword: seed paper

Search Result 507, Processing Time 0.023 seconds

A Study on the Design of Key Scheduler Block Cryptosystem using PRN (PRN을 이용한 키 스케줄러 블록암호시스템 설계에 관한 연구)

  • 김종협;김환용
    • Journal of the Korea Society of Computer and Information
    • /
    • v.8 no.2
    • /
    • pp.112-121
    • /
    • 2003
  • Information Protection and cryptography technology is developed with if but solved problem of real time processing and secret maintain. Therefore this paper is Proposed new PRN-SEED(Pseudo-Random Number-SEED) for the increasing secret rate and processing rate perform performance analysis with existed other cryptography algorithms. Proposed new PRN-SEED crypto-algorithm increase in the processing rate than existed algorithms use bit and byte mixed operation with RNG(Random Number Generator). PRN-SEED that performs simultaneous operations have higher 1.03 in the processing rate and 2 in the cryptosystem performance than existed cryptosystems. Implementation for PRN-SEED use Synopsys Design Analyser Ver. 1999.10, samsung KG75 library and Synopsys VHDL Debegger. As a simulation result, symmetric cryptosystem DES operate 416Mbps at the 40MHz and Rijndael operate 612Mbps at the 50MHz. PRN-SEED cryptosystem have gate counting 10K and operate 430Mbps at the 40MHz and 630Mbps at the 50MHz.

  • PDF

One Time Password-Based SEED Algorithm for IoT Systems (IoT 시스템을 위한 시간 동기화 방식 기반 SEED 알고리즘)

  • Lee, Sung-Won;Park, Seung-Min;Sim, Kwee-Bo
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.22 no.9
    • /
    • pp.766-772
    • /
    • 2016
  • Recent advances in networking and computers, especially internet of things (IoT) technologies, have improved the quality of home life and industrial sites. However, the security vulnerability of IoT technologies causes life-threatening issues and information leakage concerns. Studies regarding security algorithms are being conducted. In this paper, we proposed SEED algorithms based on one time passwords (OTPs). The specified server sent time data to the client every 10 seconds. The client changed the security key using time data and generated a ciphertext by combining the changed security key and the matrix. We applied the SEED algorithms with enhanced security to Linux-based embedded boards and android smart phones, then conducted a door lock control experiment (door lock & unlock). In this process, the power consumed for decryption was measured. The power consumption of the OTP-based algorithm was measured as 0.405-0.465W. The OTP-based algorithm didn't show any difference from the existing SEED algorithms, but showed a better performance than the existing algorithms.

Improved Tooth Detection Method for using Morphological Characteristic (형태학적 특징을 이용한 향상된 치아 검출 방법)

  • Na, Sung Dae;Lee, Gihyoun;Lee, Jyung Hyun;Kim, Myoung Nam
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.10
    • /
    • pp.1171-1181
    • /
    • 2014
  • In this paper, we propose improved methods which are image conversion and extraction method of watershed seed using morphological characteristic of teeth on complement image. Conventional tooth segmentation methods are occurred low detection ratio at molar region and over, overlap segmentation owing to specular reflection and morphological feature of molars. Therefore, in order to solve the problems of the conventional methods, we propose the image conversion method and improved extraction method of watershed seed. First, the image conversion method is performed using RGB, HSI space of tooth image for to extract boundary and seed of watershed efficiently. Second, watershed seed is reconstructed using morphological characteristic of teeth. Last, individual tooth segmentation is performed using proposed seed of watershed by watershed algorithm. Therefore, as a result of comparison with marker controlled watershed algorithm and the proposed method, we confirmed higher detection ratio and accuracy than marker controlled watershed algorithm.

High Performance Hardware Implementation of the 128-bit SEED Cryptography Algorithm (128비트 SEED 암호 알고리즘의 고속처리를 위한 하드웨어 구현)

  • 전신우;정용진
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.11 no.1
    • /
    • pp.13-23
    • /
    • 2001
  • This paper implemented into hardware SEED which is the KOREA standard 128-bit block cipher. First, at the respect of hardware implementation, we compared and analyzed SEED with AES finalist algorithms - MARS, RC6, RIJNDAEL, SERPENT, TWOFISH, which are secret key block encryption algorithms. The encryption of SEED is faster than MARS, RC6, TWOFISH, but is as five times slow as RIJNDAEL which is the fastest. We propose a SEED hardware architecture which improves the encryption speed. We divided one round into three parts, J1 function block, J2 function block J3 function block including key mixing block, because SEED repeatedly executes the same operation 16 times, then we pipelined one round into three parts, J1 function block, J2 function block, J3 function block including key mixing block, because SEED repeatedly executes the same operation 16 times, then we pipelined it to make it more faster. G-function is implemented more easily by xoring four extended 4 byte SS-boxes. We tested it using ALTERA FPGA with Verilog HDL. If the design is synthesized with 0.5 um Samsung standard cell library, encryption of ECB and decryption of ECB, CBC, CFB, which can be pipelined would take 50 clock cycles to encrypt 384-bit plaintext, and hence we have 745.6 Mbps assuming 97.1 MHz clock frequency. Encryption of CBC, OFB, CFB and decryption of OFB, which cannot be pipelined have 258.9 Mbps under same condition.

Effects of Seed Size and Temperature on Hypocotyl Elongation in Mungbean (녹두품종별 종실크기 및 온도처리에 따른 하배축 신장성)

  • 이성춘;김동철;임태곤;송동석
    • KOREAN JOURNAL OF CROP SCIENCE
    • /
    • v.41 no.6
    • /
    • pp.634-639
    • /
    • 1996
  • This experiment was conducted to evaluate the variability of hypocotyl elongation of mungbean varieties. With four mungbean cultivars, which were classified as 4234-697 and Keumsungnogdu(long), Nampyungnogdu(Medium), and Seonhwanogdu(short), hypocotyl elong-ation was measured 4 to 6 days after seeding in paper towel at different temperatures (15, 20, 25, 30, and 35$^{\circ}C$). Hypocotyl elongation of mungbean seed stored at 5$\pm$1$^{\circ}C$ for 6 months was compared with of seed stored at room temperature. As the temperature rises, the hypocotyl is longer. The hypocotyl elongation started immediately at high temperature, and longest at the range of 30 to 35$^{\circ}C$. The hypocotyl elongation became longer at the 5$^{\circ}C$ storage plot than at the room temperature plot. Correlation coefficient (r) between 100 seed weight and hypocotyllength are not significant.

  • PDF

Evaluation of Alfalfa Autotoxicity on Germination and Early Seedling Growth of 3 Cultivars

  • Chon, Sang-Uk;Choi, Seong-Kyu
    • Plant Resources
    • /
    • v.3 no.1
    • /
    • pp.71-78
    • /
    • 2000
  • Autotoxicity restricts reseeding of new alfalfa(Medicago sativa L.) after alfalfa until autotoxic chemical(s) breaks down or is dispersed into external environments, often requiring up to a year or more. One solution for reducing autotoxicity would be to select germplasms or cultivars with tolerance to the autotoxic chemical(5) and use genetically breeding program. Bioassay of seed germination and early seedling growth was conducted to evaluate autotoxic responses of 3 varieties of alfalfa to the water-soluble extracts(at 4 and 8g/L) from alfalfa ‘Cody’leaf by using agar and filter paper medium in a petri-dish assay. Root length at 5 days after seeding was more sensitive to the extract than was hypocotyl length or seed germination, and was a better parameter of autotoxic effects of alfalfa leaf extracts. Use of an agar medium gave better sensitivity of root length than did use of filter paper. Evaluating tolerance with percent of control was more important indicator than was mean of root length because of significant variation among varieties in root length of control treatment. Bioassay ranked varieties in the following order of tolerance on the basis of relative root length; “Cody” >“ Pioneer 5373” >“ Alfagraze”. Seedling growth from old “Cody” seed was more sensitive to the autotoxic chemical(5) than was that from newly produced seed.

  • PDF

Metrics for Code Quality Check in SEED_mode.c

  • Jin-Kuen Hong
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.16 no.3
    • /
    • pp.184-191
    • /
    • 2024
  • The focus of this paper is secure code development and maintenance. When it comes to safe code, it is most important to consider code readability and maintainability. This is because complex code has a code smell, that is, a structural problem that complicates code understanding and modification. In this paper, the goal is to improve code quality by detecting and removing smells existing in code. We target the encryption and decryption code SEED.c and evaluate the quality level of the code using several metrics such as lines of code (LOC), number of methods (NOM), number of attributes (NOA), cyclo, and maximum nesting level. We improved the quality of SEED.c through systematic detection and refactoring of code smells. Studies have shown that refactoring processes such as splitting long methods, modularizing large classes, reducing redundant code, and simplifying long parameter lists improve code quality. Through this study, we found that encryption code requires refactoring measures to maintain code security.

Analysis on Vulnerability of Masked SEED Algorithm (마스킹 기법이 적용된 SEED 알고리즘에 대한 취약점 분석)

  • Kim, TaeWon;Chang, Nam Su
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.25 no.4
    • /
    • pp.739-747
    • /
    • 2015
  • Masking technique that is most widely known as countermeasure against power analysis attack prevents leakage for sensitive information during the implementations of cryptography algorithm. it have been studied extensively until now applied on block cipher algorithms. Masking countermeasure have been applied to international standard SEED algorithm. Masked SEED algorithm proposed by Cho et al, not only protects against first order power analysis attacks but also efficient by reducing the execution of Arithmetic to Boolean converting function. In this paper, we analyze the vulnerability of Cho's algorithm against first order power analysis attacks. We targeted additional pre-computation to improve the efficiency in order to recover the random mask value being exploited in first order power analysis attacks. We describe weakness by considering both theoretical and practical aspects and are expecting to apply on every device equipped with cho's algorithm using the proposed attack method.

Gene Expression Data Analysis Using Seed Clustering (시드 클러스터링 방법에 의한 유전자 발현 데이터 분석)

  • Shin Myoung
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.42 no.1
    • /
    • pp.1-7
    • /
    • 2005
  • Cluster analysis of microarray data has been often used to find biologically relevant Broups of genes based on their expression levels. Since many functionally related genes tend to be co-expressed, by identifying groups of genes with similar expression profiles, the functionalities of unknown genes can be inferred from those of known genes in the same group. In this Paper we address a novel clustering approach, called seed clustering, and investigate its applicability for microarray data analysis. In the seed clustering method, seed genes are first extracted by computational analysis of their expression profiles and then clusters are generated by taking the seed genes as prototype vectors for target clusters. Since it has strong mathematical foundations, the seed clustering method produces the stable and consistent results in a systematic way. Also, our empirical results indicate that the automatically extracted seed genes are well representative of potential clusters hidden in the data, and that its performance is favorable compared to current approaches.

A Study on S-Function in SEED Cryptosystem (SEED암호에서 S-함수에 대한 고찰)

  • Yang, Jeong-Mo
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.27 no.6
    • /
    • pp.1295-1305
    • /
    • 2017
  • There is SEED cryptosystem in domestic block cipher standard. This code was drafted by the Korea Information Security Agency (KISA) in October 1998 and underwent a public verification process in December of the same year, which resulted in the final amendment to improve safety and performance. Unlike DES, it is a 128-bit block cipher that has been passed through various processes and established in 2005 as an international standard. It is a block cipher with a pastel structure like DES, but the input bit block has been increased to 128 bits, double DES. In this paper, first, we introduce the general algorithm of SEED cryptosystem and analyzed mathematically generating principle of key-value which is used in F-function. Secondly, we developed a table that calculates the exponent of the primitive element ${\alpha}$ corresponding to the 8-bit input value of the S-function and finally analyzed calculating principle of S-function designed in G-function through the new theorem and example. Through this course, we hope that it is to be suggest the ideas and background theory needed in developing new cryptosystem to cover the weakness of SEED cryptosystem.