This article is part of a series of hands-on tutorials introducing FFA, or the Finite Field Arithmetic library. FFA differs from the typical “Open Sores” abomination, in that — rather than trusting the author blindly with their lives — prospective users are expected to read and fully understand every single line. In exactly the same […]

This article is part of a series of hands-on tutorials introducing FFA, or the Finite Field Arithmetic library. FFA differs from the typical “Open Sores” abomination, in that — rather than trusting the author blindly with their lives — prospective users are expected to read and fully understand every single line. In exactly the same […]

The long-promised Keccak-V regrind of the current FFA codebase appears below: Title VPatch Seal “Chapter 1: Genesis.” ffa_ch1_genesis.kv.vpatch ffa_ch1_genesis.kv.vpatch.asciilifeform.sig “Chapter 2: Logical and Bitwise Operations.” ffa_ch2_logicals.kv.vpatch ffa_ch2_logicals.kv.vpatch.asciilifeform.sig “Chapter 3: Shifts.” ffa_ch3_shifts.kv.vpatch ffa_ch3_shifts.kv.vpatch.asciilifeform.sig “Chapter 4: Interlude: FFACalc.” ffa_ch4_ffacalc.kv.vpatch ffa_ch4_ffacalc.kv.vpatch.asciilifeform.sig “Chapter 5: “Egyptological” Multiplication and Division.” ffa_ch5_egypt.kv.vpatch ffa_ch5_egypt.kv.vpatch.asciilifeform.sig Chapter 6: “Geological” RSA. ffa_ch6_simplest_rsa.kv.vpatch ffa_ch6_simplest_rsa.kv.vpatch.asciilifeform.sig Chapter 7: “Turbo […]

In addition to phf’s excellent vpatch viewer, there will now be a page, generated via gnathtml, to help the interested reader to explore the moving parts of FFA. Click here to view Ch.11, with ffa_calc.adb as the root node. All subsequent chapters will also be offered in this reader-friendly format, in addition to the usual […]

This article is a continuation of the previous, and concludes the series. Let’s try this somewhat different variant of the program, which represents recurring bits of the expansion symbolically (and in a slightly more readable form) : ;; Register bitness. (defconstant +bitness+ 32)   (defun make-reg (reg-name bitness) "Make algebraic representation of a register (bits […]

This article is a continuation of the dig into the key schedule of the Serpent cipher. For clarity, we will omit the routines already given in the previous article. Let’s visualize the Serpent key schedule as a graphic: ;; 256bit(key)+1(const) x 4224(132*32) matrix, last column for constant subterms (defvar *matrix* (make-array ‘(257 4224) :element-type ‘(mod […]

This article is a continuation of the recent mega-puzzler concerning the experiment. This variant will reduce the equations. We will omit printing the input matrix, for brevity. And so: ;; Register bitness. (defconstant +bitness+ 32)   (defun flatten (l) "Flatten a tree." (cond ((null l) nil) ((atom l) (list l)) (t (mapcan #’flatten l))))   […]

This article is a byproduct of the recent mega-puzzler concerning the Serpent cipher’s key expansion procedure. Behold: ;; Register bitness. (defconstant +bitness+ 32)   (defun make-reg (reg-name bitness) "Make algebraic representation of a register (bits in descending majority)" (loop for i from (1- bitness) downto 0 collect (make-symbol (format nil "~A~A" reg-name i))))   (defun […]

This article is a continuation of “Can the Serpent Cipher fit in the ICE40 FPGA?”. Below is a revision of the forward S-box of Serpent from the previous article, with all of the S-Box equations rewritten in the same form, i.e. using strictly AND, OR, and NOT operations, with none having more than six subclauses, […]

Current Table of Contents: The question of whether the Serpent cipher could fit in a ICE40 FPGA was posed recently, and my first thought was: why not bake what appears to be the heaviest moving part, and see how many gates it requires? Then it will be possible to estimate whether the entire thing is […]