Elliptic Curve Cryptosystems
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- New schemes for sharing points on an elliptic curve
- Elliptic curve based hardware architecture using cellular automata
- Constructive and destructive use of compilers in elliptic curve cryptography
- Expander graphs based on GRH with an application to elliptic curve cryptography
- Improvement of the Miyazaki-Takaragi threshold digital signature scheme
- Quasi-quadratic elliptic curve point counting using rigid cohomology
- Subtraction-free almost Montgomery inverse algorithm
- A note on window \(\tau\)-NAF algorithm
- Self-certified multi-proxy signature schemes with message recovery
- Primality of the number of points on an elliptic curve over a finite field
- A key distribution system equivalent to factoring
- A key-exchange system based on imaginary quadratic fields
- Hyperelliptic cryptosystems
- Computation of discrete logarithms in prime fields
- Elliptic curve implementation of zero-knowledge blobs
- A note on cyclic groups, finite fields, and the discrete logarithm problem
- Cryptography and elliptic curves
- Elliptic curve cryptosystems and their implementation
- Speeding up the computations of elliptic curves cryptoschemes
- Batch RSA
- Secure Web transaction with anonymous mobile agent over Internet
- Selection of secure hyperelliptic curves of \textit{g=2} based on a subfield
- Input-trees of finite automata and application to cryptanalysis
- Elliptic curve Paillier schemes
- A note on the \(x\)-coordinate of points on an elliptic curve in characteristic two
- Avoiding side-channel attacks by computing isogenous and isomorphic elliptic curves
- Provably secure and pairing-based strong designated verifier signature scheme with message recovery
- High-performance generic-point parallel scalar multiplication
- Robust and efficient authentication scheme for session initiation protocol
- Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods
- Lattice attacks against elliptic-curve signatures with blinded scalar multiplication
- Connecting Legendre with Kummer and Edwards
- Image encryption technology based on fractional two-dimensional triangle function combination discrete chaotic map coupled with Menezes-Vanstone elliptic curve cryptosystem
- An elliptic curve analogue to the Fermat numbers
- How to (pre-)compute a ladder -- improving the performance of X25519 and X448
- On the discrete logarithm problem for prime-field elliptic curves
- Metrics on the sets of nonsupersingular elliptic curves in simplified Weierstrass form over finite fields of characteristic two
- An optimal Tate pairing computation using Jacobi quartic elliptic curves
- Secure simultaneous bit extraction from Koblitz curves
- Cryptanalysis and improvement of an access control in user hierarchy based on elliptic curve cryptosystem
- Cryptanalysis of a communication-efficient three-party password authenticated key exchange protocol
- Cryptanalysis of Lee-Hwang-Li's key authentication scheme
- A threshold signature scheme based on the elliptic curve cryptosystem
- Self-certified threshold proxy signature schemes with message recovery, nonrepudiation, and traceability
- Efficient algorithms for Koblitz curves over fields of characteristic three
- An efficient undeniable group-oriented signature scheme
- Fast group operations on elliptic curves in Maple
- Fast computation of canonical lifts of elliptic curves and its application to point counting.
- Remarks on the zeta function of some diagonal hyperelliptic curves
- Speeding up elliptic curve discrete logarithm computations with point halving
- Bounds and trade-offs for double-base number systems
- Elliptic curve discrete logarithm problem over small degree extension fields
- The state of elliptic curve cryptography
- On the representation of the number of integral points of an elliptic curve modulo a prime number
- Protecting ECC against fault attacks: the ring extension method revisited
- Complexity bounds on Semaev's naive index calculus method for ECDLP
- Algebraic approaches for solving isogeny problems of prime power degrees
- Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem
- Non-uniform birthday problem revisited: refined analysis and applications to discrete logarithms
- Pell hyperbolas in DLP-based cryptosystems
- Efficient arithmetic in (pseudo-)Mersenne prime order fields
- Fast and secure updatable encryption
- Pseudorandom vector generation using elliptic curves and applications to Wiener processes
- Efficient FPGA design of exception-free generic elliptic curve cryptosystems
- SimS: a simplification of SiGamal
- A secure searchable encryption scheme for cloud using hash-based indexing
- Multiple images encryption based on 3D scrambling and hyper-chaotic system
- Another look at extraction and randomization of Groth's zk-SNARK
- The matrix reloaded: multiplication strategies in FrodoKEM
- Algebraic secret sharing using privacy homomorphisms for IoT-based healthcare systems
- The complete cost of cofactor \(h=1\)
- Secure and compact elliptic curve cryptosystems
- An application of crypto cloud computing in social networks by cooperative game theory
- A pairing-free and provably secure certificateless signature scheme
- An efficient certificateless aggregate signature without pairings for vehicular ad hoc networks
- An efficient and batch verifiable conditional privacy-preserving authentication scheme for VANETs using lattice
- Group law on affine conics and applications to cryptography
- Function S-rough sets and security-authentication of hiding law
- One-way permutations on elliptic curves
- Kummer for genus one over prime-order fields
- Eliptic curves in post-quantum cryptography
- Koblitz curves over quadratic fields
- Fast elliptic curve point multiplication based on window non-adjacent form method
- Analysis and enhancement of a password authentication and update scheme based on elliptic curve cryptography
- Conjugacy systems based on nonabelian factorization problems and their applications in cryptography
- A simple method for obtaining relations among factor basis elements for special hyperelliptic curves
- Finite field arithmetic using quasi-normal bases
- Inverse problems of chaotic dynamics and statistical analysis in providing information security in communication systems and networks
- Elliptic curve scalar multiplication algorithm using complementary recoding
- Explicit bounds of polynomial coefficients and counting points on Picard curves over finite fields
- Jacobian coordinates on genus 2 curves
- 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 the cyclicity of the rational points group of abelian varieties over finite fields
- Cryptography on elliptic curves over \(p\) -adic number fields
- Elliptic curve cryptography: the serpentine course of a paradigm shift
- Finding composite order ordinary elliptic curves using the Cocks-Pinch method
- Group arithmetic in \(C_{3,5}\) curves
- On some connections between statistics and cryptology
This page was built for publication: Elliptic Curve Cryptosystems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3760431)
