搜索结果: 1-15 共查到“divisor”相关记录16条 . 查询时间(0.079 秒)
Algorithms for CRT-variant of Approximate Greatest Common Divisor Problem
CCK-ACD Lattice orthogonal lattice attack
2019/3/1
The approximate greatest common divisor problem (ACD) and its variants have been used to construct many cryptographic primitives. In particular, variants of the ACD problem based on Chinese remainder ...
Revisiting Orthogonal Lattice Attacks on Approximate Common Divisor Problems and their Applications
Fully homomorphic encryption approximate common divisor problem implicit factorization problem
2018/12/20
In this paper, we revisit three existing types of orthogonal lattice (OL) attacks and propose optimized cases to solve approximate common divisor (ACD) problems. In order to reduce both space and time...
Approximate Polynomial Common Divisor Problem Relates to Noisy Multipolynomial Reconstruction
Approximate polynomial common divisor problem noisy multipolynomial reconstruction polynomial lattice
2017/4/17
In this paper, we investigate the hardness of the approximate polynomial common divisor problem, which is regarded as a polynomial analogy of the approximate integer common divisor problem. In order t...
Algorithms for the Approximate Common Divisor Problem
Approximate common divisors lattice attacks orthogonal lattice
2016/3/1
The security of homomorphic encryption over the integers and its variants
depends on the hardness of the Approximate Common Divisor (ACD) problem.
In this paper we review and compare existing algori...
The Gieseker-Petri divisor in M_g for genus g<=13
Gieseker-Petri divisor M_g for genus g<=13
2011/1/21
The Gieseker-Petri locus GPg is defined as the locus insideMg consisting of curves which violate the Gieseker-Petri Theorem. It is known that GPg has always some divisorial components and it has been ...
Weyl asymptotics of Bisingular Operators and Dirichlet Divisor Problem
Weyl asymptotics of Bisingular Operators Dirichlet Divisor Problem
2011/1/19
We consider a class of pseudodifferential operators defined on the product of two closed manifolds, with crossed vector valued symbols. We study the asymptotic expansion of Weyl counting function of p...
Synchronization of unidirectional time delay chaotic networks and the greatest common divisor
Synchronization unidirectional time delay chaotic networks greatest common divisor
2010/12/28
We present the interplay between synchronization of unidirectional coupled chaotic nodes with
heterogeneous delays and the greatest common divisor (GCD) of loops composing the oriented
graph.
In this paper we study zero-divisor graphs of semirings. We show that all zero-divisor graphs of (possibly noncommutative) semirings are connected and have diameter less than or equal to 3. We charact...
On Karatsuba's Problem Concerning the Divisor Function $\tau(n)$
On Karatsuba's Problem the Divisor Function $\tau(n)$
2010/11/11
We study an asymptotic behavior of the sum $\sum\limits_{n\le x}\frac{\D \tau(n)}{\D \tau(n+a)}$. Here $\tau(n)$ denotes the number of divisors of $n$ and $a\ge 1$ is a fixed integer.
In this paper we study linear correlations of the divisor function tau(n) = sum_{d|n} 1 using methods developed by Green and Tao. For example, we obtain an asymptotic for sum_{n,d} tau(n) tau(n+d) ......
For a smooth projective variety P, we construct a Cartier divisor supported on the incidence locus in Ca(P) × Cdim(P)−a−1(P). There is a natural definition of the corresponding line bundle...
Co-Z Divisor Addition Formulae in Jacobian of Genius 2 Hyperelliptic Curves over Prime Fields
hyperelliptic curve divisor Jacobian addition formulae exponentiation projective representation
2010/9/29
In this paper we proposed a new approach to divisor scalar multiplication in Jacobian of genus 2 hyperelliptic curves over fields with odd characteristic, without field inversion. It based on improved...
The universal theta divisor over the moduli space of curves
universal theta divisor moduli space of curves
2010/11/26
The universal theta divisor over the moduli space Ag of principally polarized abelian varieties of dimension g, is the divisor g inside the universal abelian variety Xg over Ag.
Approximate Integer Common Divisor Problem relates to Implicit Factorization
Greatest Common Divisor Factorization Integer Approximations
2009/12/29
In CaLC 2001, Howgrave-Graham presented a technique to calculate GCD (Greatest Common
Divisor) of two large integers when the integers are not exactly known, but some approximation
of those integers...
A Complete Divisor Class Halving Algorithm for Hyperelliptic Curve Cryptosystems of Genus Two
hyperelliptic curve cryptosystems scalar multiplication divisor class halving
2009/3/31
We deal with a divisor class halving algorithm on hyperelliptic
curve cryptosystems (HECC), which can be used for scalar multiplication,
instead of a doubling algorithm. It is not obvious how to con...