mirror of
https://github.com/luxfi/crypto.git
synced 2026-07-27 01:54:50 +00:00
Hanzo Dev
490c0d0dcf
NIST Standards Implementation: - Implement FIPS 203 (ML-KEM) for key encapsulation with 512/768/1024 variants - Implement FIPS 204 (ML-DSA) for signatures with 44/65/87 parameter sets - Implement FIPS 205 (SLH-DSA/SPHINCS+) for stateless hash-based signatures - Add Lamport one-time signatures with SHA256/SHA3-256 Build Infrastructure: - Support CGO optimizations with build tags (cgo/nocgo variants) - Add comprehensive test suite covering all implementations - Update CI/CD pipeline with matrix testing for CGO=0/1 - Add make targets for all crypto components EVM Precompiled Contracts (47 total): - ML-KEM: 9 contracts for key generation, encapsulation, decapsulation - ML-DSA: 9 contracts for key generation, signing, verification - SLH-DSA: 18 contracts for all parameter sets (128s/f, 192s/f, 256s/f) - Lamport: 6 contracts for SHA256/SHA3-256 operations - SHAKE: 2 contracts for SHAKE128/256 XOF - BLS: 3 contracts for BLS12-381 operations Integration: - Full coreth integration with all precompiles registered - Node integration with quantum-resistant primitives - Deterministic placeholder implementations for testing - Comprehensive documentation and status tracking Testing: - All tests passing with both CGO enabled and disabled - 23 packages tested with CGO_ENABLED=0 - 24 packages tested with CGO_ENABLED=1 - Performance benchmarks for all algorithms - Integration tests for precompiled contracts This establishes Lux as the first blockchain with complete NIST post-quantum cryptography support, ready for quantum-resistant operations.
52 lines
1.1 KiB
C
52 lines
1.1 KiB
C
#include <stddef.h>
|
|
#include <stdint.h>
|
|
#include <stdlib.h>
|
|
#include <stdio.h>
|
|
#include "cpucycles.h"
|
|
#include "speed_print.h"
|
|
|
|
static int cmp_uint64(const void *a, const void *b) {
|
|
if(*(uint64_t *)a < *(uint64_t *)b) return -1;
|
|
if(*(uint64_t *)a > *(uint64_t *)b) return 1;
|
|
return 0;
|
|
}
|
|
|
|
static uint64_t median(uint64_t *l, size_t llen) {
|
|
qsort(l,llen,sizeof(uint64_t),cmp_uint64);
|
|
|
|
if(llen%2) return l[llen/2];
|
|
else return (l[llen/2-1]+l[llen/2])/2;
|
|
}
|
|
|
|
static uint64_t average(uint64_t *t, size_t tlen) {
|
|
size_t i;
|
|
uint64_t acc=0;
|
|
|
|
for(i=0;i<tlen;i++)
|
|
acc += t[i];
|
|
|
|
return acc/tlen;
|
|
}
|
|
|
|
void print_results(const char *s, uint64_t *t, size_t tlen) {
|
|
size_t i;
|
|
static uint64_t overhead = -1;
|
|
|
|
if(tlen < 2) {
|
|
fprintf(stderr, "ERROR: Need a least two cycle counts!\n");
|
|
return;
|
|
}
|
|
|
|
if(overhead == (uint64_t)-1)
|
|
overhead = cpucycles_overhead();
|
|
|
|
tlen--;
|
|
for(i=0;i<tlen;++i)
|
|
t[i] = t[i+1] - t[i] - overhead;
|
|
|
|
printf("%s\n", s);
|
|
printf("median: %llu cycles/ticks\n", (unsigned long long)median(t, tlen));
|
|
printf("average: %llu cycles/ticks\n", (unsigned long long)average(t, tlen));
|
|
printf("\n");
|
|
}
|