scientific article; zbMATH DE number 1504541

MaRDI QIDQ4502489zbMATH OpenFDO

Authors Yongfei Han, Peng-Chor Leong, Peng-Chong Tan, Jiang Zhang

Publication date 12 September 2000

zbMATH Keywords

complexityelliptic curve cryptosystemfield multiplicationfinite field arithmeticmodular reduction

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Computational aspects of algebraic curves (14Q05) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 2058638
• Efficient algorithms for speeding up the computations of elliptic curve cryptosystems
• scientific article; zbMATH DE number 1088245
• Speeding up the computations of elliptic curves cryptoschemes
• Efficient arithmetic in finite field extensions with application in elliptic curve cryptography.
• scientific article; zbMATH DE number 1857519
• Fast scalar multiplication for elliptic curves over binary fields by efficiently computable formulas
• Fast point multiplication algorithms for binary elliptic curves with and without precomputation
• Efficient arithmetic on elliptic curve cryptography
• Efficient elliptic curve cryptosystems

Cited in

(9)

• Efficient algorithms for speeding up the computations of elliptic curve cryptosystems
• A simple encryption scheme for binary elliptic curves
• scientific article; zbMATH DE number 2043312 (Why is no real title available?)
• scientific article; zbMATH DE number 2058638 (Why is no real title available?)
• scientific article; zbMATH DE number 1759315 (Why is no real title available?)
• scientific article; zbMATH DE number 1857519 (Why is no real title available?)
• scientific article; zbMATH DE number 1440071 (Why is no real title available?)
• A comparison of different finite fields for elliptic curve cryptosystems
• Efficient software-implementation of finite fields with applications to cryptography

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 Q4502489)