92
edits
EMD/CRT: Difference between revisions
m
no edit summary
(Created page with "==The [https://en.wikipedia.org/wiki/Chinese_remainder_theorem Chinese Remainder Theorem is a very useful result in the theory of prime numbers== In June 2022 EMD used the CRT to devise a maximally collision-resistant checksum with an entropy in excess of 323 bits without the hassle of careful CRC design. He then wrote simple C programs to select near-optimal prime moduli based a candidate table cribbed from [https://math.utm.edu/lists/2small/0bit.html], and to det...") |
mNo edit summary |
||
Line 1:
==The [https://en.wikipedia.org/wiki/Chinese_remainder_theorem Chinese Remainder Theorem] is a
In June 2022 [[EMD]] used the CRT to devise a maximally collision-resistant checksum with an entropy in excess of 323 bits without the hassle of careful CRC design. He then wrote simple C programs to select near-optimal prime moduli based a candidate table cribbed from [https://math.utm.edu/lists/2small/0bit.html], and to determine good 'geometries' (ie formats) for temporary files recording bitvectors totalling 547 30-bit words, suitable for recording whether or not a file having length congruent to each number in the range 1..2^14 exists in a given directory (aka 'folder'); 547x30 = 2^24+26 = 16410. Satisfied, he wrote a rather longer C program to:-
For obvious reasons, the resulting output file has a '.CRT' filename extension. EMD then wrote another, somewhat shorter, C program to read up to five CRT files simultaneously and generate a report of consistencies and inconsistencies; these two programs were soon integrated into a single executable, 'SinoSure.EXE', intended to verify that filesystems have been accurately duplicated onto backup media.
| |||