모듈러 2^n-1 곱셈 연산을 위한 양자 알고리즘
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 서승현[서승현] | - |
dc.date.accessioned | 2021-07-05T06:38:15Z | - |
dc.date.available | 2021-07-05T06:38:15Z | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/103506 | - |
dc.title | 모듈러 2^n-1 곱셈 연산을 위한 양자 알고리즘 | - |
dc.title.alternative | Quantum algorithm for modular 2^n-1 multiplication | - |
dc.type | Patent | - |
dc.contributor.affiliatedAuthor | 서승현[서승현] | - |
dc.type.rims | PAT | - |
dc.type.iprs | 특허 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.