• Title/Summary/Keyword: SHA-3 candidate

Search Result 5, Processing Time 0.014 seconds

Side-channel Attack on the Final Round SHA-3 Candidate Skein (SHA-3 최종 라운드 후보 Skein에 대한 부채널 공격 방법)

  • Park, Ae-Sun;Park, Jong-Yeon;Han, Dong-Guk;Yi, Ok-Yeon
    • The KIPS Transactions:PartC
    • /
    • v.19C no.3
    • /
    • pp.179-184
    • /
    • 2012
  • Due to the absence of an alternative algorithm SHA-2, NIST (National Institute of Standards and Technology) is proceeding to development project of SHA-3. NIST announced five candidates of the final round at the end of 2010. Side-channel attack scenarios of five candidates for SHA-3 final round have been proposed. In this paper, we prove the possibility of the analysis against 32-bit modular addition by 8-bit blocks from our experiment on ARM chip board with a register size of 32-bit. In total we required 9700 power traces to successfully recover the 128-bit secret key for the attack against.

Analysis on Power Consumption Characteristics of SHA-3 Candidates and Low-Power Architecture (SHA-3 해쉬함수 소비전력 특성 분석 및 저전력 구조 기법)

  • Kim, Sung-Ho;Cho, Sung-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.1
    • /
    • pp.115-125
    • /
    • 2011
  • Cryptographic hash functions are also called one-way functions and they ensure the integrity of communication data and command by detecting or blocking forgery. Also hash functions can be used with other security protocols for signature, authentication, and key distribution. The SHA-1 was widely used until it was found to be cryptographically broken by Wang, et. al, 2005. For this reason, NIST launched the SHA-3 competition in November 2007 to develop new secure hash function by 2012. Many SHA-3 hash functions were proposed and currently in review process. To choose new SHA-3 hash function among the proposed hash functions, there have been many efforts to analyze the cryptographic secureness, hardware/software characteristics on each proposed one. However there are few research efforts on the SHA-3 from the point of power consumption, which is a crucial metric on hardware module. In this paper, we analyze the power consumption characteristics of the SHA-3 hash functions when they are made in the form of ASIC hardware module. Also we propose power efficient hardware architecture on Luffa, which is strong candidate as a new SHA-3 hash function. Our proposed low power architecture for Luffa achieves 10% less power consumption than previous Luffa hardware architecture.

Preimage Attacks on Reduced Steps of ARIRANG, HAS-160, and PKC98-Hash (ARIRANG, HAS-160, PKC98-Hash의 축소된 단계들에 대한 역상공격)

  • Hong, Deuk-Jo;Koo, Bon-Wook;Kim, Woo-Hwan;Kwon, Dae-Sung
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.20 no.2
    • /
    • pp.3-14
    • /
    • 2010
  • In this paper, we present the preimage attacks on step-reduced ARIRANG, HAS-160, and PKC98-Hash. We applied Aoki and Sasaki's chunk serach method which they have used in the attack on SHA-0 and SHA-1. Our attacks find the preimages of 35-step ARIRANG, 65-step HAS-160, and 80-step PKC98-Hash. Our results are the best preimage attacks for ARIRANG and HAS-160, and the first preimage attack for PKC98-Hash faster than exhaustive search.

Preimage Attacks on Step-Reduced ARIRANG (해쉬함수 ARIRANG의 출소된 단계에 대한 역상공격)

  • Hong, Deuk-Jo;Kim, Woo-Hwan;Koo, Bon-Wook
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.19 no.5
    • /
    • pp.143-149
    • /
    • 2009
  • The hash function ARIRANG is one of the 1st round SHA-3 candidates. In this paper, we present preimage attacks on ARIRANG with step-reduced compression functions. Our attack finds a preimage of the 33-step OFF(Original FeedForward1) variants of ARIRANG, and a preimage of the 31-step MFF(Middle FeedForward1) variants of ARIRANG. Its time complexity is about $2^{241}$ for ARIRANG-256 and $2^{481}$ for ARIRANG-512, respectively.

DNA Vaccines Encoding Toxoplasma gondii Cathepsin C 1 Induce Protection against Toxoplasmosis in Mice

  • Han, Yali;Zhou, Aihua;Lu, Gang;Zhao, Guanghui;Sha, Wenchao;Wang, Lin;Guo, Jingjing;Zhou, Jian;Zhou, Huaiyu;Cong, Hua;He, Shenyi
    • Parasites, Hosts and Diseases
    • /
    • v.55 no.5
    • /
    • pp.505-512
    • /
    • 2017
  • Toxoplasma gondii cathepsin C proteases (TgCPC1, 2, and 3) are important for the growth and survival of T. gondii. In the present study, B-cell and T-cell epitopes of TgCPC1 were predicted using DNAstar and the Immune Epitope Database. A TgCPC1 DNA vaccine was constructed, and its ability to induce protective immune responses against toxoplasmosis in BALB/c mice was evaluated in the presence or absence of the adjuvant ${\alpha}-GalCer$. As results, TgCPC1 DNA vaccine with or without adjuvant ${\alpha}-GalCer$ showed higher levels of IgG and IgG2a in the serum, as well as IL-2 and $IFN-{\gamma}$ in the spleen compared to controls (PBS, pEGFP-C1, and ${\alpha}-GalCer$). Upon challenge infection with tachyzoites of T. gondii (RH), $pCPC1/{\alpha}-GalCer$ immunized mice showed the longest survival among all the groups. Mice vaccinated with DNA vaccine without adjuvant (pCPC1) showed better protective immunity compared to other controls (PBS, pEGFP-C1, and ${\alpha}-GalCer$). These results indicate that a DNA vaccine encoding TgCPC1 is a potential vaccine candidate against toxoplasmosis.