Hardware Implementation of Finite-Field Arithmetic (Electronic Engineering)

CORDIC (Wikipedia) would be a good example of an algorithm designed for hardware. You can do various trig functions and vector rotations using shift and add primitives - things that map very well to the simple HW that was available to the B-58 designers in the mid 1950s. Early HP calculators used CORDIC for their trig functions. Modern CPUs don't, because they have high performance multipliers and can use other methods. EDIT: that reminds me that I've recently ordered two books by Deschamps et al:Hardware Implementation of Finite-Field Arithmetic (Electronic Engineering), 1st edition, 2009.https://www.amazon.com/dp/0071545816andGuide to FPGA Implementation of Arithmetic Functions, 2012.https://www.amazon.com/dp/9400729863

Only semi related, OP, you may be interested in this book: Hardware Implementation of Finite-Field Arithmetic (Electronic Engineering) https://a.co/d/fuaaN5g It has algorithmic arithmetic operations over GF(2m) and GF(pm). It's utterly incomprehensible to me because I don't understand linear algebra or field arithmetic or graph theory, but maybe you do and will fair better. (Of course, if you do have any tips for how you came to understanding those topics, please do tell! I'm just hoping I dont need to sign up for classes at my closest university or junior college.) Deschutes has other books as well that are useful for algorithmic implementations like this: Guide to FPGA Implementation of Arithmetic Functions (Lecture Notes in Electrical Engineering, 149) https://a.co/d/4CfXtNA