搜索结果: 1-10 共查到“军事学 divisors”相关记录10条 . 查询时间(0.052 秒)
Reduced Mumford divisors of a genus 2 curve through its jacobian function field
hyperelliptic Mumford arithmetic
2017/2/20
We explore the function field of the jacobian JH of a hyperelliptic curve H of genus 2 in order to find reduced coordinates to represent points of JH and do arithmetic. We show how this relates to the...
The QARMA Block Cipher Family -- Almost MDS Matrices Over Rings With Zero Divisors, Nearly Symmetric Even-Mansour Constructions With Non-Involutory Central Rounds, and Search Heuristics for Low-Latency S-Boxes
Tweakable Block Ciphers Almost MDS Matrices Even-Mansour Schemes
2016/5/9
We introduce and analyse a family of Almost MDS matrices defined over a ring with zero divisors that allows us to encode rotations in its operation while maintaining the minimal latency associated to ...
A New Algorithm for Solving the General Approximate Common Divisors Problem and Cryptanalysis of the FHE Based on the GACD problem
General approximate common divisors problems Fully homomorphic encryption Lattice
2016/1/26
In this paper, we propose a new algorithm for solving the general approximate common divisors (GACD) problems, which is based on lattice reduction algorithms on certain special lattices and linear equ...
Solving Linear Equations Modulo Unknown Divisors: Revisited
Lattice-based analysis Linear modular equations RSA
2016/1/9
We revisit the problem of finding small solutions to a collection
of linear equations modulo an unknown divisor p for a known
composite integer N. In CaLC 2001, Howgrave-Graham introduced an
effici...
Approximate common divisors via lattices
foundations / Coppersmith's algorithm lattice basis reduction approximate common divisors
2012/3/26
We analyze the multivariate generalization of Howgrave-Graham's algorithm for the approximate common divisor problem. In the $m$-variable case with modulus $N$ and approximate common divisor of size $...
Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers
public-key cryptography / fully-homomorphic encryption cryptanalysis
2012/3/26
At EUROCRYPT '10, van Dijk, Gentry, Halevi and Vaikuntanathan presented simple fully-homomorphic encryption (FHE) schemes based on the hardness of approximate integer common divisors problems, which w...
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 ...
Novel Efficient Implementations of Hyperelliptic Curve Cryptosystems using Degenerate Divisors
hyperelliptic curve cryptosystem scalar multiplication timing attack
2009/4/10
It has recently been reported that the performance of hyperelliptic curve
cryptosystems (HECC) is competitive to that of elliptic curve cryptosystems (ECC).
However, it is expected that HECC still c...
Tate pairing computation on the divisors of hyperelliptic curves for cryptosystems
Tate pairing computation hyperelliptic curve cryptosystems pairing-based cryptosystems
2009/2/10
In recent papers [4] and [9], Barreto et al and Choie et al
worked on hyperelliptic curves Hb defined by y2 + y = x5 + x3 + b over
a finite field F2n with b = 0 or 1 for a secure and efficient pairi...
Fast computation of Tate pairing on general divisors of genus 3 hyperelliptic curves
Tate pairing hyperelliptic curves divisors resultant pairing-based cryptosystem
2008/11/12
For the Tate pairing computation over hyperelliptic curves, there are developments by Duursma-
Lee and Barreto et al., and those computations are focused on degenerate divisors.