scientific article; zbMATH DE number 1088245
From MaRDI portal
Publication:4364562
Recommendations
- Efficient elliptic curve cryptosystems
- Efficient algorithms for speeding up the computations of elliptic curve cryptosystems
- scientific article; zbMATH DE number 2160554
- Efficient techniques for high-speed elliptic curve cryptography
- scientific article; zbMATH DE number 6125198
- Efficient arithmetic on elliptic curve cryptography
- scientific article; zbMATH DE number 1583945
- scientific article; zbMATH DE number 176556
- Implementation of cryptographic algorithms for elliptic curves
Cited in
(30)- Secure and compact elliptic curve cryptosystems
- Applying systolic multiplication-inversion architectures based on modified extended Euclidean algorithm for \(\text{GF}(2^k)\) in elliptic curve cryptography
- An efficient threshold group signature scheme
- Efficient algorithms for speeding up the computations of elliptic curve cryptosystems
- Higher-order masking in practice: a vector implementation of masked AES for ARM NEON
- A fast addition algorithm for elliptic curve arithmetic in \(\mathrm{GF}(2^{n})\) using projective coordinates
- MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
- Fast Point Decompression for Standard Elliptic Curves
- Optimal Extension Field Inversion in the Frequency Domain
- Efficient arithmetic on elliptic curve cryptography
- scientific article; zbMATH DE number 1186884 (Why is no real title available?)
- scientific article; zbMATH DE number 1302784 (Why is no real title available?)
- scientific article; zbMATH DE number 708816 (Why is no real title available?)
- scientific article; zbMATH DE number 1030980 (Why is no real title available?)
- scientific article; zbMATH DE number 2080677 (Why is no real title available?)
- scientific article; zbMATH DE number 1504541 (Why is no real title available?)
- scientific article; zbMATH DE number 1504820 (Why is no real title available?)
- Efficient elliptic curve cryptosystems
- Extended elliptic curve Montgomery ladder algorithm over binary fields with resistance to simple power analysis
- Elliptic curve cryptography arithmetic in terms of one variable polynomial division
- Optimal software-implemented Itoh-Tsujii inversion for \(\mathbb{F}_{2^{m}}\)
- Efficient modular reduction algorithm in \(\mathbb F_q[x]\) and its application to ``left to right modular multiplication in \(\mathbb F_2[x]\).
- Speeding up the computations on an elliptic curve using addition-subtraction chains
- The double-base number system and its application to elliptic curve cryptography
- New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields
- Information Security and Cryptology
- Efficient arithmetic in finite field extensions with application in elliptic curve cryptography.
- An extension of TYT algorithm for GF((2ⁿ)^m) using precomputation
- Efficient hardware implementation of finite fields with applications to cryptography
- Optimal Karatsuba-like formulae for certain bilinear forms in GF(2)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4364562)
