123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657 |
- /* vim: set expandtab ts=4 sw=4: */
- /*
- * You may redistribute this program and/or modify it under the terms of
- * the GNU General Public License as published by the Free Software Foundation,
- * either version 3 of the License, or (at your option) any later version.
- *
- * This program is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- * GNU General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License
- * along with this program. If not, see <https://www.gnu.org/licenses/>.
- */
- #include "crypto/ReplayProtector.h"
- #include "crypto/random/Random.h"
- #include "memory/MallocAllocator.h"
- #include "util/Assert.h"
- #include <stdint.h>
- #include <stddef.h>
- #define CYCLES 1
- static void testDuplicates(struct Random* rand)
- {
- uint16_t randomShorts[8192];
- uint16_t out[8192];
- struct ReplayProtector rp = {.bitfield = 0};
- Random_bytes(rand, (uint8_t*)randomShorts, sizeof(randomShorts));
- uint32_t outIdx = 0;
- for (uint32_t i = 0; i < 1024; i++) {
- if (ReplayProtector_checkNonce((randomShorts[i] % (i + 20)), &rp)) {
- out[outIdx] = (randomShorts[i] % (i + 20));
- outIdx++;
- }
- }
- for (uint32_t i = 0; i < outIdx; i++) {
- for (uint32_t j = i + 1; j < outIdx; j++) {
- Assert_true(out[i] != out[j]);
- }
- }
- }
- int main()
- {
- struct Allocator* alloc = MallocAllocator_new(4096);
- struct Random* rand = Random_new(alloc, NULL, NULL);
- for (int i = 0; i < CYCLES; i++) {
- testDuplicates(rand);
- }
- Allocator_free(alloc);
- return 0;
- }
|