High-performance generic-point parallel scalar multiplication
DOI10.1007/S13369-016-2272-6zbMATH Open1391.94828OpenAlexW2463982012MaRDI QIDQ1640404FDOQ1640404
Authors: Turki F. Al-Somani 
Publication date: 14 June 2018
Published in: Arabian Journal for Science and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13369-016-2272-6
Recommendations
- Research of high performance architecture for elliptic curve scalar multiplication over GF (\(2^m\))
- Parallel formulations of scalar multiplication on Koblitz curves
- Parallel crypto-devices for GF\((p)\) elliptic curve multiplication resistant against side channel attacks
- Pushing the Limits of High-Speed GF(2 m ) Elliptic Curve Scalar Multiplication on FPGAs
- A high speed coprocessor for elliptic curve scalar multiplications over \(\mathbb{F}_p\)
Parallel numerical computation (65Y05) Applications to coding theory and cryptography of arithmetic geometry (14G50) Authentication, digital signatures and secret sharing (94A62) Numerical algorithms for computer arithmetic, etc. (65Y04)
Cites Work
- A method for obtaining digital signatures and public-key cryptosystems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Elliptic Curve Cryptosystems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Low complexity normal bases
- Title not available (Why is that?)
- Title not available (Why is that?)
- High-performance generic-point parallel scalar multiplication
- High-Performance Architecture of Elliptic Curve Scalar Multiplication
Cited In (2)
This page was built for publication: High-performance generic-point parallel scalar multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1640404)
