vaea-ntt 0.1.1

High-performance Number Theoretic Transform (NTT) for post-quantum cryptography. ARM NEON SIMD native, constant-time, no_std. ML-DSA, Falcon, FHE. Dual-licensed AGPL-3.0 + commercial.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57

#ifndef VaeaPrimeList_D_HPP
#define VaeaPrimeList_D_HPP

#include <stdio.h>
#include <stdint.h>
#include <stddef.h>
#include <stdbool.h>
#include <memory>
#include <functional>
#include <optional>
#include <cstdlib>
#include "diplomat_runtime.hpp"


namespace diplomat {
namespace capi {
    struct VaeaPrimeList;
} // namespace capi
} // namespace

/**
 * Result of prime generation: a list of primes.
 */
class VaeaPrimeList {
public:

  /**
   * Generates `count` NTT-friendly 28-bit primes for polynomial size `n`.
   */
  inline static std::unique_ptr<VaeaPrimeList> generate(size_t n, size_t count);

  /**
   * Returns the number of primes in the list.
   */
  inline size_t len() const;

  /**
   * Returns the prime at the given index (0-based).
   */
  inline uint32_t get(size_t index) const;

    inline const diplomat::capi::VaeaPrimeList* AsFFI() const;
    inline diplomat::capi::VaeaPrimeList* AsFFI();
    inline static const VaeaPrimeList* FromFFI(const diplomat::capi::VaeaPrimeList* ptr);
    inline static VaeaPrimeList* FromFFI(diplomat::capi::VaeaPrimeList* ptr);
    inline static void operator delete(void* ptr);
private:
    VaeaPrimeList() = delete;
    VaeaPrimeList(const VaeaPrimeList&) = delete;
    VaeaPrimeList(VaeaPrimeList&&) noexcept = delete;
    VaeaPrimeList operator=(const VaeaPrimeList&) = delete;
    VaeaPrimeList operator=(VaeaPrimeList&&) noexcept = delete;
    static void operator delete[](void*, size_t) = delete;
};


#endif // VaeaPrimeList_D_HPP