On an elliptic curve defined over $\mathbb {Q}(\sqrt {-23})$
نویسندگان
چکیده
منابع مشابه
Mapping an Arbritrary Message to an Elliptic Curve When Defined over GF(2^n)
The use of elliptic curve cryptography (ECC) when used as a public-key cryptosystem for encryption is such that if one has a message to encrypt, then they attempt to map it to some point in the prime subgroup of the elliptic curve by systematically modifying the message in a deterministic manner. The applications typically used for ECC are the key-exchange, digital signature or a hybrid encrypt...
متن کاملOn degree zero semistable bundles over an elliptic curve
Motivated by the study of heterotic string compactifications on elliptically fibered Calabi-Yau manifolds, we present a procedure for testing semistability and identifying the decomposition type of degree zero holomorphic vector bundles over a nonsingular elliptic curve. The algorithm requires explicit knowledge of a basis of sections of an associated ‘twisted bundle’. a [email protected]
متن کاملTowards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over $\mathbb{F}_{2^{1223}}$
For the first time ever, the FPGA based cryptoprocessor presented in [12] makes it possible to compute an eta pairing at the 128-bit security level in less than one millisecond. The high performance of their cryptoprocessor comes largely from the use of the Karatsuba method for field multiplication. In this article, for the same type of pairing we propose hybrid sequential/parallel multipliers ...
متن کاملPeriod Determinant of an Irregular Connection over an Elliptic Curve
In this article, we calculate the period of an irregular singular connection ∇ = d+dy on the legendre curve U : y = x(x−1)(x−λ). We calculate its de Rham cohomology and the cycles in the homology of the dual connection and describe the period matrix. Terasoma’s work is introduced to approximate the direct image connection π∗(∇) by a sequence of regular connections as an intermediate step where ...
متن کاملAn FPGA Implementation of an Elliptic Curve Processor over
This paper describes a hardware implementation of an arithmetic processor which is efficient for elliptic curve (EC) cryptosystems, which are becoming increasingly popular as an alternative for public key cryptosystems based on factoring. The modular multiplication is implemented using a Montgomery modular multiplication in a systolic array architecture, which has the advantage that the clock f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: St. Petersburg Mathematical Journal
سال: 2013
ISSN: 1061-0022,1547-7371
DOI: 10.1090/s1061-0022-2013-01254-4