Re: [Diehard] Overlap sum test

From: Douglas A. Gwyn (DAGwyn_at_null.net)
Date: 09/25/03


Date: Thu, 25 Sep 2003 16:04:33 GMT

The crypto code itself is not especially complex, and when there
are sufficient standards, implementations can be checked for
correctness to a large degree simply by seeing if they are
interoperable with independent implementations of the standards.



Relevant Pages

  • Re: [Diehard] Overlap sum test
    ... > The crypto code itself is not especially complex, ... > correctness to a large degree simply by seeing if they are ... > interoperable with independent implementations of the standards. ...
    (sci.crypt)
  • Re: [Diehard] Overlap sum test
    ... > The crypto code itself is not especially complex, ... > correctness to a large degree simply by seeing if they are ... > interoperable with independent implementations of the standards. ...
    (sci.crypt)
  • Re: [Diehard] Overlap sum test
    ... >> The crypto code itself is not especially complex, ... >> interoperable with independent implementations of the standards. ... in full interoperability while being technically "altogether wrong". ...
    (sci.crypt)
  • Re: [Diehard] Overlap sum test
    ... >> The crypto code itself is not especially complex, ... >> interoperable with independent implementations of the standards. ... in full interoperability while being technically "altogether wrong". ...
    (sci.crypt)
  • Re: [Diehard] Overlap sum test
    ... The crypto code itself is not especially complex, ... correctness to a large degree simply by seeing if they are ... interoperable with independent implementations of the standards. ...
    (sci.crypt)