Yparxia
Year: 2017
Theorem “About amount of XOR-sums over the given sequence of bits”
Supporting materials: Note: this article uses supporting theorems, such as “Common commutative law” and “About amount of subsets in the given set”. Since I’m yet unable to find their analogues on English-language resources, I’ll cite their statements in this section. Theorem “The common commutative law”: suppose given non-empty set , – associative and commutative binary…
Theorem “About amount of scramblers of given length”
Statement: Suppose a given amount of bits of scrambler . Then there exist scramblers of the length . Proof: Key of the scrambler – certain sequence of bits of the length . After reviewing key as vector of set , it’s possible to make conclusion, that in total there exist keys of the length ….