This paper, published in the Journal of Cryptology, explores the design of efficient digital arithmetic circuits for cryptographic applications. The authors present novel architectures for modular multiplication and exponentiation, which are critical operations in many cryptographic algorithms.
While the book was published in 2003, the principles are more relevant today than ever.
AI accelerators rely on massive arrays of Multiply-Accumulate (MAC) units. The low-power arithmetic techniques described by Ercegovac and Lang are the blueprint for these chips.
Every algorithm is evaluated based on its physical implementation cost. 🧠 Core Topics Covered digital arithmetic by ercegovac and lang pdf
These are often the most difficult operations to implement. The authors are famous for their work on the SRT (Sweeney, Robertson, and Tocher) algorithm, using digit-recurrence methods to achieve high-speed results with manageable hardware area. 4. CORDIC and Beyond
Below is an original feature titled: —inspired by themes from Ercegovac & Lang (e.g., redundant number systems, signed-digit representations, and online arithmetic).
Detailed implementations of Carry-Ripple (CRA), Carry-Skip, Carry-Lookahead (CLA), and Prefix adders. This paper, published in the Journal of Cryptology,
The primary publisher for the digital eBook.
Techniques like reduction by rows/columns and the use of [p:g] counters.
A radix- r signed-digit number uses digit set -α, …, α where α > r/2. For radix 2, the digit set -1,0,1 works. 🧠 Core Topics Covered These are often the
Uses consistent notation to explain addition, multiplication, and division.
If you’d like, I can also: