scientific article; zbMATH DE number 1349933
From MaRDI portal
Publication:4265362
zbMath0937.94008MaRDI QIDQ4265362
Gadiel Seroussi, Ian F. Blake, Nigel P. Smart
Publication date: 11 October 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
elliptic curvesfinite fieldscryptographycomplex multiplicationECPP algorithmhyperelliptic cryptosystemsSchoof's algorithmAtkin procedureElkies procedure
Cryptography (94A60) Elliptic curves over global fields (11G05) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Elliptic curves (14H52)
Related Items
Avoiding side-channel attacks by computing isogenous and isomorphic elliptic curves ⋮ Pairing-based cryptography on elliptic curves ⋮ Polynomial interpolation of the Naor-Reingold pseudo-random function ⋮ On the 2-adic valuation of the cardinality of elliptic curves over finite extensions of \(\mathbb{F}_{q}\) ⋮ Generating anomalous elliptic curves ⋮ New lattice attacks on DSA schemes ⋮ Unnamed Item ⋮ Self-inversive Hilbert space operator polynomials with spectrum on the unit circle ⋮ Comments on efficient batch verification test for digital signatures based on elliptic curves ⋮ High-performance generic-point parallel scalar multiplication ⋮ Further refinement of pairing computation based on Miller's algorithm ⋮ A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point ⋮ Efficient software-implementation of finite fields with applications to cryptography ⋮ Hardware implementation of finite-field division ⋮ On the complexity of parallel algorithms for computing inverses in \(\text{GF}(2^m)\) with \(m\) prime ⋮ Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\) ⋮ Analysis and design of a secure key exchange scheme ⋮ A semantically secure public key cryptoscheme using bit-pair shadows ⋮ A provably secure non-iterative hash function resisting birthday attack ⋮ A Public Key Cryptoscheme Using Bit-Pairs with Provable Semantical Security ⋮ The generalized Weil pairing and the discrete logarithm problem on elliptic curves ⋮ Small exponent point groups on elliptic curves ⋮ Modular composition modulo triangular sets and applications ⋮ Complexity of computation in finite fields ⋮ Inferring sequences produced by elliptic curve generators using Coppersmith's methods ⋮ Subgroup Security in Pairing-Based Cryptography ⋮ Irreducible compositions of polynomials over finite fields of even characteristic ⋮ Attacking the linear congruential generator on elliptic curves via lattice techniques ⋮ Exponential sums over points of elliptic curves ⋮ Self-pairings on supersingular elliptic curves with embedding degree \textit{three} ⋮ On the Security of Supersingular Isogeny Cryptosystems ⋮ Short signatures without random oracles and the SDH assumption in bilinear groups ⋮ Cryptography on elliptic curves over \(p\) -adic number fields ⋮ A public key cryptosystem based on three new provable problems ⋮ Spreading alerts quietly and the subgroup escape problem ⋮ Fast arithmetics in Artin-Schreier towers over finite fields ⋮ Formalization of definitions and theorems related to an elliptic curve over a finite prime field by using Mizar ⋮ Some lattice attacks on DSA and ECDSA ⋮ Solving \(x+x^{2^l}+\ldots +x^{2^{ml}}=a\) over \(\mathbb{F}_{2^n} \) ⋮ On oracle factoring of integers ⋮ Recent progress on the elliptic curve discrete logarithm problem ⋮ Singular points of cyclic weighted shift matrices ⋮ A note on the kernel of group homomorphism of the Weil descent method ⋮ Fault detection and a differential fault analysis countermeasure for the Montgomery power ladder in elliptic curve cryptography ⋮ Endomorphisms for faster elliptic curve cryptography on a large class of curves ⋮ Counting points on hyperelliptic curves in average polynomial time ⋮ Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm ⋮ Efficient selective identity-based encryption without random oracles ⋮ On hardware and software implementation of arithmetic in finite fields of characteristic 7 for calculation of pairings ⋮ Private key agreement and secure communication for heterogeneous sensor networks ⋮ Closed formulae for the Weil pairing inversion ⋮ The Diffie-Hellman key exchange protocol and non-Abelian nilpotent groups ⋮ Extended elliptic curve Montgomery ladder algorithm over binary fields with resistance to simple power analysis ⋮ All-in-one group-oriented cryptosystem based on bilinear pairing ⋮ Computational hardness of IFP and ECDLP ⋮ Assessing the effectiveness of artificial neural networks on problems related to elliptic curve cryptography ⋮ Computing the height of volcanoes of \(\ell \)-isogenies of elliptic curves over finite fields ⋮ Solving some affine equations over finite fields ⋮ Improving e-payment security using elliptic curve cryptosystem ⋮ A nonlinear elliptic curve cryptosystem based on matrices ⋮ A transform property of Kloosterman sums ⋮ How to compute modular exponentiation with large operators based on the right-to-left binary algorithm ⋮ Self-certified threshold proxy signature schemes with message recovery, nonrepudiation, and traceability ⋮ Efficient algorithms for Koblitz curves over fields of characteristic three ⋮ Protecting ECC against fault attacks: the ring extension method revisited ⋮ Computing the $\ell $-power torsion of an elliptic curve over a finite field ⋮ On the bit security of the Diffie-Hellman key ⋮ Asymptotic granularity reduction and its application ⋮ Ramanujan's class invariants and their use in elliptic curve cryptography ⋮ Complexity bounds on Semaev's naive index calculus method for ECDLP ⋮ Algebraic approaches for solving isogeny problems of prime power degrees ⋮ On automorphism groups of cyclotomic function fields over finite fields ⋮ Computing pairings using \(x\)-coordinates only ⋮ Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits ⋮ Algebraic cryptography: new constructions and their security against provable break ⋮ Computing Hilbert class polynomials with the Chinese remainder theorem ⋮ Constructive and destructive use of compilers in elliptic curve cryptography ⋮ Inferring Sequences Produced by a Linear Congruential Generator on Elliptic Curves Using Coppersmith’s Methods ⋮ Operations of points on elliptic curve in affine coordinates ⋮ Cryptographic hash functions from expander graphs ⋮ Binary Kloosterman Sums with Value 4 ⋮ On the complexity of the discrete logarithm and Diffie-Hellman problems ⋮ Computing zeta functions of Artin-Schreier curves over finite fields. II ⋮ A note on window \(\tau\)-NAF algorithm ⋮ A blind signature scheme based on bilinear pairings ⋮ Self-certified multi-proxy signature schemes with message recovery ⋮ On the relationship between squared pairings and plain pairings ⋮ Efficient system parameters for Identity-Based Encryption using supersingular elliptic curves ⋮ Novel hybrid-size digit-serial systolic multiplier over \(\mathrm{GF}(2^m)\) ⋮ The GN-authenticated key agreement ⋮ Efficient algorithms for speeding up the computations of elliptic curve cryptosystems ⋮ Efficient proxy signature schemes using self-certified public keys ⋮ An efficient deterministic test for Kloosterman sum zeros ⋮ Design, Analysis and Performance Evaluation of Group Key Establishment in Wireless Sensor Networks ⋮ Constructive and destructive facets of Weil descent on elliptic curves ⋮ Unnamed Item ⋮ On the arithmetic operations over finite fields of characteristic three with low complexity ⋮ A note on the \(x\)-coordinate of points on an elliptic curve in characteristic two ⋮ Recurrent methods for constructing irreducible polynomials over \(\mathbb F_{q}\) of odd characteristics. ⋮ Efficient FPGA design of exception-free generic elliptic curve cryptosystems ⋮ An efficient ECDSA-based signature scheme for wireless networks ⋮ Efficient Arithmetic on Elliptic Curves over Fields of Characteristic Three ⋮ Hardware realization of fast elliptic curve point multiplication using balanced ternary representation and pre-computation overGF(p) ⋮ Modular equations for hyperelliptic curves ⋮ Generalised Mersenne numbers revisited ⋮ SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption ⋮ Horizontal racewalking using radical isogenies ⋮ The "Elliptic" matrices and a new kind of cryptography ⋮ Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation ⋮ A Tree-Based Approach for Computing Double-Base Chains ⋮ A note on factorisation patterns of division polynomials of elliptic curves over finite fields ⋮ On the number of isogeny classes of pairing-friendly elliptic curves and statistics of MNT curves ⋮ Modular polynomials via isogeny volcanoes ⋮ Finding smooth integers in short intervals using CRT decoding ⋮ A NEW HYBRID ENCRYPTION SCHEME ⋮ Deterministic methods of Ramanujan graph construction for use in cryptographic algorithms based on generalized cellular automata ⋮ Minimality and other properties of the width-𝑤 nonadjacent form ⋮ Fast algorithms for computing isogenies between elliptic curves ⋮ Algebraic curves and cryptography ⋮ Choosing the correct elliptic curve in the CM method ⋮ A comparison of different finite fields for elliptic curve cryptosystems ⋮ Pairings in Trusted Computing ⋮ On the efficient generation of prime-order elliptic curves ⋮ Об алгоритмах построения изогений эллиптических кривых над конечными полями и их приложениях ⋮ О вычислении кратных точек на эллиптических кривых над конечными полями с использованием нескольких оснований систем счисления и новых видов координат ⋮ Optimizing Double-Base Elliptic-Curve Single-Scalar Multiplication ⋮ Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves ⋮ Несколько замечаний о задаче дискретного логарифмирования на эллиптических кривых ⋮ Construction of strong elliptic curves suitable for cryptographic applications ⋮ Exponent Recoding and Regular Exponentiation Algorithms ⋮ Lifting and Elliptic Curve Discrete Logarithms ⋮ Efficient scalar multiplication for elliptic curves over binary fields ⋮ Finding the Eigenvalue in Elkies' Algorithm ⋮ Type-Based Proxy Re-encryption and Its Construction ⋮ A Public-Key Encryption Scheme with Pseudo-random Ciphertexts ⋮ Distribution and Polynomial Interpolation of the Dodis-Yampolskiy Pseudo-Random Function
