• ETRI Journal
• /
• 제43권4호
• /
• pp.746-757
• /
• 2021

Side-channel attacks pose an inevitable challenge to the implementation of cryptographic algorithms, and it is important to mitigate them. This work identifies a novel data encoding technique based on 1-of-4 codes to resist differential power analysis attacks, which is the most investigated category of side-channel attacks. The four code words of the 1-of-4 codes, namely (0001, 0010, 1000, and 0100), are split into two sets: set-0 and set-1. Using a select signal, the data processed in hardware is switched between the two encoding sets alternately such that the Hamming weight and Hamming distance are equalized. As a case study, the proposed technique is validated for the NIST standard AES-128 cipher. The proposed technique resists differential power analysis performed using statistical methods, namely correlation, mutual information, difference of means, and Welch's t-test based on the Hamming weight and distance models. The experimental results show that the proposed countermeasure has an area overhead of 2.3× with no performance degradation comparatively.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제34권12호
• /
• pp.1056-1064
• /
• 2007

생체분자 컴퓨팅은 DNA와 같은 생체 분자를 이용하여 정보를 표현하고 처리하는 새로운 컴퓨팅 패러다임이다. 작은 부피에 존재하는 무수히 많은 분자와 화학 반응에 내재된 대규모 병렬성은 새로운 개념의 고성능 계산 기법에 영감을 주었고 이를 바탕으로 다양한 계산 모델 및 문제 해결을 위한 분자알고리즘이 개발되었다. 한편 생체 분자를 이용한 정보처리라는 특징은 생물학 문제에 적용될 수 있는 가능성을 시사한다. 유전자 발현 패턴과 같은 생화학적 분자 정보의 분석을 위한 도구로서의 가능성을 가지고 있는 것이다. 이러한 맥락에서 DNA 컴퓨팅 기반의 생체분자 퍼셉트론 모델이 제안되었고 그 실험적 구현 결과가 제시된 바 있다. 생체분자 퍼셉트론의 핵심인 가중치 표현 및 가중치-합 연산은 입력 분자와 가중치를 표현하는 프로브 분자간의 경쟁적 혼성화 반응에 기반하고 있다. 그러나 그 혼성화 반응에서 열역학적 대칭성을 가정하고 있기 때문에 사용하는 프로브에 따라 가중치 표현의 오차가 있을 수 있다. 본 논문에서는 비대칭적인 열역학적 특성을 고려하여 일반화된 혼성화 반응 모델을 제시하고, 이를 바탕으로 신뢰성 있는 생체 분자 퍼셉트론의 구현을 위한 가중치 코딩 방법을 제안한다. 그리고 본 논문에서 제시한 가중치 표현 방법의 정확성을 이전 모델과 컴퓨터 시뮬레이션을 통해 비교하고 한계 오차를 만족하기 위한 조건을 제시한다.

• 정보처리학회논문지B
• /
• 제11B권2호
• /
• pp.177-186
• /
• 2004

비디오 압축에 사용되는 움직임 예측은 많은 계산과정을 요구하기 때문에 전체적인 부호기 복잡도를 높이는 단점을 지닌다. 이러한 부호기의 복잡도를 줄이기 위해 3D-WT과 같은 움직임 예측을 사용하지 않는 연구들이 소개되고 있다. 하지만, 기존의 3D-WT 기법들은 부호화를 위한 과도한 메모리 요구사항과 복호를 위한 수신 측의 지연시간이 가장 큰 단점으로 지적되었다. 본 논문에서는 수정된 Haar wavelet filter와 개선된 부호화 알고리즘을 통해서 메모리 사용량과 재생을 위한 지연시간을 최소로 하는 확장 가능한 3D-WT 기법인 FS(Fast playable and Scalable) 3D-WT를 소개한다. 3D-WT 중 가장 개선된 형태인 3D-V 기법과의 실험 결과 3D-V와 거의 비슷한 계산 처리 시간으로 높은 압축률과 수신 측에서의 짧은 지연시간을 보였다.

• Journal of Microbiology and Biotechnology
• /
• 제7권2호
• /
• pp.132-137
• /
• 1997

