GPU-Accelerated Montgomery Exponentiation
暂无分享,去创建一个
[1] Hideki Imai,et al. How to Construct Efficient Signcryption Schemes on Elliptic Curves , 1998, Inf. Process. Lett..
[2] Yuliang Zheng,et al. Efficient Signcryption Schemes on Elliptic Curves , 1998 .
[3] Tien-Tsin Wong,et al. Parallel evolutionary algorithms on graphics processing unit , 2005, 2005 IEEE Congress on Evolutionary Computation.
[4] P. L. Montgomery. Modular multiplication without trial division , 1985 .
[5] Xiaoyuan Yang,et al. ECGSC: Elliptic Curve based Generalized Signcryption Scheme , 2006, IACR Cryptol. ePrint Arch..
[6] Der-Chyuan Lou,et al. An Efficient Montgomery Exponentiation Algorithm for Cryptographic Applications , 2005, Informatica.
[7] C. D. Walter,et al. Montgomery's Multiplication Technique: How to Make It Smaller and Faster , 1999, CHES.
[8] Angelos D. Keromytis,et al. CryptoGraphics: Secret Key Cryptography Using Graphics Cards , 2005, CT-RSA.
[9] Christof Paar,et al. Cryptographic Hardware and Embedded Systems - CHES 2002 , 2003, Lecture Notes in Computer Science.
[10] Dinesh Manocha,et al. General-Purpose Computations Using Graphics Processors , 2005, Computer.
[11] Xiaoyuan Yang,et al. ECGSC: Elliptic Curve Based Generalized Signcryption , 2006, UIC.
[12] Matt Pharr,et al. Gpu gems 2: programming techniques for high-performance graphics and general-purpose computation , 2005 .
[13] Shay Gueron. Enhanced Montgomery Multiplication , 2002, CHES.
[14] Dinesh Manocha,et al. Fast and approximate stream mining of quantiles and frequencies using graphics processors , 2005, SIGMOD '05.
[15] Xiaoyuan Yang,et al. Elliptic Curve based Signcryption and its Multi-party Schemes , 2004, IACR Cryptol. ePrint Arch..