10. A computer program embodied on a non-transitory computer executable medium and configured to be executed by a processor, the program comprising: code for receiving a digital document in a word processing format into a non-transitory computer readable medium; code for generating a first baseline data sequence from the digital document, the first baseline data sequence having a first printable element and a second printable element following the first printable element of the first baseline data sequence; code for generating a first modified data sequence from the first baseline data sequence in accordance with a set of modification rules, the first modified data sequence having a first printable element and a second printable element following the first printable element of the first modified data sequence, wherein the first printable element of the first modified data sequence is identical to the first printable element of the first baseline data sequence, wherein the second printable element of the first modified data sequence is identical to the second element of the first baseline data sequence, wherein at least one unprintable element of the first baseline data sequence, between the first and final printable elements of the first baseline data sequence, is not in the first modified data sequence, so that the first modified data sequence is shorter than the first baseline data sequence, and wherein an integrity verification code (IVC) generated for the first modified data sequence will differ from an IVC generated for the first baseline data sequence; code for generating a first original IVC, wherein generating a first original IVC comprises performing a one-way operation on the first modified data sequence, and wherein the modification rules render tampering of the digital document undetectable for the at least one unprintable element within the first baseline data sequence; code for generating a second baseline data sequence from the digital document, the second baseline data sequence having a first printable element and a second printable element following the first printable element of the second baseline data sequence; wherein the second baseline data sequence is different than the first baseline data sequence, code for generating a second modified data sequence from the second baseline data sequence in accordance with the set of modification rules, the second modified data sequence having a first printable element and a second printable element following the first printable element of the second modified data sequence, wherein the first printable element of the second modified data sequence is identical to the first printable element of the second baseline data sequence, wherein the second printable element of the second modified data sequence is identical to the second element of the second baseline data sequence, wherein at least one unprintable element of the second baseline data sequence, between the first and final printable elements of the second baseline data sequence, is not in the second modified data sequence, so that the second modified data sequence is shorter than the second baseline data sequence, and wherein an IVC generated for the second modified data sequence will differ from an IVC generated for the second baseline data sequence; code for generating a second original IVC, wherein generating a second original IVC comprises performing a one-way operation on the second modified data sequence, and wherein the modification rules render tampering of the digital document undetectable for the at least one unprintable element within the second baseline data sequence; and code for publishing the digital document with at least a portion of the first original IVC and the second original IVC rendered on a face of the published document.
17. The program of claim 10 further comprising code for generating a third baseline data sequence from the digital document, the third baseline data sequence having a first printable element and a second printable element following the first printable element of the third baseline data sequence; wherein the third baseline data sequence is different than the first baseline data sequence and the second baseline data sequence, code for generating a third modified data sequence from the third baseline data sequence in accordance with the set of modification rules, the third modified data sequence having a first printable element and a second printable element following the first printable element of the third modified data sequence, wherein the first printable element of the second modified data sequence is identical to the first printable element of the third baseline data sequence, wherein the second printable element of the third modified data sequence is identical to the second element of the third baseline data sequence, wherein at least one unprintable element of the third baseline data sequence, between the first and final printable elements of the third baseline data sequence, is not in the third modified data sequence, so that the third modified data sequence is shorter than the third baseline data sequence, and wherein an IVC generated for the third modified data sequence will differ from an IVC generated for the third baseline data sequence; code for generating a third original IVC, wherein generating a third original IVC comprises performing a one-way operation on the third modified data sequence, and wherein the modification rules render tampering of the digital document undetectable for the at least one unprintable element within the third baseline data sequence; wherein the third baseline data sequence is a different published page than the second baseline data sequence and both the third baseline data sequence and the second baseline data sequence are each a subset, less than all, of the first baseline data sequence; and wherein the code for publishing comprises code for publishing at least a portion of the third original IVC the face of the published document.