earticle

논문검색

Crypto System

Computing the bound of private keys for RSA-CRT attack

원문정보

HongTae Kim

피인용수 : 0(자료제공 : 네이버학술정보)

초록

영어

Sarkar and Maitra (ACNS 2009) presented a lattice-based attack on RSA-CRT cryptosystem under the assumption that the Most Significant Bits (MSBs) of private keys are given from side channel attack. In this paper, we revise their bounds on the MSBs of private keys to attack the cryptosystem. Even we show that less MSBs to attack the system than their result are needed. Additionally, we present the bound on the Least Significant Bits (LSBs).

목차

Abstract
 1. Introduction
 2. Main Result
  2.1 Revision of Sarkar and Maitra's results on private keys' MSBs
  2.2 Our result on private keys' LSBs
 3. Conclusions
 References

저자정보

  • HongTae Kim Mathematics Track, Dept. Natural Science, Korea Air Force Academy, Namil

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.