A novel protein (HEAAE, High Essential Amino Acid Encoding Protein), rich in essential amino acids ($75{\%}$ of total), was designed and constructed in our laboratory. The designed peptides were analyzed by SYBLE and stable secondary and tertiary structures were predicted. The monomeric form (HEAAE-1) of the protein consists of 20 amino acid residues with four additional amino acids comprising a potential ${\beta}$-turn (HEAAE-4). Size exclusion analysis demonstrated that the monomer is self-aggregates in aqueous solution to form higher ordered multimeric structures, which are very reminiscent of natural plant storage proteins. The DNA encoding this amino acid sequence was synthesized, and from this monomeric gene fragment (heaae-1), the stable tetrameric form of the gene (heaae-4) was generated by subcloning into the E. coli expression vector pKK223-3. A clear 6 kDa polypeptide band corresponding to the molecular weight of the dimeric form (HEAAE-2) was detected. The smeared band which appeared around the molecular weight corresponding to HEAAE-4 of 11 kDa suggested that the tetramer form of this protein might be processed into smaller size products.

• Industrial Engineering and Management Systems
• /
• 제8권1호
• /
• pp.14-21
• /
• 2009

We formulate a mathematical model of remanufacturing system as multi-stage reverse Logistics Network Problem (mrLNP) with minimizing the total costs for reverse logistics shipping cost and inventory holding cost at disassembly centers and processing centers over finite planning horizons. For solving this problem, in the 1st and the 2nd stages, we propose a Genetic Algorithm (GA) with priority-based encoding method combined with a new crossover operator called as Weight Mapping Crossover (WMX). A heuristic approach is applied in the 3rd stage where parts are transported from some processing centers to one manufacturer. Computer simulations show the effectiveness and efficiency of our approach. In numerical experiments, the results of the proposed method are better than pnGA (Prufer number-based GA).

• Journal of Communications and Networks
• /
• 제4권3호
• /
• pp.170-175
• /
• 2002

An optical fiber code-division multiple-access (CDMA) network is proposed in which encoding is based on the use of concatenated sequences of relatively large weight. The first short component sequence in the concatenated sequence permits realistic electronic encoding of each data bit. The chips of this sequence are then all-optically encoded at substantially higher rate. In spite of the relatively large weight of the sequence the all-optical encoder is practical by virtue of the shortness of the component sequences. The use of Gold and Lempel sequences as component sequences for generating the concatenated sequences is studied and the bit-error rate (BER) performance of the proposed system is presented as a function of the received optical power with the number of simultaneous users as parameter.

• 생명과학회지
• /
• 제9권4호
• /
• pp.341-347
• /
• 1999

Insects use chitinolytic enzyme to digest chitin in the exoskelton during the molting process. We have isolated and sequenced a chitinase-encoding cDNA from the silkworm, Bombyx mandarina, compared its sequenced with genes encoding chitinolytic enzymes from other sources. The insert DNA in the clone is 2,675 nucleotides long with an open reading frame of 1,695 uncletides that encodes a protein of 565 amino acids with a molecuar weight of 63.4 kDa. The 3' -untranslated region of 889 nucleotides is AT-rich and contains two putative polyadenylation signals. The N-terminal sequence of the encoded protein contains numerous hydrophobic residues characteristic of a leader peptide. The amino acid alignment revealed that the endo-$\beta$-N-acetylglucosaminidase had 83% and 97% homology with M. sexta and B. mori, respectively. The deduced amino acid had two highly conserved region at the amino acid residues 97-111 and 139-148 that were related to the existing chitinase.

• Journal of Plant Biology
• /
• 제32권1호
• /
• pp.33-40
• /
• 1989

Polysomal polyadenylated mRNAs which were purified from pea leaves were fractionated by sucrose grandient sedimentation. Fractions corresponding to the peak at 11.5S were found to contain mostly mRNA encoding the precursor polypeptide to the small subunit of ribulose bisphosphate carboxylase (rbcS) by in vitro translation in wheat germ extract. Double-stranded cDNA which was synthesized from the 11.5S mRNA was cloned into Hind III site of plasmid pBR 325. A cDNA clone, H24, was identified to code for rbcS. In vitro translation product of the hybridization-selected mRNA was molecular weight 20,000, presumably the precursor of rbcS. The nucleotide sequences of the H24 showed almost complete homology with the sequences encoding the transit peptide of the rbcS-3A gene which was reported by Fluhr et al.(1986).

• Management Science and Financial Engineering
• /
• 제14권1호
• /
• pp.87-90
• /
• 2008

We show that when a max-cut problem is allowed native-weight edges, to decide if the problem has a cut of a positive weight is NP-hard. This implies that there is no polynomial time algorithm which guarantees a cut whose objective value is no less than $1/p(<I>)$ times the optimum for any polynomially computable polynomial p, where denotes the encoding length of an instance I.