30 search results - page 4 / 6 » Fast Cryptography in Genus 2 |
CHES
2005
Springer
14 years 3 months ago
2005
Springer
The Truncated Multiplication computes a truncated product, a contiguous subsequence of the digits of the product of 2 integers. A few truncated polynomial multiplication algorithms...
IEICET
2008
13 years 10 months ago
2008
The hyperelliptic curve cryptosystems take most of the time for computing a scalar multiplication kD of an element D in the Jacobian JC of a hyperelliptic curve C for an integer k....
ASIACRYPT
2003
Springer
14 years 3 months ago
2003
Springer
The Weil and Tate pairings have been used recently to build new schemes in cryptography. It is known that the Weil pairing takes longer than twice the running time of the Tate pair...
ISCAS
2006
IEEE
14 years 4 months ago
2006
IEEE
— We propose a fast Modular Arithmetic Logic Unit (MALU) that is scalable in the digit size (d) and the field size (k). The datapath of MALU has chains of Carry Save Adders (CSA...
CHES
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. This paper discusses the state-of-the-art fast software implementation of block ciphers on Intel’s new microprocessor Core2, particularly concentrating on “bitslice i...