搜索结果: 1-15 共查到“军事学 Representation”相关记录20条 . 查询时间(0.078 秒)
Optimal-Round Preprocessing-MPC via Polynomial Representation and Distributed Random Matrix (extended abstract)
MPC with preprocessing correlated randomness optimal round complexity
2019/9/16
We present preprocessing-MPC schemes of arithmetic functions with optimal round complexity, function-independent correlated randomness, and communication and space complexities that grow linearly with...
Algebraic Attack Efficiency versus S-box Representation
Algebraic cryptanalysis Small scaled AES SAT-solver
2017/2/20
Algebraic analysis of block ciphers aims at finding the secret key by solving a collection of polynomial equations that describe the internal structure of a cipher for chosen observations of plaintext...
Multi-core FPGA Implementation of ECC with Homogeneous Co-Z Coordinate Representation
ECC Co-Z Multi-Core
2016/12/9
Elliptic Curve Cryptography (ECC) is gaining popularity in recent years. Having short keys and short signatures in particular makes ECC likely to be adopted in numerous internet-of-things (IoT) device...
An optimal representation for the trace zero subgroup
public-key cryptography elliptic curve cryptosystem
2016/1/9
We give an optimal-size representation for the elements of the trace zero subgroup
of the Picard group of an elliptic or hyperelliptic curve of any genus, with respect to a field
extension of any pr...
Secret and Verifiable Delegated Voting for Wide Representation
cryptographic voting elections maximum entropy
2016/1/9
This paper combines cryptographic voting and web page ranking
and proves that it is possible to hold elections so as not to limit a voter by a list
of candidates, to benefit from voter’s personal ex...
Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms - Simplified Setting for Small Characteristic Finite Fields
discrete logarithm problem finite fields
2016/1/6
In this paper, we revisit the recent small characteristic discrete logarithm algorithms. We show that a simplified description of the algorithm, together with some additional ideas, permits to obtain ...
Modular exponentiation is core to today’s main stream public key cryptographic systems. In this
article, we generalize the classical fractional wNAF method for modular exponentiation – the classical
...
By embedding a Toeplitz matrix-vector product (MVP) of dimension $n$ into a circulant MVP of dimension $N=2n+\delta -1$, where $\delta $ can be any nonnegative integer, we present a $GF(2^n)$ multipli...
A representation of the $p$-sylow subgroup of $\perm(\F_p^n)$ and a cryptographic application
cryptographic protocols Diffie-Hellmann session key exchange
2011/7/25
This article concerns itself with the triangular permutation group, induced by triangular polynomial maps over $\F_p$, which is a $p$-sylow subgroup of $\perm(\F_p^n)$.
A representation of the $p$-sylow subgroup of $\perm(\F_p^n)$ and a cryptographic application
cryptographic protocols / Diffie-Hellmann session key exchange
2012/3/27
This article concerns itself with the triangular permutation group, induced by triangular polynomial maps over $\F_p$, which is a $p$-sylow subgroup of $\perm(\F_p^n)$. The aim of this article is twof...
Explicit Formulas for Real Hyperelliptic Curves of Genus 2 in Affine Representation
Explicit Formulas Real Hyperelliptic Curves Affine Representation
2011/3/11
We present a complete set of efficient explicit formulas for arithmetic
in the degree 0 divisor class group of a genus two real hyperelliptic curve
givenin affine coordinates. In addition to formula...
Explicit Formulas for Real Hyperelliptic Curves of Genus 2 in Affine Representation
foundations / hyperelliptic curve, reduced divisor, infrastructure and distance Cantor’s algorithm explicit formulas efficient implementation cryptographic key exchange
2012/3/29
We present a complete set of efficient explicit formulas for arithmetic in the degree 0 divisor class group of a genus two real hyperelliptic curve given in affine coordinates. In addition to formulas...
Combining leak--resistant arithmetic for elliptic curves defined over $\F_p$ and RNS representation
Elliptic curves Montgomery algorithm leak-resistance residue number system
2010/7/13
In this paper we combine the residue number system (RNS) representation and the leak-resistant arithmetic on elliptic curves. These two techniques are relevant for implementation of elliptic curve cry...
Efficient Hyperelliptic Arithmetic using Balanced Representation for Divisors
Efficient Hyperelliptic Arithmetic Balanced Representation hyperelliptic curve
2009/6/5
We discuss arithmetic in the Jacobian of a hyperelliptic curve
C of genus g. The traditional approach is to fix a point P1 2 C and rep-
resent divisor classes in the form E d(P1) where E ...
Efficient arithmetic on elliptic curves using a mixed Edwards{Montgomery representation
Efficient arithmetic elliptic curves Edwards{Montgomery representation
2009/6/4
From the viewpoint of x-coordinate-only arithmetic on ellip-
tic curves, switching between the Edwards model and the Montgomery
model is quasi cost-free. We use this observation to speed up Mont-
g...