As case studies, we verify the asymptotic time complexity (in addition to functional correctness) of imperative algorithms and data structures such as median of medians selection, Karatsuba's algorithm, and splay trees.doi:10.1007/978-3-319-94205-6_35Bohua Zhan...
The paper presents analysis of GF(2m) two-step modular multiplication algorithms. It considers classical (standard, school-book) multiplication, matrix-vector approach algorithm and Karatsuba-Ofman algorithm, exploring thoroughly their advantages and disadvantages....
The paper presents analysis of GF(2~m) two-step modular multiplication algorithms. It considers classical (standard, school-book) multiplication, matrix-vector approach algorithm and Karatsuba-Ofman algorithm, exploring thoroughly their advantages and disadvantages.Danuta Pamula...
Karatsuba-OfmanEfficient arithmetic units are crucial for cryptographic hardware design. The cryptographic systems are based on mathematical theories thus they strongly depend on the performance of the arithmetic units comprising them. If the arithmetic operator does not take a considerable amount of ...
Salarifard [25] presents two low-complexity (LC) and low-latency (LL) architectures based on the comb algorithm at 𝐺𝐹(2𝑚)GF(2m). The parallel ECSM algorithm sometimes also causes the area of the control circuit and the storage circuit to increase, resulting in the overall circuit ...