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 raw vpatch [...]
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) [...]
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 [...]
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)
[...]
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 [...]
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, [...]
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 [...]
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 [...]
I have the pleasure of informing my readers that…
Phuctor is back!
It — exactly as it was, but with a few minor fix-ups for browsing speed — now lives on a very spiffy 32-core Opteron at Pizarro, the ISP.
The WWW UI is already up; the factoring proper will resume later tonight.
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 [...]
