搜索结果: 1-15 共查到“军事学 multiplication”相关记录126条 . 查询时间(0.171 秒)
Asymptotically-Good Arithmetic Secret Sharing over Z/(p^\ell Z) with Strong Multiplication and Its Applications to Efficient MPC
multiparty computation amortization information-theoretical security
2019/7/18
This paper deals with (1) asymptotics of ``strongly-multiplicative'' arithmetic secret sharing over an arbitrary fixed ring Rℓ:=Z/pℓZ (p>0 prime, ℓ>0 an integer) and supporting an un...
Improved Multiplication Triple Generation over Rings via SHE
Secure Two-party Computation Beaver Multiplication Triples Somewhat Homomorphic Encryption
2019/5/29
An important characteristic of recent MPC protocols is an input independent preprocessing phase in which most computations are offloaded, which greatly reduces the execution overhead of the online pha...
A Proof of the Beierle-Kranz-Leander’s Conjecture related to Lightweight Multiplication in $F_{2^n}$
Lightweight cryptography constant multiplication Hamming weight
2019/1/9
Lightweight cryptography is an important tool for building strong security solutions for pervasive devices with limited resources. Due to the stringent cost constraints inherent in extremely large app...
Yet Another Size Record for AES: A First-Order SCA Secure AES S-box Based on GF($2^8$) Multiplication
side-channel analysis Threshold Implementation AES
2018/11/12
It is well known that Canright’s tower field construction leads to a very small, unprotected AES S-box circuit by recursively embedding Galois Field operations into smaller fields. The current size re...
Fast Scalar Multiplication for Elliptic Curves over Prime Fields by Efficiently Computable Formulas
twisted Edwards curves Edwards curves scalar multiplication
2018/11/6
This paper addresses fast scalar multiplication for elliptic curves over finite fields. In the first part of the paper, we obtain several efficiently computable formulas for basic elliptic curves arit...
Faster multiplication in $\mathbb{Z}_{2^m}[x]$ on Cortex-M4 to speed up NIST PQC candidates
ARM Cortex-M4 Karatsuba Toom
2018/11/2
In this paper we optimize multiplication of polynomials in Z2m[x]Z2m[x] on the ARM Cortex-M4 microprocessor. We use these optimized multiplication routines to speed up the NIST post-quantum candidates...
Minimising Communication in Honest-Majority MPC by Batchwise Multiplication Verification
cryptographic protocols multi-party computation
2018/5/28
In this paper, we present two new and very communication-efficient protocols for maliciously secure multi-party computation over fields in the honest-majority setting with abort. Our first protocol im...
Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison
various contexts implementation constraints
2018/4/4
In this paper, we optimize the performances and compare several recent masking schemes in bitslice on 32-bit arm devices, with a focus on multiplication. Our main conclusion is that efficiency (or ran...
Faster Multiplication Triplet Generation from Homomorphic Encryption for Practical Privacy-Preserving Machine Learning under a Narrow Bandwidth
Privacy-preserving Machine Learning Secure Two-party Computation Applied Crypto
2018/2/8
Machine learning algorithms are used by more and more online applications to improve the services. Machine learning-based online services are usually accessed by thousands of clients concurrently thro...
Polynomial multiplication over binary finite fields: new upper bounds
Polynomial multiplication Karatsuba Two-level Seven-way Recursion algorithm
2018/1/29
When implementing a cryptographic algorithm, efficient operations have high relevance both in hardware and software. Since a number of operations can be performed via polynomial multiplication, the ar...
Faster AVX2 optimized NTT multiplication for Ring-LWE lattice cryptography
lattice cryptography NTT implementation
2018/1/11
Constant-time polynomial multiplication is one of the most time-consuming operations in many lattice-based cryptographic constructions. For schemes based on the hardness of Ring-LWE in power-of-two cy...
Hardware Aspects of Montgomery Modular Multiplication
public-key cryptography RSA modular multiplication
2017/11/22
This chapter compares Peter Montgomery's modular multiplication method with traditional techniques for suitability on hardware platforms. It also covers systolic array implementations and side channel...
Template Attack on Blinded Scalar Multiplication with Asynchronous perf-ioctl Calls
Scalar Multiplication Scalar Splitting Scalar Blinding
2017/10/9
In recent years, performance counters have been used as a side channel source for the branch mispredictions which has been used to attack ciphers with user privileges. However, existing research consi...
Scalar multiplication in compressed coordinates in the trace-zero subgroup
elliptic curve cryptography trace-zero subgroup
2017/9/18
We consider trace-zero subgroups of elliptic curves over a degree three field extension. The elements of these groups can be represented in compressed coordinates, i.e. via the two coefficients of the...
On Fast Multiplication in Binary Finite Fields and Optimal Primitive Polynomials over GF(2)
implementation multiplication modular reduction
2017/9/18
In this paper we present a number of algorithms and optimization techniques to speedup computations in binary extension fields over GF(2). Particularly, we consider multiplication and modular reductio...