RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      KCI등재

      부호 기반 양자 내성 암호의 이진 필드 상에서 곱셈 연산 양자 게이트 구현 = Implementation of Quantum Gates for Binary Field Multiplication of Code based Post Quantum Cryptography

      한글로보기

      https://www.riss.kr/link?id=A107283662

      • 0

        상세조회
      • 0

        다운로드
      서지정보 열기
      • 내보내기
      • 내책장담기
      • 공유하기
      • 오류접수

      부가정보

      다국어 초록 (Multilingual Abstract)

      The age of quantum computers is coming soon. In order to prepare for the upcoming future, the National Institute of Standards and Technology has recruited candidates to set standards for post quantum cryptography to establish a future cryptography standard. The submitted ciphers are expected to be safe from quantum algorithm attacks, but it is necessary to verify that the submitted algorithm is safe from quantum attacks using quantum algorithm even when it is actually operated on a quantum computer. Therefore, in this paper, we investigate an efficient quantum gate implementation for binary field multiplication of code based post quantum cryptography to work on quantum computers. We implemented the binary field multiplication for two field polynomials presented by Classic McEliece and three field polynomials presented by ROLLO in generic algorithm and Karatsuba algorithm.
      번역하기

      The age of quantum computers is coming soon. In order to prepare for the upcoming future, the National Institute of Standards and Technology has recruited candidates to set standards for post quantum cryptography to establish a future cryptography sta...

      The age of quantum computers is coming soon. In order to prepare for the upcoming future, the National Institute of Standards and Technology has recruited candidates to set standards for post quantum cryptography to establish a future cryptography standard. The submitted ciphers are expected to be safe from quantum algorithm attacks, but it is necessary to verify that the submitted algorithm is safe from quantum attacks using quantum algorithm even when it is actually operated on a quantum computer. Therefore, in this paper, we investigate an efficient quantum gate implementation for binary field multiplication of code based post quantum cryptography to work on quantum computers. We implemented the binary field multiplication for two field polynomials presented by Classic McEliece and three field polynomials presented by ROLLO in generic algorithm and Karatsuba algorithm.

      더보기

      참고문헌 (Reference)

      1 I. V. Hoof, "Space-efficient quantum multiplication of polynomials for binary finite fields with sub-quadratic Toffoli gate count"

      2 R. Feynman, "Simulating Physics with Computers" 21 : 467-, 1982

      3 C. A. Melchor, "ROLLO: Rank-Ouroboros, Lake & Locker"

      4 S. Kepley, "Quantum circuits for multiplication with subquadratic gate count" 14 (14): 2373-2386, 2015

      5 V. Shende, "Quantum Information and Computation" 2008

      6 D. S. Steiger, "ProjectQ: An Open Source Software Framework for Quantum Computing. Quantum"

      7 D. Cheung, "On the design and optimization of a quantum polynomial-time attack on elliptic curve cryptography" 96-104, 2008

      8 Join Extra Crunch, "IBM unveils its first commercial quantum computer"

      9 D. J. Bernstein, "Classic McEliece:conservative code-based cryptography"

      10 A. G. Aruna, "A Study on Reversible Logic Gates of Quantum Computing" 7 (7): 427-432, 2016

      1 I. V. Hoof, "Space-efficient quantum multiplication of polynomials for binary finite fields with sub-quadratic Toffoli gate count"

      2 R. Feynman, "Simulating Physics with Computers" 21 : 467-, 1982

      3 C. A. Melchor, "ROLLO: Rank-Ouroboros, Lake & Locker"

      4 S. Kepley, "Quantum circuits for multiplication with subquadratic gate count" 14 (14): 2373-2386, 2015

      5 V. Shende, "Quantum Information and Computation" 2008

      6 D. S. Steiger, "ProjectQ: An Open Source Software Framework for Quantum Computing. Quantum"

      7 D. Cheung, "On the design and optimization of a quantum polynomial-time attack on elliptic curve cryptography" 96-104, 2008

      8 Join Extra Crunch, "IBM unveils its first commercial quantum computer"

      9 D. J. Bernstein, "Classic McEliece:conservative code-based cryptography"

      10 A. G. Aruna, "A Study on Reversible Logic Gates of Quantum Computing" 7 (7): 427-432, 2016

      더보기

      동일학술지(권/호) 다른 논문

      분석정보

      View

      상세정보조회

      0

      Usage

      원문다운로드

      0

      대출신청

      0

      복사신청

      0

      EDDS신청

      0

      동일 주제 내 활용도 TOP

      더보기

      주제

      연도별 연구동향

      연도별 활용동향

      연관논문

      연구자 네트워크맵

      공동연구자 (7)

      유사연구자 (20) 활용도상위20명

      인용정보 인용지수 설명보기

      학술지 이력

      학술지 이력
      연월일 이력구분 이력상세 등재구분
      2027 평가예정 재인증평가 신청대상 (재인증)
      2021-01-01 평가 등재학술지 유지 (재인증) KCI등재
      2018-01-01 평가 등재학술지 선정 (계속평가) KCI등재
      2017-12-01 평가 등재후보로 하락 (계속평가) KCI등재후보
      2013-01-01 평가 등재학술지 유지 (등재유지) KCI등재
      2011-11-23 학술지명변경 외국어명 : THE JOURNAL OF The KOREAN Institute Of Maritime information & Communication Science -> Journal of the Korea Institute Of Information and Communication Engineering KCI등재
      2011-11-16 학회명변경 영문명 : International Journal of Information and Communication Engineering(IJICE) -> The Korea Institute of Information and Communication Engineering KCI등재
      2011-11-14 학회명변경 한글명 : 한국해양정보통신학회 -> 한국정보통신학회
      영문명 : 미등록 -> International Journal of Information and Communication Engineering(IJICE)
      KCI등재
      2010-01-01 평가 등재학술지 유지 (등재유지) KCI등재
      2008-01-01 평가 등재학술지 유지 (등재유지) KCI등재
      2005-01-01 평가 등재학술지 선정 (등재후보2차) KCI등재
      2004-01-01 평가 등재후보 1차 PASS (등재후보1차) KCI등재후보
      2002-07-01 평가 등재후보학술지 선정 (신규평가) KCI등재후보
      더보기

      학술지 인용정보

      학술지 인용정보
      기준연도 WOS-KCI 통합IF(2년) KCIF(2년) KCIF(3년)
      2016 0.23 0.23 0.27
      KCIF(4년) KCIF(5년) 중심성지수(3년) 즉시성지수
      0.24 0.22 0.424 0.11
      더보기

      이 자료와 함께 이용한 RISS 자료

      나만을 위한 추천자료

      해외이동버튼