Sciweavers

177 search results - page 3 / 36
» Overdetermined Elliptic Systems
Sort
View
AMC
2005
124views more  AMC 2005»
13 years 5 months ago
An efficient undeniable group-oriented signature scheme
Three main methods with favorable security and efficiency can be considered in the design of cryptosystems. These methods are integer factorization systems (of which RSA is the be...
Tzer-Shyong Chen, Jen-Yan Huang, Tzer-Long Chen
IJNSEC
2011
145views more  IJNSEC 2011»
13 years 22 days ago
Symmetric Key Image Encryption Scheme with Key Sequences Derived from Random Sequence of Cyclic Elliptic Curve Points
In this paper, cyclic elliptic curves of the form y2 + xy = x3 + ax2 + b, a, b ∈ GF(2m ) with order M is considered in the design of a Symmetric Key Image Encryption Scheme with...
S. V. Sathyanarayana, M. Aswatha Kumar, K. N. Hari...
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 3 months ago
On Turing machines, dynamical systems and the Atiyah problem
: We consider mixed Dirichlet-Robin problems on scale irregular domains. In particular, we study the asymptotic convergence of the solutions of elliptic problems with Robin boundar...
Lukasz Grabowski
CORR
2010
Springer
118views Education» more  CORR 2010»
13 years 5 months ago
alphaCertified: certifying solutions to polynomial systems
Smale's -theory uses estimates related to the convergence of Newton's method to give criteria implying that Newton iterations will converge quadratically to solutions to ...
Jonathan D. Hauenstein, Frank Sottile
CORR
2006
Springer
182views Education» more  CORR 2006»
13 years 5 months ago
Cryptanalysis of the CFVZ cryptosystem
The paper analyzes CFVZ, a new public key cryptosystem whose security is based on a matrix version of the discrete logarithm problem over an elliptic curve. It is shown that the co...
Joan-Josep Climent, E. Gorla, J. Rosenthal