首页> 外文期刊>IEEE transactions on very large scale integration (VLSI) systems >High-Speed Implementation of ECC Scalar Multiplication in GF(p) for Generic Montgomery Curves
【24h】

High-Speed Implementation of ECC Scalar Multiplication in GF(p) for Generic Montgomery Curves

机译:通用蒙哥马利曲线的GF(p)中ECC标量乘法的高速实现

获取原文
获取原文并翻译 | 示例
           

摘要

Elliptic curve-based cryptography (ECC) has become the automatic choice for public key cryptography due to its lightweightness compared to Rivest–Shamir–Adleman (RSA). The most important operation in ECC is elliptic curve scalar multiplication, and its ef
机译:与Rivest–Shamir–Adleman(RSA)相比,基于椭圆曲线的加密(ECC)轻巧,已成为公钥加密的自动选择。 ECC中最重要的运算是椭圆曲线标量乘法及其ef

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号