Apply the full S-box substitution to the state vector.
We raise to the
Function:
(defun sub-words-full (stat alpha prime) (declare (xargs :guard (and (integerp alpha) (primep prime) (fe-listp stat prime)))) (let ((__function__ 'sub-words-full)) (declare (ignorable __function__)) (cond ((endp stat) nil) (t (cons (pow-by-alpha (car stat) alpha prime) (sub-words-full (cdr stat) alpha prime))))))
Theorem:
(defthm fe-listp-of-sub-wordsfull (implies (primep prime) (b* ((new-stat (sub-words-full stat alpha prime))) (fe-listp new-stat prime))) :rule-classes :rewrite)
Theorem:
(defthm len-of-sub-words-full (b* ((?new-stat (sub-words-full stat alpha prime))) (equal (len new-stat) (len stat))))