Elliptic curve cryptosystems and their implementation
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 4200379 (Why is no real title available?)
- scientific article; zbMATH DE number 3937328 (Why is no real title available?)
- scientific article; zbMATH DE number 3948147 (Why is no real title available?)
- scientific article; zbMATH DE number 3956969 (Why is no real title available?)
- scientific article; zbMATH DE number 4035724 (Why is no real title available?)
- scientific article; zbMATH DE number 4057589 (Why is no real title available?)
- scientific article; zbMATH DE number 176613 (Why is no real title available?)
- scientific article; zbMATH DE number 503248 (Why is no real title available?)
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex>
- An implementation for a fast public-key cryptosystem
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Arithmetic operations in \(GF(2^ m)\)
- Counting Points on Elliptic Curves Over F 2 m
- Discrete logarithms in \(\mathrm{GF}(p)\)
- Elliptic Curve Cryptosystems
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
- Elliptic curve implementation of zero-knowledge blobs
- Factorizations of đâżÂ±1, đ=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
- Fast evaluation of logarithms in fields of characteristic two
- Low complexity normal bases
- New directions in cryptography
- Optimal normal bases in \(GF(p^ n)\)
- Reducing elliptic curve logarithms to logarithms in a finite field
- Speeding the Pollard and Elliptic Curve Methods of Factorization
Cited in
(33)- Information authentication in automated control systems based on finite groups with multidimensional cyclicity
- scientific article; zbMATH DE number 16233 (Why is no real title available?)
- Efficient hardware implementation of elliptic curve cryptosystems
- scientific article; zbMATH DE number 4145824 (Why is no real title available?)
- Bézier Coefficients Matrix for ElGamal Elliptic Curve Cryptosystem
- Elliptic curve cryptosystems in the presence of permanent and transient faults
- scientific article; zbMATH DE number 2042246 (Why is no real title available?)
- An End-to-End Systems Approach to Elliptic Curve Cryptography
- Implementation of electronic transaction algorithm based on elliptic curves
- Further refinement of pairing computation based on Miller's algorithm
- Assessing the effectiveness of artificial neural networks on problems related to elliptic curve cryptography
- The state of elliptic curve cryptography
- scientific article; zbMATH DE number 2232692 (Why is no real title available?)
- scientific article; zbMATH DE number 1759279 (Why is no real title available?)
- Guest editorial: Special issue in honor of Scott A. Vanstone
- Efficient elliptic curve cryptosystems
- scientific article; zbMATH DE number 4191556 (Why is no real title available?)
- Fast simultaneous scalar multiplication
- scientific article; zbMATH DE number 1186878 (Why is no real title available?)
- Secure elliptic curves and their performance
- Arithmetic on elliptic curves with use of graphic calculators
- A systolic architecture for implementing the arithmetic of cryptographic algorithms on elliptic curves
- scientific article; zbMATH DE number 6001033 (Why is no real title available?)
- Generation and implementation of cryptographically strong elliptic curves
- scientific article; zbMATH DE number 1186884 (Why is no real title available?)
- ECC\(^2\): error correcting code and elliptic curve based cryptosystem
- Implementation of high speed arithmetic point production model for elliptic curve engine
- scientific article; zbMATH DE number 1617931 (Why is no real title available?)
- Speeding up the elliptic curve scalar multiplication using non adjacent form
- IMPLEMENTATION ISSUES FOR ARITHMETIC OVER EXTENSION FIELDS OF CHARACTERISTIC ODD
- Secure and compact elliptic curve cryptosystems
- Elliptic curve scalar multiplication algorithm using complementary recoding
- An identity-based encryption scheme using isogeny of elliptic curves
This page was built for publication: Elliptic curve cryptosystems and their implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1312102)