丢番图逼近
- 网络diophantine approximation
-
丢番图逼近(DiophantineApproximation)理论的发展始于两个世纪前,是数论的一个重要分支。
The development of the theory of Diophantine approximation started two centuries ago .
-
丢番图逼近、环面T~2上的Gevrey亚椭圆性与几乎周期运动
Diophantine Approximation , Gevrey Hypoellipticity and Almost Periodic Motion on the Torus T ~ 2
-
联立丢番图逼近中的一个分形集的Hausdorff维数
The Hausdorff dimension of a fractal set in simultaneous Diophantine approximation
-
证明了该算法能够抵抗低密度攻击和联立丢番图逼近攻击等。
It is shown that the cryptosystem is secure against low-density attacks and the simultaneous Diophantine approximation attacks .
-
对2000年ACISP会议上的一个快速公钥密码算法进行了安全性分析,给出了该算法的安全性与联立丢番图逼近问题以及格上的最小向量问题之间的关系。
The relation of the security of the cryptosystem with the simultaneous Diophantine approximation problem and the shortest vector problem over lattices is clarified .