k-order propagation in hyperbolic reasoning calculation spaces




if we think in terms of Wildberger’s universal hyberbolic geometry, the case for defenses against linear cryptanalysis is one of ensuring that a wheel of points is assumed to have to each point a binary value and one looks back from the current pointer sufficient pads to get the components of the codeword, that has the requisite number of hamming bits. IN the case of differential cryptanalysis, one looks back enough component terms so one has k supports


About home_pw

Computer Programmer who often does network administration with focus on security servers. Sometimes plays at slot machine programming.
This entry was posted in crypto. Bookmark the permalink.