scientific article
From MaRDI portal
Publication:3718617
zbMath0589.94005MaRDI QIDQ3718617
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cryptography (94A60) Elliptic curves over global fields (11G05) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items
A secure searchable encryption scheme for cloud using hash-based indexing, Avoiding side-channel attacks by computing isogenous and isomorphic elliptic curves, Fast cryptography in genus 2, Multiple images encryption based on 3D scrambling and hyper-chaotic system, Efficient key-dependent dynamic S-boxes based on permutated elliptic curves, A key-exchange protocol using real quadratic fields, An anonymous SIP authenticated key agreement protocol based on elliptic curve cryptography, Improved supersingularity testing of elliptic curves using Legendre form, On index calculus algorithms for subfield curves, Finite field arithmetic using quasi-normal bases, A new two-round dynamic authenticated contributory group key agreement protocol using elliptic curve Diffie-Hellman with privacy preserving public key infrastructure, A reduction of semigroup DLP to classic DLP, Provably secure and pairing-based strong designated verifier signature scheme with message recovery, ECC over the ring \(\mathbb{F}_{3^d}[\varepsilon\), \(\varepsilon^4=0\) by using two methods], High-performance generic-point parallel scalar multiplication, A metric on the set of elliptic curves over \(\mathbb{F}_p\), Elliptic curve scalar multiplication algorithm using complementary recoding, The matrix reloaded: multiplication strategies in FrodoKEM, Explicit bounds of polynomial coefficients and counting points on Picard curves over finite fields, A key distribution system equivalent to factoring, A key-exchange system based on imaginary quadratic fields, Fast elliptic scalar multiplication using new double-base chain and point halving, The generalized Weil pairing and the discrete logarithm problem on elliptic curves, Hyperelliptic cryptosystems, Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods, Efficient elliptic curve scalar multiplication algorithms resistant to power analysis, The complete cost of cofactor \(h=1\), High-speed Curve25519 on 8-bit, 16-bit, and 32-bit microcontrollers, Horizontal collision correlation attack on elliptic curves, Fault attacks on hyperelliptic curve discrete logarithm problem over binary field, An application of crypto cloud computing in social networks by cooperative game theory, Analysis of the fault attack ECDLP over prime field, An efficient collision detection method for computing discrete logarithms with Pollard's rho, A pairing-free and provably secure certificateless signature scheme, Lattice attacks against elliptic-curve signatures with blinded scalar multiplication, Bounds and trade-offs for double-base number systems, Elliptic curve discrete logarithm problem over small degree extension fields, Security analysis of the public key algorithm based on Chebyshev polynomials over the integer ring \(Z_{N}\), First-order side channel attacks on Zhang's countermeasures, Efficient precomputation schemes of \(kP+lQ\), Improved Pollard rho method for computing discrete logarithms over finite extension fields, Computing elliptic curve discrete logarithms with the negation map, An efficient and batch verifiable conditional privacy-preserving authentication scheme for VANETs using lattice, Fault-based attack on Montgomery's ladder algorithm, Connecting Legendre with Kummer and Edwards, A novel elliptic curve scalar multiplication algorithm against power analysis, Using symmetries in the index calculus for elliptic curves discrete logarithm, Elliptic curve implementation of zero-knowledge blobs, Extended elliptic curve Montgomery ladder algorithm over binary fields with resistance to simple power analysis, A chosen message attack on Demytko's elliptic curve cryptosystem, Provably secure proxy convertible authenticated encryption scheme based on RSA, How to (pre-)compute a ladder -- improving the performance of X25519 and X448, A new method for decomposition in the Jacobian of small genus hyperelliptic curves, Group law on affine conics and applications to cryptography, Permutation polynomials and a new public-key encryption, Metrics on the sets of nonsupersingular elliptic curves in simplified Weierstrass form over finite fields of characteristic two, Efficient generic on-line/off-line (threshold) signatures without key exposure, An optimal Tate pairing computation using Jacobi quartic elliptic curves, Secure simultaneous bit extraction from Koblitz curves, Cryptanalysis of Lee-Hwang-Li's key authentication scheme, A threshold signature scheme based on the elliptic curve cryptosystem, A traceable proxy multisignature scheme based on the elliptic curve cryptosystem, Toric forms of elliptic curves and their arithmetic, ID-based threshold digital signature schemes on the elliptic curve discrete logarithm problem, On the representation of the number of integral points of an elliptic curve modulo a prime number, Self-certified threshold proxy signature schemes with message recovery, nonrepudiation, and traceability, Efficient algorithms for Koblitz curves over fields of characteristic three, Encryption of covert information into multiple statistical distributions, Protecting ECC against fault attacks: the ring extension method revisited, An efficient undeniable group-oriented signature scheme, Complexity bounds on Semaev's naive index calculus method for ECDLP, One-way permutations on elliptic curves, A new generalization of the KMOV cryptosystem, Algebraic approaches for solving isogeny problems of prime power degrees, Fast simultaneous scalar multiplication, Cryptanalysis of a key exchange scheme based on block matrices, New schemes for sharing points on an elliptic curve, A public key cryptosystem based on Diophantine equations of degree increasing type, Elliptic curve based hardware architecture using cellular automata, Constructive and destructive use of compilers in elliptic curve cryptography, Kummer for genus one over prime-order fields, Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem, Expander graphs based on GRH with an application to elliptic curve cryptography, Non-uniform birthday problem revisited: refined analysis and applications to discrete logarithms, Sequences of numbers generated by addition in formal groups and new primality and factorization tests, Improvement of the Miyazaki-Takaragi threshold digital signature scheme, Quasi-quadratic elliptic curve point counting using rigid cohomology, Koblitz curves over quadratic fields, Complete addition formulas on the level four theta model of elliptic curves, Self-certified multi-proxy signature schemes with message recovery, Efficient arithmetic in (pseudo-)Mersenne prime order fields, Fast elliptic curve point multiplication based on window non-adjacent form method, Conjugacy systems based on nonabelian factorization problems and their applications in cryptography, Pseudorandom vector generation using elliptic curves and applications to Wiener processes, Elliptic curve cryptosystems and their implementation, Improved lattice enumeration algorithms by primal and dual reordering methods, A note on the \(x\)-coordinate of points on an elliptic curve in characteristic two, Fast computation of canonical lifts of elliptic curves and its application to point counting., Counting points on \(C_{ab}\) curves using Monsky-Washnitzer cohomology, Efficient FPGA design of exception-free generic elliptic curve cryptosystems, A new enhancement of elliptic curve digital signature algorithm, Elliptic curve cryptography arithmetic in terms of one variable polynomial division, An efficient self-certified multi-proxy signature scheme based on elliptic curve discrete logarithm problem, Public key authentication scheme over quaternions, Kummer versus Montgomery Face-off over Prime Order Fields, Group Key Exchange from CSIDH and Its Application to Trusted Setup in Supersingular Isogeny Cryptosystems, Improving ECDLP Computation in Characteristic 2, Small scalar multiplication on Weierstrass curves using division polynomials, An elementary linear-algebraic proof without computer-aided arguments for the group law on elliptic curves, An improvement of a key exchange protocol relying on polynomial maps, XTR Algorithm: Efficient and Compact Subgroup Trace Representation, Compositeness test with nodal curves, Efficient Modular Reduction Algorithm Without Correction Phase, Partially Known Nonces and Fault Injection Attacks on SM2 Signature Algorithm, Number of rational points of elliptic curves, Speeding up the Elliptic Curve Scalar Multiplication Using Non Adjacent Form, Hardware realization of fast elliptic curve point multiplication using balanced ternary representation and pre-computation overGF(p), SOME ARITHMETICAL PROPERTIES ON HYPERBOLA, Computational Number Theory and Cryptography, Jacobian coordinates on genus 2 curves, A survey on the group of points arising from elliptic curves with a Weierstrass model over a ring, The average exponent of elliptic curves modulo \(p\), Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm, Algebraic generalization of Diffie-Hellman key exchange, On Symmetric Encryption with Distinguishable Decryption Failures, An Elliptic Curve Cryptographic Processor Using Edwards Curves and the Number Theoretic Transform, Field extensions and index calculus on algebraic curves, Quantum attribute-based encryption: a comprehensive study, Quantum algorithms for typical hard problems: a perspective of cryptanalysis, Quantum algorithm for solving hyperelliptic curve discrete logarithm problem, Multiplication polynomials for elliptic curves over finite local rings, Supply chain financing scheme based on blockchain technology from a business application perspective, Concrete quantum cryptanalysis of binary elliptic curves via addition chain, Revisiting lower dimension lattice attacks on NTRU, Elliptic curve cryptography; applications, challenges, recent advances, and future trends: a comprehensive survey, T_SM: Elliptic Curve Scalar Multiplication Algorithm Secure Against Single-Trace Attacks, Finding points on elliptic curves with Coppersmith's method, Anonymous yet Traceable Strong Designated Verifier Signature, Fast Point Decompression for Standard Elliptic Curves, A novel quantum blockchain scheme base on quantum entanglement and DPoS, Higher-order masked Saber, Bézier Coefficients Matrix for ElGamal Elliptic Curve Cryptosystem, A formula for disaster: a unified approach to elliptic curve special-point-based attacks, Dilithium for memory constrained devices, Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation, Montgomery Residue Representation Fault-Tolerant Computation in GF(2 k ), A Tree-Based Approach for Computing Double-Base Chains, Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation, Efficiently masking polynomial inversion at arbitrary order, Quantum circuits for hyperelliptic curve discrete logarithms over the mersenne prime fields, An orderly quantum multi-signature based on orthogonal product states for the multi-party transaction blockchain, Differential addition on binary elliptic curves, Efficient generation of elliptic curve cryptosystems, Tower building technique on elliptic curve with embedding degree 18, Group structure of elliptic curves over \(\mathbb{Z}/N\mathbb{Z}\), Design of a Certificateless Designated Server Based Searchable Public Key Encryption Scheme, Elliptic curve cryptography: the serpentine course of a paradigm shift, Finding composite order ordinary elliptic curves using the Cocks-Pinch method, SiGamal: a supersingular isogeny-based PKE and its application to a PRF, Modular Reduction in GF(2 n ) without Pre-computational Phase, Montgomery Ladder for All Genus 2 Curves in Characteristic 2, Non-associative public-key cryptography, On Edwards curves and ZVP-attacks, Faster Addition and Doubling on Elliptic Curves, Committing to Quantum Resistance, Better: A Speed-and-Risk-Configurable Defence for Bitcoin Against a Fast Quantum Computing Attack, Security and Trust in Sensor Networks, Lattice-Based Fault Attacks Against ECMQV, How to construct CSIDH on Edwards curves, Secure distributed constraint satisfaction: reaching agreement without revealing private information, Assessing the effectiveness of artificial neural networks on problems related to elliptic curve cryptography, On the Semantic Security of Functional Encryption Schemes, Algebraic curves and cryptography, Constructing elliptic curves over finite fields using double eta-quotients, A nonlinear elliptic curve cryptosystem based on matrices, Huff’s Model for Elliptic Curves, Cryptography on twisted Edwards curves over local fields, Arithmetic of the level four theta model of elliptic curves, Extension of elliptic curves on Krasner hyperfields, Improving Smart Card Security Using Elliptic Curve Cryptography over Prime Field (F p ), Threshold-directed signature scheme based on hybrid number theoretic problems, Construction of metrics on the set of elliptic curves over a finite field, Isomorphism classes of elliptic and hyperelliptic curves over finite fields \(\mathbb F_{(2g+1)^n}\), Unnamed Item, A \(w\)-NNAF method for the efficient computation of scalar multiplication in elliptic curve cryptography, Cryptanalysis and improvement of the Tzeng-Hwang authenticated encryption scheme based on elliptic curve discrete logarithm problem, A knapsack public-key cryptosystem based on elliptic curve discrete logarithm, Security of Tzeng-Hwang's authenticated encryption scheme based on elliptic curve discrete logarithm problems, Efficient algorithms for speeding up the computations of elliptic curve cryptosystems, AN IDENTITY-BASED ENCRYPTION SCHEME USING ISOGENY OF ELLIPTIC CURVES, Efficient proxy signature schemes using self-certified public keys, A Public-Key Encryption Scheme with Pseudo-random Ciphertexts, Bitcoin security with a twisted Edwards curve, Algorithms for elliptic curves, Elliptic curves over a nonlocal ring 𝔽2d[𝜀,𝜀2 = 𝜀], The Complexity of Public-Key Cryptography, A new attack on RSA and Demytko’s elliptic curve cryptosystem
