EMD/CRT: Revision history

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

11 August 2022

11 July 2022

2 July 2022

  • curprev 18:1618:16, 2 July 2022‎ Ftwm talk contribs‎ m 1,588 bytes 0‎ No edit summary
  • curprev 15:2415:24, 2 July 2022‎ Ftwm talk contribs‎ 1,588 bytes +37‎ No edit summary
  • curprev 15:0515:05, 2 July 2022‎ Ftwm talk contribs‎ m 1,551 bytes +4‎ No edit summary
  • curprev 15:0215:02, 2 July 2022‎ Ftwm talk contribs‎ 1,547 bytes +1,547‎ 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..."
Retrieved from "https://you.r-fit.cc/wiki/EMD/CRT"