권호기사보기
| 기사명 | 저자명 | 페이지 | 원문 | 기사목차 |
|---|
결과 내 검색
동의어 포함
| 번호 | 참고문헌 | 국회도서관 소장유무 |
|---|---|---|
| 1 | R. Azarderakhsh et al. “Supersingular isogeny key encapsulation”, submission to the NIST post-quantum standardization project, 2017 | 미소장 |
| 2 | R. Azarderakhsh et al. “Practical supersingular isogeny group key aggrement,” IACR Cryptology ePrint Archive, 2019:330, 2019 | 미소장 |
| 3 | J. Couveignes, “Hard homogeneous spaces,” IACR Cryptology ePrint Archive, 2006:291, 2006 | 미소장 |
| 4 | C. Costello and H. Hisil, “A simple and compact algorithm for SIDH with arbitrary degree isogenies,” Advances in Cryptology, ASIACRYPT‘17, LNCS 10625, pp. 303-329, 2017 | 미소장 |
| 5 | Craig Costello “B-SIDH supersingular isogeny Diffie-Hellman using twisted torsion,” Advances in Cryptology, ASIACRYPT’20, LNCS 12492, pp. 440-463,2020 | 미소장 |
| 6 | R. Drylo et al. “Efficient Montgomerylike formulas for general Huff’s and Huff’s elliptic curves and their applications to the isogeny-based cryptography,” IACR Cryptology ePrint Archive, 2020:526, 2020 | 미소장 |
| 7 | R. Farashahi et al. “Differential addition on twisted Edwards curves,”ACISP’17, LNCS 10343, pp. 366-378, 2017 | 미소장 |
| 8 | Y. Huang et al, “Optimized arithmetic operations for isogeny-based cryptography on Huff curves,” ACISP’20, LNCS 12248, pp. 23-40, 2020 | 미소장 |
| 9 | M. Joye et al,“Huff’s model for elliptic curves,” International Algorithmic Number Theory Symposium, ANTS’10, pp. 234-250, 2010 | 미소장 |
| 10 | D. Jao, L. De Feo “Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies,”PQCrypto’11, LNCS 7071, pp. 19-34, 2011 | 미소장 |
| 11 | S. Kim et al. “Optimized method for computing odd-degree isogenies on Edwards curves,” Advances in Cryptology, ASIACRYPT’19, LNCS 11922, pp. 273-292, 2019 | 미소장 |
| 12 | S. Kim et al. “New hybrid method for isogeny-based cryptosystems using Edwards curves,” IEEE transactions on Information Theory, vol. 66, no. 3, pp. 1934-1943, 2020 | 미소장 |
| 13 | M. Meyer et al. “On hybrid SIDH schemes using Edwards and Montgomery curve arithmetic,” IACR Cryptology ePrint Archive, 2017:1213, 2017 | 미소장 |
| 14 | P. Montgomery, ‘Speeding the pollard and elliptic curve methods of factorization,“ Mathematics of computation, vol. 48, no. 177, pp. 243-264, 1971 | 미소장 |
| 15 | D. Moody and D. Shumow, “Analogues of Velu’s formula for isogenies on alternate models of elliptic curves,”Mathematics of Computations, vol. 85, no. 300, pp. 1929-1951, 2016 | 미소장 |
| 16 | P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM review, vol. 41 no. 2, pp. 303-332, 1999. | 미소장 |
*표시는 필수 입력사항입니다.
| 전화번호 |
|---|
| 기사명 | 저자명 | 페이지 | 원문 | 기사목차 |
|---|
| 번호 | 발행일자 | 권호명 | 제본정보 | 자료실 | 원문 | 신청 페이지 |
|---|
도서위치안내: 정기간행물실(524호) / 서가번호: 국내09
2021년 이전 정기간행물은 온라인 신청(원문 구축 자료는 원문 이용)
우편복사 목록담기를 완료하였습니다.
*표시는 필수 입력사항입니다.
저장 되었습니다.