Speeding up elliptic cryptosystems using a new signed binary representation for integers

Proceedings Euromicro Symposium on Digital System Design. Architectures, Methods and Tools Pub Date : 2002-09-04 DOI:10.1109/DSD.2002.1115395

R. Katti

引用次数: 10

Abstract

Two new signed binary representations are presented that simplify hardware or software necessary in elliptic curve cryptosystems. Simplified algorithms are presented for computing the new binary representations. This speeds up elliptic cryptosystems. The algorithms are useful for smart card and digital signature verification applications. The first algorithm computes a new representation for an integer d and speeds up the computation of d/spl times/P, where P is a point on an elliptic curve. The second algorithm computes a new representation for two integers g and h and speeds up the computation of (g/spl times/P)+(h/spl times/Q), where P and Q are points on an elliptic curve.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

使用新的带符号二进制整数表示法加快椭圆密码系统速度

本文介绍了两种新的带符号二进制表示法，可简化椭圆曲线密码系统所需的硬件或软件。介绍了计算新二进制表示法的简化算法。这加快了椭圆密码系统的速度。这些算法适用于智能卡和数字签名验证应用。第一种算法计算整数 d 的新表示，加快 d/spl times/P 的计算速度，其中 P 是椭圆曲线上的一个点。第二种算法为两个整数 g 和 h 计算一种新的表示方法，并加快 (g/spl times/P)+(h/spl times/Q) 的计算速度，其中 P 和 Q 是椭圆曲线上的点。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Proceedings Euromicro Symposium on Digital System Design. Architectures, Methods and Tools

自引率

0.00%

发文量

期刊最新文献

Fault latencies of concurrent checking FSMs On the fundamental design gap in terabit per second packet switching Bit-level allocation of multiple-precision specifications Improving mW/MHz ratio in FPGAs pipelined designs Hardware implementation of a memory allocator