搜索结果: 1-5 共查到“field multiplication”相关记录5条 . 查询时间(0.078 秒)
Efficient Finite field multiplication for isogeny based post quantum cryptography
public-key cryptography post quantum cryptography
font style='font-size:12px;'>
2016/12/7
Isogeny based post-quantum cryptography is one of the most recent addition to the family of quantum resistant cryptosystems. In this paper, we propose an efficient modular multiplication algorithm for...
Faster Binary-Field Multiplication and Faster Binary-Field MACs
Performance FFTs Polynomial multiplication
font style='font-size:12px;'>
2016/1/7
This paper shows how to securely authenticate messages using
just 29 bit operations per authenticated bit, plus a constant overhead
per message. The authenticator is a standard type of “universal” h...
Improved Side-Channel Analysis of Finite-Field Multiplication
Side-Channel Analysis Galois Field Multiplication LPN problem
font style='font-size:12px;'>
2015/12/30
A side-channel analysis of multiplication in GF(2^{128}) has recently been published by Bela飀, Fouque and G閞ard at Asiacrypt 2014, with an application to AES-GCM. Using the least significant bit of th...
Binary Field Multiplication on ARMv8
Polynomial Multiplication Binary Field Multiplication ARMv8
font style='font-size:12px;'>
2015/12/29
In this paper, we show efficient implementations of binary
field multiplication over ARMv8. We exploit an advanced 64-bit polynomial
multiplication (PMULL) supported by ARMv8 and conduct multiple
l...
Secure Binary Field Multiplication
Binary Field Multiplication branch statements
font style='font-size:12px;'>
2015/12/24
Binary eld multiplication is the most fundamental building block of binary eld Elliptic Curve Cryptography (ECC) and Galois/Counter Mode (GCM). Both bit-wise scanning and Look-Up Table (LUT) based m...