head 1.7; access; symbols netbsd-11-0-RELEASE:1.2.2.1 netbsd-11-0-RC7:1.2.2.1 netbsd-11-0-RC6:1.2.2.1 netbsd-11-0-RC5:1.2.2.1 netbsd-11-0-RC4:1.2.2.1 v103-20260402:1.1.1.3 netbsd-11-0-RC3:1.2 netbsd-11-0-RC2:1.2 netbsd-11-0-RC1:1.2 v102-20251010:1.1.1.2 v102-20251006:1.1.1.2 perseant-exfatfs:1.2.0.4 perseant-exfatfs-base-20250801:1.2 netbsd-11:1.2.0.2 netbsd-11-base:1.2 v100-20250409:1.1.1.2 v99-20240919:1.1.1.1 OPENSSH:1.1.1; locks; strict; comment @ * @; 1.7 date 2026.10.07.17.32.07; author christos; state dead; branches; next 1.6; commitid bfGeT3ACqbH0ozYG; 1.6 date 2026.09.21.23.01.54; author christos; state Exp; branches; next 1.5; commitid cRwXlQlxvoR7JxWG; 1.5 date 2026.09.21.21.32.20; author christos; state Exp; branches; next 1.4; commitid eEPTXbwxyzRoexWG; 1.4 date 2026.09.21.21.30.59; author christos; state dead; branches; next 1.3; commitid d6hfTIGni5ORdxWG; 1.3 date 2026.04.08.18.58.40; author christos; state Exp; branches; next 1.2; commitid JcrdmlmM2ospIbBG; 1.2 date 2024.10.29.03.20.32; author rin; state Exp; branches 1.2.2.1 1.2.4.1; next 1.1; commitid TRyaAV1tkTibqvvF; 1.1 date 2024.09.24.21.28.09; author christos; state Exp; branches 1.1.1.1; next ; commitid zXrtOPLOGCBbz6rF; 1.2.2.1 date 2026.05.07.17.49.24; author martin; state Exp; branches; next ; commitid FKLgTPSjEn4GoUEG; 1.2.4.1 date 2024.10.29.03.20.32; author perseant; state dead; branches; next 1.2.4.2; commitid 23j6GFaDws3O875G; 1.2.4.2 date 2025.08.02.05.18.46; author perseant; state Exp; branches; next ; commitid 23j6GFaDws3O875G; 1.1.1.1 date 2024.09.24.21.28.09; author christos; state Exp; branches; next 1.1.1.2; commitid zXrtOPLOGCBbz6rF; 1.1.1.2 date 2025.04.09.15.41.14; author christos; state Exp; branches; next 1.1.1.3; commitid IvbeLEblpqXpjoQF; 1.1.1.3 date 2026.04.08.18.54.49; author christos; state Exp; branches; next ; commitid nKXy8zwlgGoAGbBG; desc @@ 1.7 log @Merge changes between OpenSSH-10.5 and OpenSSH-10.6 @ text @/* $NetBSD: libcrux_mlkem768_sha3.h,v 1.6 2026/09/21 23:01:54 christos Exp $ */ /* $OpenBSD: libcrux_mlkem768_sha3.h,v 1.4 2025/11/13 05:13:06 djm Exp $ */ /* Extracted from libcrux revision 026a87ab6d88ad3626b9fbbf3710d1e0483c1849 */ /* * MIT License * * Copyright (c) 2024 Cryspen * * Permission is hereby granted, free of charge, to any person obtaining a copy * of this software and associated documentation files (the "Software"), to deal * in the Software without restriction, including without limitation the rights * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell * copies of the Software, and to permit persons to whom the Software is * furnished to do so, subject to the following conditions: * * The above copyright notice and this permission notice shall be included in all * copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE * SOFTWARE. */ #if !defined(__GNUC__) || (__GNUC__ < 2) # define __attribute__(x) #endif #define KRML_MUSTINLINE inline #define KRML_NOINLINE __attribute__((noinline, unused)) #define KRML_HOST_EPRINTF(...) #define KRML_HOST_EXIT(x) fatal_f("internal error") static inline void store64_le(uint8_t dst[8], uint64_t src) { dst[0] = src & 0xff; dst[1] = (src >> 8) & 0xff; dst[2] = (src >> 16) & 0xff; dst[3] = (src >> 24) & 0xff; dst[4] = (src >> 32) & 0xff; dst[5] = (src >> 40) & 0xff; dst[6] = (src >> 48) & 0xff; dst[7] = (src >> 56) & 0xff; } static inline void store32_le(uint8_t dst[4], uint32_t src) { dst[0] = src & 0xff; dst[1] = (src >> 8) & 0xff; dst[2] = (src >> 16) & 0xff; dst[3] = (src >> 24) & 0xff; } static inline void store32_be(uint8_t dst[4], uint32_t src) { dst[0] = (src >> 24) & 0xff; dst[1] = (src >> 16) & 0xff; dst[2] = (src >> 8) & 0xff; dst[3] = src & 0xff; } static inline uint64_t load64_le(uint8_t src[8]) { return (uint64_t)(src[0]) | ((uint64_t)(src[1]) << 8) | ((uint64_t)(src[2]) << 16) | ((uint64_t)(src[3]) << 24) | ((uint64_t)(src[4]) << 32) | ((uint64_t)(src[5]) << 40) | ((uint64_t)(src[6]) << 48) | ((uint64_t)(src[7]) << 56); } static inline uint32_t load32_le(uint8_t src[4]) { return (uint32_t)(src[0]) | ((uint32_t)(src[1]) << 8) | ((uint32_t)(src[2]) << 16) | ((uint32_t)(src[3]) << 24); } #ifdef MISSING_BUILTIN_POPCOUNT static inline unsigned int __builtin_popcount(unsigned int num) { const int v[16] = { 0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4 }; return v[num & 0xf] + v[(num >> 4) & 0xf]; } #endif /* from libcrux/libcrux-ml-kem/extracts/c_header_only/generated/eurydice_glue.h */ #pragma once #ifdef _MSC_VER // For __popcnt #endif // C++ HELPERS #if defined(__cplusplus) #ifndef KRML_HOST_EPRINTF #define KRML_HOST_EPRINTF(...) fprintf(stderr, __VA_ARGS__) #endif #ifndef __cpp_lib_type_identity template struct type_identity { using type = T; }; template using type_identity_t = typename type_identity::type; #else using std::type_identity_t; #endif #define KRML_UNION_CONSTRUCTOR(T) \ template \ constexpr T(int t, V U::*m, type_identity_t v) : tag(t) { \ val.*m = std::move(v); \ } \ T() = default; #endif // GENERAL-PURPOSE STUFF #define LowStar_Ignore_ignore(e, t, _ret_t) ((void)e) #define EURYDICE_ASSERT(test, msg) \ do { \ if (!(test)) { \ fprintf(stderr, "assertion \"%s\" failed: file \"%s\", line %d\n", msg, \ __FILE__, __LINE__); \ exit(255); \ } \ } while (0) // SLICES, ARRAYS, ETC. // We represent a slice as a pair of an (untyped) pointer, along with the length // of the slice, i.e. the number of elements in the slice (this is NOT the // number of bytes). This design choice has two important consequences. // - if you need to use `ptr`, you MUST cast it to a proper type *before* // performing pointer arithmetic on it (remember that C desugars pointer // arithmetic based on the type of the address) // - if you need to use `len` for a C style function (e.g. memcpy, memcmp), you // need to multiply it by sizeof t, where t is the type of the elements. // // Empty slices have `len == 0` and `ptr` always needs to be a valid pointer // that is not NULL (otherwise the construction in EURYDICE_SLICE computes `NULL // + start`). typedef struct { void *ptr; size_t len; } Eurydice_slice; #if defined(__cplusplus) #define KRML_CLITERAL(type) type #else #define KRML_CLITERAL(type) (type) #endif #if defined(__cplusplus) && defined(__cpp_designated_initializers) || \ !(defined(__cplusplus)) #define EURYDICE_CFIELD(X) X #else #define EURYDICE_CFIELD(X) #endif // Helper macro to create a slice out of a pointer x, a start index in x // (included), and an end index in x (excluded). The argument x must be suitably // cast to something that can decay (see remark above about how pointer // arithmetic works in C), meaning either pointer or array type. #define EURYDICE_SLICE(x, start, end) \ (KRML_CLITERAL(Eurydice_slice){(void *)(x + start), end - start}) // Slice length #define EURYDICE_SLICE_LEN(s, _) (s).len #define Eurydice_slice_len(s, _) (s).len // This macro is a pain because in case the dereferenced element type is an // array, you cannot simply write `t x` as it would yield `int[4] x` instead, // which is NOT correct C syntax, so we add a dedicated phase in Eurydice that // adds an extra argument to this macro at the last minute so that we have the // correct type of *pointers* to elements. #define Eurydice_slice_index(s, i, t, t_ptr_t) (((t_ptr_t)s.ptr)[i]) // The following functions get sub slices from a slice. #define Eurydice_slice_subslice(s, r, t, _0, _1) \ EURYDICE_SLICE((t *)s.ptr, r.start, r.end) // Variant for when the start and end indices are statically known (i.e., the // range argument `r` is a literal). #define Eurydice_slice_subslice2(s, start, end, t) \ EURYDICE_SLICE((t *)s.ptr, (start), (end)) // Previous version above does not work when t is an array type (as usual). Will // be deprecated soon. #define Eurydice_slice_subslice3(s, start, end, t_ptr) \ EURYDICE_SLICE((t_ptr)s.ptr, (start), (end)) #define Eurydice_slice_subslice_to(s, subslice_end_pos, t, _0, _1) \ EURYDICE_SLICE((t *)s.ptr, 0, subslice_end_pos) #define Eurydice_slice_subslice_from(s, subslice_start_pos, t, _0, _1) \ EURYDICE_SLICE((t *)s.ptr, subslice_start_pos, s.len) #define Eurydice_array_to_slice(end, x, t) \ EURYDICE_SLICE(x, 0, \ end) /* x is already at an array type, no need for cast */ #define Eurydice_array_to_subslice(_arraylen, x, r, t, _0, _1) \ EURYDICE_SLICE((t *)x, r.start, r.end) // Same as above, variant for when start and end are statically known #define Eurydice_array_to_subslice2(x, start, end, t) \ EURYDICE_SLICE((t *)x, (start), (end)) // Same as above, variant for when start and end are statically known #define Eurydice_array_to_subslice3(x, start, end, t_ptr) \ EURYDICE_SLICE((t_ptr)x, (start), (end)) #define Eurydice_array_repeat(dst, len, init, t) \ ERROR "should've been desugared" // The following functions convert an array into a slice. #define Eurydice_array_to_subslice_to(_size, x, r, t, _range_t, _0) \ EURYDICE_SLICE((t *)x, 0, r) #define Eurydice_array_to_subslice_from(size, x, r, t, _range_t, _0) \ EURYDICE_SLICE((t *)x, r, size) // Copy a slice with memcopy #define Eurydice_slice_copy(dst, src, t) \ memcpy(dst.ptr, src.ptr, dst.len * sizeof(t)) #define core_array___Array_T__N___as_slice(len_, ptr_, t, _ret_t) \ KRML_CLITERAL(Eurydice_slice) { ptr_, len_ } #define core_array__core__clone__Clone_for__Array_T__N___clone( \ len, src, dst, elem_type, _ret_t) \ (memcpy(dst, src, len * sizeof(elem_type))) #define TryFromSliceError uint8_t #define core_array_TryFromSliceError uint8_t #define Eurydice_array_eq(sz, a1, a2, t) (memcmp(a1, a2, sz * sizeof(t)) == 0) // core::cmp::PartialEq<&0 (@@Slice)> for @@Array #define Eurydice_array_eq_slice(sz, a1, s2, t, _) \ (memcmp(a1, (s2)->ptr, sz * sizeof(t)) == 0) #define core_array_equality___core__cmp__PartialEq__Array_U__N___for__Array_T__N____eq( \ sz, a1, a2, t, _, _ret_t) \ Eurydice_array_eq(sz, a1, a2, t, _) #define core_array_equality___core__cmp__PartialEq__0___Slice_U____for__Array_T__N___3__eq( \ sz, a1, a2, t, _, _ret_t) \ Eurydice_array_eq(sz, a1, ((a2)->ptr), t, _) #define Eurydice_slice_split_at(slice, mid, element_type, ret_t) \ KRML_CLITERAL(ret_t) { \ EURYDICE_CFIELD(.fst =) \ EURYDICE_SLICE((element_type *)(slice).ptr, 0, mid), \ EURYDICE_CFIELD(.snd =) \ EURYDICE_SLICE((element_type *)(slice).ptr, mid, (slice).len) \ } #define Eurydice_slice_split_at_mut(slice, mid, element_type, ret_t) \ KRML_CLITERAL(ret_t) { \ EURYDICE_CFIELD(.fst =) \ KRML_CLITERAL(Eurydice_slice){EURYDICE_CFIELD(.ptr =)(slice.ptr), \ EURYDICE_CFIELD(.len =) mid}, \ EURYDICE_CFIELD(.snd =) KRML_CLITERAL(Eurydice_slice) { \ EURYDICE_CFIELD(.ptr =) \ ((char *)slice.ptr + mid * sizeof(element_type)), \ EURYDICE_CFIELD(.len =)(slice.len - mid) \ } \ } // Conversion of slice to an array, rewritten (by Eurydice) to name the // destination array, since arrays are not values in C. // N.B.: see note in karamel/lib/Inlining.ml if you change this. #define Eurydice_slice_to_array2(dst, src, _0, t_arr, _1) \ Eurydice_slice_to_array3(&(dst)->tag, (char *)&(dst)->val.case_Ok, src, \ sizeof(t_arr)) static inline void Eurydice_slice_to_array3(uint8_t *dst_tag, char *dst_ok, Eurydice_slice src, size_t sz) { *dst_tag = 0; memcpy(dst_ok, src.ptr, sz); } // SUPPORT FOR DSTs (Dynamically-Sized Types) // A DST is a fat pointer that keeps tracks of the size of it flexible array // member. Slices are a specific case of DSTs, where [T; N] implements // Unsize<[T]>, meaning an array of statically known size can be converted to a // fat pointer, i.e. a slice. // // Unlike slices, DSTs have a built-in definition that gets monomorphized, of // the form: // // typedef struct { // T *ptr; // size_t len; // number of elements // } Eurydice_dst; // // Furthermore, T = T0<[U0]> where `struct T0`, where the `U` is the // last field. This means that there are two monomorphizations of T0 in the // program. One is `T0<[V; N]>` // -- this is directly converted to a Eurydice_dst via suitable codegen (no // macro). The other is `T = T0<[U]>`, where `[U]` gets emitted to // `Eurydice_derefed_slice`, a type that only appears in that precise situation // and is thus defined to give rise to a flexible array member. typedef char Eurydice_derefed_slice[]; #define Eurydice_slice_of_dst(fam_ptr, len_, t, _) \ ((Eurydice_slice){.ptr = (void *)(fam_ptr), .len = len_}) #define Eurydice_slice_of_boxed_array(ptr_, len_, t, _) \ ((Eurydice_slice){.ptr = (void *)(ptr_), .len = len_}) // CORE STUFF (conversions, endianness, ...) // We slap extern "C" on declarations that intend to implement a prototype // generated by Eurydice, because Eurydice prototypes are always emitted within // an extern "C" block, UNLESS you use -fcxx17-compat, in which case, you must // pass -DKRML_CXX17_COMPAT="" to your C++ compiler. #if defined(__cplusplus) && !defined(KRML_CXX17_COMPAT) extern "C" { #endif static inline void core_num__u32__to_be_bytes(uint32_t src, uint8_t dst[4]) { store32_be(dst, src); } static inline void core_num__u32__to_le_bytes(uint32_t src, uint8_t dst[4]) { store32_le(dst, src); } static inline uint32_t core_num__u32__from_le_bytes(uint8_t buf[4]) { return load32_le(buf); } static inline void core_num__u64__to_le_bytes(uint64_t v, uint8_t buf[8]) { store64_le(buf, v); } static inline uint64_t core_num__u64__from_le_bytes(uint8_t buf[8]) { return load64_le(buf); } static inline int64_t core_convert_num___core__convert__From_i32__for_i64__from( int32_t x) { return x; } static inline uint64_t core_convert_num___core__convert__From_u8__for_u64__from( uint8_t x) { return x; } static inline uint64_t core_convert_num___core__convert__From_u16__for_u64__from(uint16_t x) { return x; } static inline size_t core_convert_num___core__convert__From_u16__for_usize__from(uint16_t x) { return x; } static inline uint32_t core_num__u8__count_ones(uint8_t x0) { #ifdef _MSC_VER return __popcnt(x0); #else return __builtin_popcount(x0); #endif } static inline uint32_t core_num__i32__count_ones(int32_t x0) { #ifdef _MSC_VER return __popcnt(x0); #else return __builtin_popcount(x0); #endif } static inline size_t core_cmp_impls___core__cmp__Ord_for_usize__min(size_t a, size_t b) { if (a <= b) return a; else return b; } // unsigned overflow wraparound semantics in C static inline uint16_t core_num__u16__wrapping_add(uint16_t x, uint16_t y) { return x + y; } static inline uint8_t core_num__u8__wrapping_sub(uint8_t x, uint8_t y) { return x - y; } static inline uint64_t core_num__u64__rotate_left(uint64_t x0, uint32_t x1) { return (x0 << x1 | x0 >> (64 - x1)); } static inline void core_ops_arith__i32__add_assign(int32_t *x0, int32_t *x1) { *x0 = *x0 + *x1; } static inline uint8_t Eurydice_bitand_pv_u8(uint8_t *p, uint8_t v) { return (*p) & v; } static inline uint8_t Eurydice_shr_pv_u8(uint8_t *p, int32_t v) { return (*p) >> v; } static inline uint32_t Eurydice_min_u32(uint32_t x, uint32_t y) { return x < y ? x : y; } static inline uint8_t core_ops_bit___core__ops__bit__BitAnd_u8__u8__for___a__u8___46__bitand( uint8_t *x0, uint8_t x1) { return Eurydice_bitand_pv_u8(x0, x1); } static inline uint8_t core_ops_bit___core__ops__bit__Shr_i32__u8__for___a__u8___792__shr(uint8_t *x0, int32_t x1) { return Eurydice_shr_pv_u8(x0, x1); } #define core_num_nonzero_private_NonZeroUsizeInner size_t static inline core_num_nonzero_private_NonZeroUsizeInner core_num_nonzero_private___core__clone__Clone_for_core__num__nonzero__private__NonZeroUsizeInner__26__clone( core_num_nonzero_private_NonZeroUsizeInner *x0) { return *x0; } #if defined(__cplusplus) && !defined(KRML_CXX17_COMPAT) } #endif // ITERATORS #define Eurydice_range_iter_next(iter_ptr, t, ret_t) \ (((iter_ptr)->start >= (iter_ptr)->end) \ ? (KRML_CLITERAL(ret_t){EURYDICE_CFIELD(.tag =) 0, \ EURYDICE_CFIELD(.f0 =) 0}) \ : (KRML_CLITERAL(ret_t){EURYDICE_CFIELD(.tag =) 1, \ EURYDICE_CFIELD(.f0 =)(iter_ptr)->start++})) #define core_iter_range___core__iter__traits__iterator__Iterator_A__for_core__ops__range__Range_A__TraitClause_0___6__next \ Eurydice_range_iter_next // See note in karamel/lib/Inlining.ml if you change this #define Eurydice_into_iter(x, t, _ret_t, _) (x) #define core_iter_traits_collect___core__iter__traits__collect__IntoIterator_Clause1_Item__I__for_I__1__into_iter \ Eurydice_into_iter typedef struct { Eurydice_slice slice; size_t chunk_size; } Eurydice_chunks; // Can't use macros Eurydice_slice_subslice_{to,from} because they require a // type, and this static inline function cannot receive a type as an argument. // Instead, we receive the element size and use it to peform manual offset // computations rather than going through the macros. static inline Eurydice_slice chunk_next(Eurydice_chunks *chunks, size_t element_size) { size_t chunk_size = chunks->slice.len >= chunks->chunk_size ? chunks->chunk_size : chunks->slice.len; Eurydice_slice curr_chunk; curr_chunk.ptr = chunks->slice.ptr; curr_chunk.len = chunk_size; chunks->slice.ptr = (char *)(chunks->slice.ptr) + chunk_size * element_size; chunks->slice.len = chunks->slice.len - chunk_size; return curr_chunk; } #define core_slice___Slice_T___chunks(slice_, sz_, t, _ret_t) \ ((Eurydice_chunks){.slice = slice_, .chunk_size = sz_}) #define core_slice___Slice_T___chunks_exact(slice_, sz_, t, _ret_t) \ ((Eurydice_chunks){ \ .slice = {.ptr = slice_.ptr, .len = slice_.len - (slice_.len % sz_)}, \ .chunk_size = sz_}) #define core_slice_iter_Chunks Eurydice_chunks #define core_slice_iter_ChunksExact Eurydice_chunks #define Eurydice_chunks_next(iter, t, ret_t) \ (((iter)->slice.len == 0) ? ((ret_t){.tag = core_option_None}) \ : ((ret_t){.tag = core_option_Some, \ .f0 = chunk_next(iter, sizeof(t))})) #define core_slice_iter___core__iter__traits__iterator__Iterator_for_core__slice__iter__Chunks__a__T___70__next \ Eurydice_chunks_next // This name changed on 20240627 #define core_slice_iter___core__iter__traits__iterator__Iterator_for_core__slice__iter__Chunks__a__T___71__next \ Eurydice_chunks_next #define core_slice_iter__core__slice__iter__ChunksExact__a__T__89__next( \ iter, t, _ret_t) \ core_slice_iter__core__slice__iter__Chunks__a__T__70__next(iter, t) typedef struct { Eurydice_slice s; size_t index; } Eurydice_slice_iterator; #define core_slice___Slice_T___iter(x, t, _ret_t) \ ((Eurydice_slice_iterator){.s = x, .index = 0}) #define core_slice_iter_Iter Eurydice_slice_iterator #define core_slice_iter__core__slice__iter__Iter__a__T__181__next(iter, t, \ ret_t) \ (((iter)->index == (iter)->s.len) \ ? (KRML_CLITERAL(ret_t){.tag = core_option_None}) \ : (KRML_CLITERAL(ret_t){ \ .tag = core_option_Some, \ .f0 = ((iter)->index++, \ &((t *)((iter)->s.ptr))[(iter)->index - 1])})) #define core_option__core__option__Option_T__TraitClause_0___is_some(X, _0, \ _1) \ ((X)->tag == 1) // STRINGS typedef const char *Prims_string; // MISC (UNTESTED) typedef void *core_fmt_Formatter; typedef void *core_fmt_Arguments; typedef void *core_fmt_rt_Argument; #define core_fmt_rt__core__fmt__rt__Argument__a__1__new_display(x1, x2, x3, \ x4) \ NULL // BOXES // Crimes. static inline char *malloc_and_init(size_t sz, char *init) { char *ptr = (char *)malloc(sz); memcpy(ptr, init, sz); return ptr; } #define Eurydice_box_new(init, t, t_dst) \ ((t_dst)(malloc_and_init(sizeof(t), (char *)(&init)))) #define Eurydice_box_new_array(len, ptr, t, t_dst) \ ((t_dst)(malloc_and_init(len * sizeof(t), (char *)(ptr)))) /* from libcrux/libcrux-ml-kem/extracts/c_header_only/generated/libcrux_mlkem_core.h */ /* * SPDX-FileCopyrightText: 2025 Cryspen Sarl * * SPDX-License-Identifier: MIT or Apache-2.0 * * This code was generated with the following revisions: * Charon: 667d2fc98984ff7f3df989c2367e6c1fa4a000e7 * Eurydice: 2381cbc416ef2ad0b561c362c500bc84f36b6785 * Karamel: 80f5435f2fc505973c469a4afcc8d875cddd0d8b * F*: 71d8221589d4d438af3706d89cb653cf53e18aab * Libcrux: 68dfed5a4a9e40277f62828471c029afed1ecdcc */ #ifndef libcrux_mlkem_core_H #define libcrux_mlkem_core_H #if defined(__cplusplus) extern "C" { #endif /** A monomorphic instance of core.ops.range.Range with types size_t */ typedef struct core_ops_range_Range_08_s { size_t start; size_t end; } core_ops_range_Range_08; static inline uint16_t core_num__u16__wrapping_add(uint16_t x0, uint16_t x1); static inline uint64_t core_num__u64__from_le_bytes(uint8_t x0[8U]); static inline uint64_t core_num__u64__rotate_left(uint64_t x0, uint32_t x1); static inline void core_num__u64__to_le_bytes(uint64_t x0, uint8_t x1[8U]); static inline uint32_t core_num__u8__count_ones(uint8_t x0); static inline uint8_t core_num__u8__wrapping_sub(uint8_t x0, uint8_t x1); #define LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE ((size_t)32U) #define LIBCRUX_ML_KEM_CONSTANTS_BITS_PER_COEFFICIENT ((size_t)12U) #define LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT ((size_t)256U) #define LIBCRUX_ML_KEM_CONSTANTS_BITS_PER_RING_ELEMENT \ (LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT * (size_t)12U) #define LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT \ (LIBCRUX_ML_KEM_CONSTANTS_BITS_PER_RING_ELEMENT / (size_t)8U) #define LIBCRUX_ML_KEM_CONSTANTS_CPA_PKE_KEY_GENERATION_SEED_SIZE ((size_t)32U) #define LIBCRUX_ML_KEM_CONSTANTS_G_DIGEST_SIZE ((size_t)64U) #define LIBCRUX_ML_KEM_CONSTANTS_H_DIGEST_SIZE ((size_t)32U) /** K * BITS_PER_RING_ELEMENT / 8 [eurydice] Note that we can't use const generics here because that breaks C extraction with eurydice. */ static inline size_t libcrux_ml_kem_constants_ranked_bytes_per_ring_element( size_t rank) { return rank * LIBCRUX_ML_KEM_CONSTANTS_BITS_PER_RING_ELEMENT / (size_t)8U; } /** This function found in impl {libcrux_secrets::traits::Classify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.classify_27 with types uint8_t */ static KRML_MUSTINLINE uint8_t libcrux_secrets_int_public_integers_classify_27_90(uint8_t self) { return self; } /** This function found in impl {libcrux_secrets::traits::Declassify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.declassify_d8 with types int16_t */ static KRML_MUSTINLINE int16_t libcrux_secrets_int_public_integers_declassify_d8_39(int16_t self) { return self; } /** This function found in impl {libcrux_secrets::int::CastOps for i16} */ static KRML_MUSTINLINE uint8_t libcrux_secrets_int_as_u8_f5(int16_t self) { return libcrux_secrets_int_public_integers_classify_27_90( (uint8_t)libcrux_secrets_int_public_integers_declassify_d8_39(self)); } /** This function found in impl {libcrux_secrets::traits::Classify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.classify_27 with types int16_t */ static KRML_MUSTINLINE int16_t libcrux_secrets_int_public_integers_classify_27_39(int16_t self) { return self; } /** This function found in impl {libcrux_secrets::traits::Declassify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.declassify_d8 with types uint8_t */ static KRML_MUSTINLINE uint8_t libcrux_secrets_int_public_integers_declassify_d8_90(uint8_t self) { return self; } /** This function found in impl {libcrux_secrets::int::CastOps for u8} */ static KRML_MUSTINLINE int16_t libcrux_secrets_int_as_i16_59(uint8_t self) { return libcrux_secrets_int_public_integers_classify_27_39( (int16_t)libcrux_secrets_int_public_integers_declassify_d8_90(self)); } /** This function found in impl {libcrux_secrets::traits::Classify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.classify_27 with types int32_t */ static KRML_MUSTINLINE int32_t libcrux_secrets_int_public_integers_classify_27_a8(int32_t self) { return self; } /** This function found in impl {libcrux_secrets::int::CastOps for i16} */ static KRML_MUSTINLINE int32_t libcrux_secrets_int_as_i32_f5(int16_t self) { return libcrux_secrets_int_public_integers_classify_27_a8( (int32_t)libcrux_secrets_int_public_integers_declassify_d8_39(self)); } /** This function found in impl {libcrux_secrets::traits::Declassify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.declassify_d8 with types int32_t */ static KRML_MUSTINLINE int32_t libcrux_secrets_int_public_integers_declassify_d8_a8(int32_t self) { return self; } /** This function found in impl {libcrux_secrets::int::CastOps for i32} */ static KRML_MUSTINLINE int16_t libcrux_secrets_int_as_i16_36(int32_t self) { return libcrux_secrets_int_public_integers_classify_27_39( (int16_t)libcrux_secrets_int_public_integers_declassify_d8_a8(self)); } /** This function found in impl {libcrux_secrets::traits::Declassify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.declassify_d8 with types uint32_t */ static KRML_MUSTINLINE uint32_t libcrux_secrets_int_public_integers_declassify_d8_df(uint32_t self) { return self; } /** This function found in impl {libcrux_secrets::int::CastOps for u32} */ static KRML_MUSTINLINE int32_t libcrux_secrets_int_as_i32_b8(uint32_t self) { return libcrux_secrets_int_public_integers_classify_27_a8( (int32_t)libcrux_secrets_int_public_integers_declassify_d8_df(self)); } /** This function found in impl {libcrux_secrets::traits::Classify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.classify_27 with types uint16_t */ static KRML_MUSTINLINE uint16_t libcrux_secrets_int_public_integers_classify_27_de(uint16_t self) { return self; } /** This function found in impl {libcrux_secrets::int::CastOps for i16} */ static KRML_MUSTINLINE uint16_t libcrux_secrets_int_as_u16_f5(int16_t self) { return libcrux_secrets_int_public_integers_classify_27_de( (uint16_t)libcrux_secrets_int_public_integers_declassify_d8_39(self)); } /** This function found in impl {libcrux_secrets::traits::Declassify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.declassify_d8 with types uint16_t */ static KRML_MUSTINLINE uint16_t libcrux_secrets_int_public_integers_declassify_d8_de(uint16_t self) { return self; } /** This function found in impl {libcrux_secrets::int::CastOps for u16} */ static KRML_MUSTINLINE int16_t libcrux_secrets_int_as_i16_ca(uint16_t self) { return libcrux_secrets_int_public_integers_classify_27_39( (int16_t)libcrux_secrets_int_public_integers_declassify_d8_de(self)); } /** This function found in impl {libcrux_secrets::traits::Classify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.classify_27 with types uint64_t */ static KRML_MUSTINLINE uint64_t libcrux_secrets_int_public_integers_classify_27_49(uint64_t self) { return self; } /** This function found in impl {libcrux_secrets::int::CastOps for u16} */ static KRML_MUSTINLINE uint64_t libcrux_secrets_int_as_u64_ca(uint16_t self) { return libcrux_secrets_int_public_integers_classify_27_49( (uint64_t)libcrux_secrets_int_public_integers_declassify_d8_de(self)); } /** This function found in impl {libcrux_secrets::traits::Classify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.classify_27 with types uint32_t */ static KRML_MUSTINLINE uint32_t libcrux_secrets_int_public_integers_classify_27_df(uint32_t self) { return self; } /** This function found in impl {libcrux_secrets::traits::Declassify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.declassify_d8 with types uint64_t */ static KRML_MUSTINLINE uint64_t libcrux_secrets_int_public_integers_declassify_d8_49(uint64_t self) { return self; } /** This function found in impl {libcrux_secrets::int::CastOps for u64} */ static KRML_MUSTINLINE uint32_t libcrux_secrets_int_as_u32_a3(uint64_t self) { return libcrux_secrets_int_public_integers_classify_27_df( (uint32_t)libcrux_secrets_int_public_integers_declassify_d8_49(self)); } /** This function found in impl {libcrux_secrets::int::CastOps for u32} */ static KRML_MUSTINLINE int16_t libcrux_secrets_int_as_i16_b8(uint32_t self) { return libcrux_secrets_int_public_integers_classify_27_39( (int16_t)libcrux_secrets_int_public_integers_declassify_d8_df(self)); } /** This function found in impl {libcrux_secrets::int::CastOps for i16} */ static KRML_MUSTINLINE int16_t libcrux_secrets_int_as_i16_f5(int16_t self) { return libcrux_secrets_int_public_integers_classify_27_39( libcrux_secrets_int_public_integers_declassify_d8_39(self)); } typedef struct libcrux_ml_kem_utils_extraction_helper_Keypair768_s { uint8_t fst[1152U]; uint8_t snd[1184U]; } libcrux_ml_kem_utils_extraction_helper_Keypair768; #define Ok 0 #define Err 1 typedef uint8_t Result_b2_tags; /** A monomorphic instance of core.result.Result with types uint8_t[24size_t], core_array_TryFromSliceError */ typedef struct Result_b2_s { Result_b2_tags tag; union { uint8_t case_Ok[24U]; TryFromSliceError case_Err; } val; } Result_b2; /** This function found in impl {core::result::Result[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of core.result.unwrap_26 with types uint8_t[24size_t], core_array_TryFromSliceError */ static inline void unwrap_26_70(Result_b2 self, uint8_t ret[24U]) { if (self.tag == Ok) { uint8_t f0[24U]; memcpy(f0, self.val.case_Ok, (size_t)24U * sizeof(uint8_t)); memcpy(ret, f0, (size_t)24U * sizeof(uint8_t)); } else { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "unwrap not Ok"); KRML_HOST_EXIT(255U); } } /** A monomorphic instance of core.result.Result with types uint8_t[20size_t], core_array_TryFromSliceError */ typedef struct Result_e1_s { Result_b2_tags tag; union { uint8_t case_Ok[20U]; TryFromSliceError case_Err; } val; } Result_e1; /** This function found in impl {core::result::Result[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of core.result.unwrap_26 with types uint8_t[20size_t], core_array_TryFromSliceError */ static inline void unwrap_26_20(Result_e1 self, uint8_t ret[20U]) { if (self.tag == Ok) { uint8_t f0[20U]; memcpy(f0, self.val.case_Ok, (size_t)20U * sizeof(uint8_t)); memcpy(ret, f0, (size_t)20U * sizeof(uint8_t)); } else { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "unwrap not Ok"); KRML_HOST_EXIT(255U); } } /** Pad the `slice` with `0`s at the end. */ /** A monomorphic instance of libcrux_ml_kem.utils.into_padded_array with const generics - LEN= 32 */ static KRML_MUSTINLINE void libcrux_ml_kem_utils_into_padded_array_9e( Eurydice_slice slice, uint8_t ret[32U]) { uint8_t out[32U] = {0U}; uint8_t *uu____0 = out; Eurydice_slice_copy( Eurydice_array_to_subslice3( uu____0, (size_t)0U, Eurydice_slice_len(slice, uint8_t), uint8_t *), slice, uint8_t); memcpy(ret, out, (size_t)32U * sizeof(uint8_t)); } /** A monomorphic instance of libcrux_ml_kem.types.MlKemPrivateKey with const generics - $2400size_t */ typedef struct libcrux_ml_kem_types_MlKemPrivateKey_d9_s { uint8_t value[2400U]; } libcrux_ml_kem_types_MlKemPrivateKey_d9; /** This function found in impl {core::default::Default for libcrux_ml_kem::types::MlKemPrivateKey} */ /** A monomorphic instance of libcrux_ml_kem.types.default_d3 with const generics - SIZE= 2400 */ static inline libcrux_ml_kem_types_MlKemPrivateKey_d9 libcrux_ml_kem_types_default_d3_28(void) { return ( KRML_CLITERAL(libcrux_ml_kem_types_MlKemPrivateKey_d9){.value = {0U}}); } /** A monomorphic instance of libcrux_ml_kem.types.MlKemPublicKey with const generics - $1184size_t */ typedef struct libcrux_ml_kem_types_MlKemPublicKey_30_s { uint8_t value[1184U]; } libcrux_ml_kem_types_MlKemPublicKey_30; /** This function found in impl {core::convert::From<@@Array> for libcrux_ml_kem::types::MlKemPublicKey} */ /** A monomorphic instance of libcrux_ml_kem.types.from_fd with const generics - SIZE= 1184 */ static inline libcrux_ml_kem_types_MlKemPublicKey_30 libcrux_ml_kem_types_from_fd_d0(uint8_t value[1184U]) { /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_value[1184U]; memcpy(copy_of_value, value, (size_t)1184U * sizeof(uint8_t)); libcrux_ml_kem_types_MlKemPublicKey_30 lit; memcpy(lit.value, copy_of_value, (size_t)1184U * sizeof(uint8_t)); return lit; } typedef struct libcrux_ml_kem_mlkem768_MlKem768KeyPair_s { libcrux_ml_kem_types_MlKemPrivateKey_d9 sk; libcrux_ml_kem_types_MlKemPublicKey_30 pk; } libcrux_ml_kem_mlkem768_MlKem768KeyPair; /** This function found in impl {libcrux_ml_kem::types::MlKemKeyPair} */ /** A monomorphic instance of libcrux_ml_kem.types.from_17 with const generics - PRIVATE_KEY_SIZE= 2400 - PUBLIC_KEY_SIZE= 1184 */ static inline libcrux_ml_kem_mlkem768_MlKem768KeyPair libcrux_ml_kem_types_from_17_74(libcrux_ml_kem_types_MlKemPrivateKey_d9 sk, libcrux_ml_kem_types_MlKemPublicKey_30 pk) { return (KRML_CLITERAL(libcrux_ml_kem_mlkem768_MlKem768KeyPair){.sk = sk, .pk = pk}); } /** This function found in impl {core::convert::From<@@Array> for libcrux_ml_kem::types::MlKemPrivateKey} */ /** A monomorphic instance of libcrux_ml_kem.types.from_77 with const generics - SIZE= 2400 */ static inline libcrux_ml_kem_types_MlKemPrivateKey_d9 libcrux_ml_kem_types_from_77_28(uint8_t value[2400U]) { /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_value[2400U]; memcpy(copy_of_value, value, (size_t)2400U * sizeof(uint8_t)); libcrux_ml_kem_types_MlKemPrivateKey_d9 lit; memcpy(lit.value, copy_of_value, (size_t)2400U * sizeof(uint8_t)); return lit; } /** A monomorphic instance of core.result.Result with types uint8_t[32size_t], core_array_TryFromSliceError */ typedef struct Result_fb_s { Result_b2_tags tag; union { uint8_t case_Ok[32U]; TryFromSliceError case_Err; } val; } Result_fb; /** This function found in impl {core::result::Result[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of core.result.unwrap_26 with types uint8_t[32size_t], core_array_TryFromSliceError */ static inline void unwrap_26_b3(Result_fb self, uint8_t ret[32U]) { if (self.tag == Ok) { uint8_t f0[32U]; memcpy(f0, self.val.case_Ok, (size_t)32U * sizeof(uint8_t)); memcpy(ret, f0, (size_t)32U * sizeof(uint8_t)); } else { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "unwrap not Ok"); KRML_HOST_EXIT(255U); } } typedef struct libcrux_ml_kem_mlkem768_MlKem768Ciphertext_s { uint8_t value[1088U]; } libcrux_ml_kem_mlkem768_MlKem768Ciphertext; /** A monomorphic instance of K. with types libcrux_ml_kem_types_MlKemCiphertext[[$1088size_t]], uint8_t[32size_t] */ typedef struct tuple_c2_s { libcrux_ml_kem_mlkem768_MlKem768Ciphertext fst; uint8_t snd[32U]; } tuple_c2; /** This function found in impl {core::convert::From<@@Array> for libcrux_ml_kem::types::MlKemCiphertext} */ /** A monomorphic instance of libcrux_ml_kem.types.from_e0 with const generics - SIZE= 1088 */ static inline libcrux_ml_kem_mlkem768_MlKem768Ciphertext libcrux_ml_kem_types_from_e0_80(uint8_t value[1088U]) { /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_value[1088U]; memcpy(copy_of_value, value, (size_t)1088U * sizeof(uint8_t)); libcrux_ml_kem_mlkem768_MlKem768Ciphertext lit; memcpy(lit.value, copy_of_value, (size_t)1088U * sizeof(uint8_t)); return lit; } /** This function found in impl {libcrux_ml_kem::types::MlKemPublicKey} */ /** A monomorphic instance of libcrux_ml_kem.types.as_slice_e6 with const generics - SIZE= 1184 */ static inline uint8_t *libcrux_ml_kem_types_as_slice_e6_d0( libcrux_ml_kem_types_MlKemPublicKey_30 *self) { return self->value; } /** This function found in impl {libcrux_ml_kem::types::MlKemCiphertext} */ /** A monomorphic instance of libcrux_ml_kem.types.as_slice_a9 with const generics - SIZE= 1088 */ static inline uint8_t *libcrux_ml_kem_types_as_slice_a9_80( libcrux_ml_kem_mlkem768_MlKem768Ciphertext *self) { return self->value; } /** A monomorphic instance of libcrux_ml_kem.utils.prf_input_inc with const generics - K= 3 */ static KRML_MUSTINLINE uint8_t libcrux_ml_kem_utils_prf_input_inc_e0( uint8_t (*prf_inputs)[33U], uint8_t domain_separator) { for (size_t i = (size_t)0U; i < (size_t)3U; i++) { size_t i0 = i; prf_inputs[i0][32U] = domain_separator; domain_separator = (uint32_t)domain_separator + 1U; } return domain_separator; } /** Pad the `slice` with `0`s at the end. */ /** A monomorphic instance of libcrux_ml_kem.utils.into_padded_array with const generics - LEN= 33 */ static KRML_MUSTINLINE void libcrux_ml_kem_utils_into_padded_array_c8( Eurydice_slice slice, uint8_t ret[33U]) { uint8_t out[33U] = {0U}; uint8_t *uu____0 = out; Eurydice_slice_copy( Eurydice_array_to_subslice3( uu____0, (size_t)0U, Eurydice_slice_len(slice, uint8_t), uint8_t *), slice, uint8_t); memcpy(ret, out, (size_t)33U * sizeof(uint8_t)); } /** Pad the `slice` with `0`s at the end. */ /** A monomorphic instance of libcrux_ml_kem.utils.into_padded_array with const generics - LEN= 34 */ static KRML_MUSTINLINE void libcrux_ml_kem_utils_into_padded_array_b6( Eurydice_slice slice, uint8_t ret[34U]) { uint8_t out[34U] = {0U}; uint8_t *uu____0 = out; Eurydice_slice_copy( Eurydice_array_to_subslice3( uu____0, (size_t)0U, Eurydice_slice_len(slice, uint8_t), uint8_t *), slice, uint8_t); memcpy(ret, out, (size_t)34U * sizeof(uint8_t)); } /** This function found in impl {core::convert::AsRef<@@Slice> for libcrux_ml_kem::types::MlKemCiphertext} */ /** A monomorphic instance of libcrux_ml_kem.types.as_ref_d3 with const generics - SIZE= 1088 */ static inline Eurydice_slice libcrux_ml_kem_types_as_ref_d3_80( libcrux_ml_kem_mlkem768_MlKem768Ciphertext *self) { return Eurydice_array_to_slice((size_t)1088U, self->value, uint8_t); } /** Pad the `slice` with `0`s at the end. */ /** A monomorphic instance of libcrux_ml_kem.utils.into_padded_array with const generics - LEN= 1120 */ static KRML_MUSTINLINE void libcrux_ml_kem_utils_into_padded_array_15( Eurydice_slice slice, uint8_t ret[1120U]) { uint8_t out[1120U] = {0U}; uint8_t *uu____0 = out; Eurydice_slice_copy( Eurydice_array_to_subslice3( uu____0, (size_t)0U, Eurydice_slice_len(slice, uint8_t), uint8_t *), slice, uint8_t); memcpy(ret, out, (size_t)1120U * sizeof(uint8_t)); } /** Pad the `slice` with `0`s at the end. */ /** A monomorphic instance of libcrux_ml_kem.utils.into_padded_array with const generics - LEN= 64 */ static KRML_MUSTINLINE void libcrux_ml_kem_utils_into_padded_array_24( Eurydice_slice slice, uint8_t ret[64U]) { uint8_t out[64U] = {0U}; uint8_t *uu____0 = out; Eurydice_slice_copy( Eurydice_array_to_subslice3( uu____0, (size_t)0U, Eurydice_slice_len(slice, uint8_t), uint8_t *), slice, uint8_t); memcpy(ret, out, (size_t)64U * sizeof(uint8_t)); } typedef struct Eurydice_slice_uint8_t_x4_s { Eurydice_slice fst; Eurydice_slice snd; Eurydice_slice thd; Eurydice_slice f3; } Eurydice_slice_uint8_t_x4; typedef struct Eurydice_slice_uint8_t_x2_s { Eurydice_slice fst; Eurydice_slice snd; } Eurydice_slice_uint8_t_x2; /** Unpack an incoming private key into it's different parts. We have this here in types to extract into a common core for C. */ /** A monomorphic instance of libcrux_ml_kem.types.unpack_private_key with const generics - CPA_SECRET_KEY_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 */ static inline Eurydice_slice_uint8_t_x4 libcrux_ml_kem_types_unpack_private_key_b4(Eurydice_slice private_key) { Eurydice_slice_uint8_t_x2 uu____0 = Eurydice_slice_split_at( private_key, (size_t)1152U, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice ind_cpa_secret_key = uu____0.fst; Eurydice_slice secret_key0 = uu____0.snd; Eurydice_slice_uint8_t_x2 uu____1 = Eurydice_slice_split_at( secret_key0, (size_t)1184U, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice ind_cpa_public_key = uu____1.fst; Eurydice_slice secret_key = uu____1.snd; Eurydice_slice_uint8_t_x2 uu____2 = Eurydice_slice_split_at( secret_key, LIBCRUX_ML_KEM_CONSTANTS_H_DIGEST_SIZE, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice ind_cpa_public_key_hash = uu____2.fst; Eurydice_slice implicit_rejection_value = uu____2.snd; return ( KRML_CLITERAL(Eurydice_slice_uint8_t_x4){.fst = ind_cpa_secret_key, .snd = ind_cpa_public_key, .thd = ind_cpa_public_key_hash, .f3 = implicit_rejection_value}); } /** This function found in impl {libcrux_secrets::traits::Declassify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.declassify_d8 with types uint8_t[24size_t] */ static KRML_MUSTINLINE void libcrux_secrets_int_public_integers_declassify_d8_d2(uint8_t self[24U], uint8_t ret[24U]) { memcpy(ret, self, (size_t)24U * sizeof(uint8_t)); } /** This function found in impl {libcrux_secrets::traits::Declassify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.declassify_d8 with types uint8_t[20size_t] */ static KRML_MUSTINLINE void libcrux_secrets_int_public_integers_declassify_d8_57(uint8_t self[20U], uint8_t ret[20U]) { memcpy(ret, self, (size_t)20U * sizeof(uint8_t)); } /** This function found in impl {libcrux_secrets::traits::Declassify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.declassify_d8 with types uint8_t[8size_t] */ static KRML_MUSTINLINE void libcrux_secrets_int_public_integers_declassify_d8_76(uint8_t self[8U], uint8_t ret[8U]) { memcpy(ret, self, (size_t)8U * sizeof(uint8_t)); } /** This function found in impl {libcrux_secrets::traits::Declassify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.declassify_d8 with types uint8_t[2size_t] */ static KRML_MUSTINLINE void libcrux_secrets_int_public_integers_declassify_d8_d4(uint8_t self[2U], uint8_t ret[2U]) { memcpy(ret, self, (size_t)2U * sizeof(uint8_t)); } /** This function found in impl {libcrux_secrets::traits::Classify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.classify_27 with types int16_t[16size_t] */ static KRML_MUSTINLINE void libcrux_secrets_int_public_integers_classify_27_46( int16_t self[16U], int16_t ret[16U]) { memcpy(ret, self, (size_t)16U * sizeof(int16_t)); } /** This function found in impl {libcrux_secrets::traits::ClassifyRef<&'a (@@Slice)> for &'a (@@Slice)} */ /** A monomorphic instance of libcrux_secrets.int.classify_public.classify_ref_9b with types uint8_t */ static KRML_MUSTINLINE Eurydice_slice libcrux_secrets_int_classify_public_classify_ref_9b_90(Eurydice_slice self) { return self; } /** This function found in impl {libcrux_secrets::traits::ClassifyRef<&'a (@@Slice)> for &'a (@@Slice)} */ /** A monomorphic instance of libcrux_secrets.int.classify_public.classify_ref_9b with types int16_t */ static KRML_MUSTINLINE Eurydice_slice libcrux_secrets_int_classify_public_classify_ref_9b_39(Eurydice_slice self) { return self; } /** A monomorphic instance of core.result.Result with types int16_t[16size_t], core_array_TryFromSliceError */ typedef struct Result_0a_s { Result_b2_tags tag; union { int16_t case_Ok[16U]; TryFromSliceError case_Err; } val; } Result_0a; /** This function found in impl {core::result::Result[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of core.result.unwrap_26 with types int16_t[16size_t], core_array_TryFromSliceError */ static inline void unwrap_26_00(Result_0a self, int16_t ret[16U]) { if (self.tag == Ok) { int16_t f0[16U]; memcpy(f0, self.val.case_Ok, (size_t)16U * sizeof(int16_t)); memcpy(ret, f0, (size_t)16U * sizeof(int16_t)); } else { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "unwrap not Ok"); KRML_HOST_EXIT(255U); } } /** A monomorphic instance of core.result.Result with types uint8_t[8size_t], core_array_TryFromSliceError */ typedef struct Result_15_s { Result_b2_tags tag; union { uint8_t case_Ok[8U]; TryFromSliceError case_Err; } val; } Result_15; /** This function found in impl {core::result::Result[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of core.result.unwrap_26 with types uint8_t[8size_t], core_array_TryFromSliceError */ static inline void unwrap_26_68(Result_15 self, uint8_t ret[8U]) { if (self.tag == Ok) { uint8_t f0[8U]; memcpy(f0, self.val.case_Ok, (size_t)8U * sizeof(uint8_t)); memcpy(ret, f0, (size_t)8U * sizeof(uint8_t)); } else { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "unwrap not Ok"); KRML_HOST_EXIT(255U); } } #if defined(__cplusplus) } #endif #define libcrux_mlkem_core_H_DEFINED #endif /* libcrux_mlkem_core_H */ /* from libcrux/libcrux-ml-kem/extracts/c_header_only/generated/libcrux_ct_ops.h */ /* * SPDX-FileCopyrightText: 2025 Cryspen Sarl * * SPDX-License-Identifier: MIT or Apache-2.0 * * This code was generated with the following revisions: * Charon: 667d2fc98984ff7f3df989c2367e6c1fa4a000e7 * Eurydice: 2381cbc416ef2ad0b561c362c500bc84f36b6785 * Karamel: 80f5435f2fc505973c469a4afcc8d875cddd0d8b * F*: 71d8221589d4d438af3706d89cb653cf53e18aab * Libcrux: 68dfed5a4a9e40277f62828471c029afed1ecdcc */ #ifndef libcrux_ct_ops_H #define libcrux_ct_ops_H #if defined(__cplusplus) extern "C" { #endif /** Return 1 if `value` is not zero and 0 otherwise. */ static KRML_NOINLINE uint8_t libcrux_ml_kem_constant_time_ops_inz(uint8_t value) { uint16_t value0 = (uint16_t)value; uint8_t result = (uint8_t)((uint32_t)core_num__u16__wrapping_add(~value0, 1U) >> 8U); return (uint32_t)result & 1U; } static KRML_NOINLINE uint8_t libcrux_ml_kem_constant_time_ops_is_non_zero(uint8_t value) { return libcrux_ml_kem_constant_time_ops_inz(value); } /** Return 1 if the bytes of `lhs` and `rhs` do not exactly match and 0 otherwise. */ static KRML_NOINLINE uint8_t libcrux_ml_kem_constant_time_ops_compare( Eurydice_slice lhs, Eurydice_slice rhs) { uint8_t r = 0U; for (size_t i = (size_t)0U; i < Eurydice_slice_len(lhs, uint8_t); i++) { size_t i0 = i; uint8_t nr = (uint32_t)r | ((uint32_t)Eurydice_slice_index(lhs, i0, uint8_t, uint8_t *) ^ (uint32_t)Eurydice_slice_index(rhs, i0, uint8_t, uint8_t *)); r = nr; } return libcrux_ml_kem_constant_time_ops_is_non_zero(r); } static KRML_NOINLINE uint8_t libcrux_ml_kem_constant_time_ops_compare_ciphertexts_in_constant_time( Eurydice_slice lhs, Eurydice_slice rhs) { return libcrux_ml_kem_constant_time_ops_compare(lhs, rhs); } /** If `selector` is not zero, return the bytes in `rhs`; return the bytes in `lhs` otherwise. */ static KRML_NOINLINE void libcrux_ml_kem_constant_time_ops_select_ct( Eurydice_slice lhs, Eurydice_slice rhs, uint8_t selector, uint8_t ret[32U]) { uint8_t mask = core_num__u8__wrapping_sub( libcrux_ml_kem_constant_time_ops_is_non_zero(selector), 1U); uint8_t out[32U] = {0U}; for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE; i++) { size_t i0 = i; uint8_t outi = ((uint32_t)Eurydice_slice_index(lhs, i0, uint8_t, uint8_t *) & (uint32_t)mask) | ((uint32_t)Eurydice_slice_index(rhs, i0, uint8_t, uint8_t *) & (uint32_t)~mask); out[i0] = outi; } memcpy(ret, out, (size_t)32U * sizeof(uint8_t)); } static KRML_NOINLINE void libcrux_ml_kem_constant_time_ops_select_shared_secret_in_constant_time( Eurydice_slice lhs, Eurydice_slice rhs, uint8_t selector, uint8_t ret[32U]) { libcrux_ml_kem_constant_time_ops_select_ct(lhs, rhs, selector, ret); } static KRML_NOINLINE void libcrux_ml_kem_constant_time_ops_compare_ciphertexts_select_shared_secret_in_constant_time( Eurydice_slice lhs_c, Eurydice_slice rhs_c, Eurydice_slice lhs_s, Eurydice_slice rhs_s, uint8_t ret[32U]) { uint8_t selector = libcrux_ml_kem_constant_time_ops_compare_ciphertexts_in_constant_time( lhs_c, rhs_c); uint8_t ret0[32U]; libcrux_ml_kem_constant_time_ops_select_shared_secret_in_constant_time( lhs_s, rhs_s, selector, ret0); memcpy(ret, ret0, (size_t)32U * sizeof(uint8_t)); } #if defined(__cplusplus) } #endif #define libcrux_ct_ops_H_DEFINED #endif /* libcrux_ct_ops_H */ /* from libcrux/libcrux-ml-kem/extracts/c_header_only/generated/libcrux_sha3_portable.h */ /* * SPDX-FileCopyrightText: 2025 Cryspen Sarl * * SPDX-License-Identifier: MIT or Apache-2.0 * * This code was generated with the following revisions: * Charon: 667d2fc98984ff7f3df989c2367e6c1fa4a000e7 * Eurydice: 2381cbc416ef2ad0b561c362c500bc84f36b6785 * Karamel: 80f5435f2fc505973c469a4afcc8d875cddd0d8b * F*: 71d8221589d4d438af3706d89cb653cf53e18aab * Libcrux: 68dfed5a4a9e40277f62828471c029afed1ecdcc */ #ifndef libcrux_sha3_portable_H #define libcrux_sha3_portable_H #if defined(__cplusplus) extern "C" { #endif /** This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_zero_d2(void) { return 0ULL; } static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable__veor5q_u64( uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e) { return (((a ^ b) ^ c) ^ d) ^ e; } /** This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_xor5_d2( uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e) { return libcrux_sha3_simd_portable__veor5q_u64(a, b, c, d, e); } /** A monomorphic instance of libcrux_sha3.simd.portable.rotate_left with const generics - LEFT= 1 - RIGHT= 63 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_rotate_left_76(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)1); } static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable__vrax1q_u64(uint64_t a, uint64_t b) { uint64_t uu____0 = a; return uu____0 ^ libcrux_sha3_simd_portable_rotate_left_76(b); } /** This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_rotate_left1_and_xor_d2(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vrax1q_u64(a, b); } static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable__vbcaxq_u64(uint64_t a, uint64_t b, uint64_t c) { return a ^ (b & ~c); } /** This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_and_not_xor_d2(uint64_t a, uint64_t b, uint64_t c) { return libcrux_sha3_simd_portable__vbcaxq_u64(a, b, c); } static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable__veorq_n_u64(uint64_t a, uint64_t c) { return a ^ c; } /** This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_xor_constant_d2(uint64_t a, uint64_t c) { return libcrux_sha3_simd_portable__veorq_n_u64(a, c); } /** This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_xor_d2(uint64_t a, uint64_t b) { return a ^ b; } static const uint64_t libcrux_sha3_generic_keccak_constants_ROUNDCONSTANTS[24U] = { 1ULL, 32898ULL, 9223372036854808714ULL, 9223372039002292224ULL, 32907ULL, 2147483649ULL, 9223372039002292353ULL, 9223372036854808585ULL, 138ULL, 136ULL, 2147516425ULL, 2147483658ULL, 2147516555ULL, 9223372036854775947ULL, 9223372036854808713ULL, 9223372036854808579ULL, 9223372036854808578ULL, 9223372036854775936ULL, 32778ULL, 9223372039002259466ULL, 9223372039002292353ULL, 9223372036854808704ULL, 2147483649ULL, 9223372039002292232ULL}; typedef struct size_t_x2_s { size_t fst; size_t snd; } size_t_x2; /** A monomorphic instance of libcrux_sha3.generic_keccak.KeccakState with types uint64_t with const generics - $1size_t */ typedef struct libcrux_sha3_generic_keccak_KeccakState_17_s { uint64_t st[25U]; } libcrux_sha3_generic_keccak_KeccakState_17; /** This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.new_80 with types uint64_t with const generics - N= 1 */ static KRML_MUSTINLINE libcrux_sha3_generic_keccak_KeccakState_17 libcrux_sha3_generic_keccak_new_80_04(void) { libcrux_sha3_generic_keccak_KeccakState_17 lit; uint64_t repeat_expression[25U]; for (size_t i = (size_t)0U; i < (size_t)25U; i++) { repeat_expression[i] = libcrux_sha3_simd_portable_zero_d2(); } memcpy(lit.st, repeat_expression, (size_t)25U * sizeof(uint64_t)); return lit; } /** A monomorphic instance of libcrux_sha3.traits.get_ij with types uint64_t with const generics - N= 1 */ static KRML_MUSTINLINE uint64_t *libcrux_sha3_traits_get_ij_04(uint64_t *arr, size_t i, size_t j) { return &arr[(size_t)5U * j + i]; } /** A monomorphic instance of libcrux_sha3.traits.set_ij with types uint64_t with const generics - N= 1 */ static KRML_MUSTINLINE void libcrux_sha3_traits_set_ij_04(uint64_t *arr, size_t i, size_t j, uint64_t value) { arr[(size_t)5U * j + i] = value; } /** A monomorphic instance of libcrux_sha3.simd.portable.load_block with const generics - RATE= 72 */ static KRML_MUSTINLINE void libcrux_sha3_simd_portable_load_block_f8( uint64_t *state, Eurydice_slice blocks, size_t start) { uint64_t state_flat[25U] = {0U}; for (size_t i = (size_t)0U; i < (size_t)72U / (size_t)8U; i++) { size_t i0 = i; size_t offset = start + (size_t)8U * i0; uint8_t uu____0[8U]; Result_15 dst; Eurydice_slice_to_array2( &dst, Eurydice_slice_subslice3(blocks, offset, offset + (size_t)8U, uint8_t *), Eurydice_slice, uint8_t[8U], TryFromSliceError); unwrap_26_68(dst, uu____0); state_flat[i0] = core_num__u64__from_le_bytes(uu____0); } for (size_t i = (size_t)0U; i < (size_t)72U / (size_t)8U; i++) { size_t i0 = i; libcrux_sha3_traits_set_ij_04( state, i0 / (size_t)5U, i0 % (size_t)5U, libcrux_sha3_traits_get_ij_04(state, i0 / (size_t)5U, i0 % (size_t)5U)[0U] ^ state_flat[i0]); } } /** This function found in impl {libcrux_sha3::traits::Absorb<1usize> for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} */ /** A monomorphic instance of libcrux_sha3.simd.portable.load_block_a1 with const generics - RATE= 72 */ static inline void libcrux_sha3_simd_portable_load_block_a1_f8( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *input, size_t start) { libcrux_sha3_simd_portable_load_block_f8(self->st, input[0U], start); } /** This function found in impl {core::ops::index::Index<(usize, usize), T> for libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.index_c2 with types uint64_t with const generics - N= 1 */ static inline uint64_t *libcrux_sha3_generic_keccak_index_c2_04( libcrux_sha3_generic_keccak_KeccakState_17 *self, size_t_x2 index) { return libcrux_sha3_traits_get_ij_04(self->st, index.fst, index.snd); } /** This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.theta_80 with types uint64_t with const generics - N= 1 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_theta_80_04( libcrux_sha3_generic_keccak_KeccakState_17 *self, uint64_t ret[5U]) { uint64_t c[5U] = { libcrux_sha3_simd_portable_xor5_d2( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)0U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)0U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)0U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)0U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)0U}))[0U]), libcrux_sha3_simd_portable_xor5_d2( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)1U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)1U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)1U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)1U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)1U}))[0U]), libcrux_sha3_simd_portable_xor5_d2( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)2U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)2U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)2U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)2U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)2U}))[0U]), libcrux_sha3_simd_portable_xor5_d2( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)3U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)3U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)3U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)3U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)3U}))[0U]), libcrux_sha3_simd_portable_xor5_d2( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)4U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)4U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)4U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)4U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)4U}))[0U])}; uint64_t uu____0 = libcrux_sha3_simd_portable_rotate_left1_and_xor_d2( c[((size_t)0U + (size_t)4U) % (size_t)5U], c[((size_t)0U + (size_t)1U) % (size_t)5U]); uint64_t uu____1 = libcrux_sha3_simd_portable_rotate_left1_and_xor_d2( c[((size_t)1U + (size_t)4U) % (size_t)5U], c[((size_t)1U + (size_t)1U) % (size_t)5U]); uint64_t uu____2 = libcrux_sha3_simd_portable_rotate_left1_and_xor_d2( c[((size_t)2U + (size_t)4U) % (size_t)5U], c[((size_t)2U + (size_t)1U) % (size_t)5U]); uint64_t uu____3 = libcrux_sha3_simd_portable_rotate_left1_and_xor_d2( c[((size_t)3U + (size_t)4U) % (size_t)5U], c[((size_t)3U + (size_t)1U) % (size_t)5U]); ret[0U] = uu____0; ret[1U] = uu____1; ret[2U] = uu____2; ret[3U] = uu____3; ret[4U] = libcrux_sha3_simd_portable_rotate_left1_and_xor_d2( c[((size_t)4U + (size_t)4U) % (size_t)5U], c[((size_t)4U + (size_t)1U) % (size_t)5U]); } /** This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.set_80 with types uint64_t with const generics - N= 1 */ static inline void libcrux_sha3_generic_keccak_set_80_04( libcrux_sha3_generic_keccak_KeccakState_17 *self, size_t i, size_t j, uint64_t v) { libcrux_sha3_traits_set_ij_04(self->st, i, j, v); } /** A monomorphic instance of libcrux_sha3.simd.portable.rotate_left with const generics - LEFT= 36 - RIGHT= 28 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_rotate_left_02(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)36); } /** A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 with const generics - LEFT= 36 - RIGHT= 28 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable__vxarq_u64_02(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_02(a ^ b); } /** This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} */ /** A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 with const generics - LEFT= 36 - RIGHT= 28 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_xor_and_rotate_d2_02(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_02(a, b); } /** A monomorphic instance of libcrux_sha3.simd.portable.rotate_left with const generics - LEFT= 3 - RIGHT= 61 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_rotate_left_ac(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)3); } /** A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 with const generics - LEFT= 3 - RIGHT= 61 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable__vxarq_u64_ac(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_ac(a ^ b); } /** This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} */ /** A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 with const generics - LEFT= 3 - RIGHT= 61 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_xor_and_rotate_d2_ac(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_ac(a, b); } /** A monomorphic instance of libcrux_sha3.simd.portable.rotate_left with const generics - LEFT= 41 - RIGHT= 23 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_rotate_left_020(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)41); } /** A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 with const generics - LEFT= 41 - RIGHT= 23 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable__vxarq_u64_020(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_020(a ^ b); } /** This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} */ /** A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 with const generics - LEFT= 41 - RIGHT= 23 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_xor_and_rotate_d2_020(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_020(a, b); } /** A monomorphic instance of libcrux_sha3.simd.portable.rotate_left with const generics - LEFT= 18 - RIGHT= 46 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_rotate_left_a9(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)18); } /** A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 with const generics - LEFT= 18 - RIGHT= 46 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable__vxarq_u64_a9(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_a9(a ^ b); } /** This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} */ /** A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 with const generics - LEFT= 18 - RIGHT= 46 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_xor_and_rotate_d2_a9(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_a9(a, b); } /** A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 with const generics - LEFT= 1 - RIGHT= 63 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable__vxarq_u64_76(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_76(a ^ b); } /** This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} */ /** A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 with const generics - LEFT= 1 - RIGHT= 63 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_xor_and_rotate_d2_76(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_76(a, b); } /** A monomorphic instance of libcrux_sha3.simd.portable.rotate_left with const generics - LEFT= 44 - RIGHT= 20 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_rotate_left_58(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)44); } /** A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 with const generics - LEFT= 44 - RIGHT= 20 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable__vxarq_u64_58(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_58(a ^ b); } /** This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} */ /** A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 with const generics - LEFT= 44 - RIGHT= 20 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_xor_and_rotate_d2_58(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_58(a, b); } /** A monomorphic instance of libcrux_sha3.simd.portable.rotate_left with const generics - LEFT= 10 - RIGHT= 54 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_rotate_left_e0(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)10); } /** A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 with const generics - LEFT= 10 - RIGHT= 54 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable__vxarq_u64_e0(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_e0(a ^ b); } /** This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} */ /** A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 with const generics - LEFT= 10 - RIGHT= 54 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_xor_and_rotate_d2_e0(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_e0(a, b); } /** A monomorphic instance of libcrux_sha3.simd.portable.rotate_left with const generics - LEFT= 45 - RIGHT= 19 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_rotate_left_63(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)45); } /** A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 with const generics - LEFT= 45 - RIGHT= 19 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable__vxarq_u64_63(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_63(a ^ b); } /** This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} */ /** A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 with const generics - LEFT= 45 - RIGHT= 19 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_xor_and_rotate_d2_63(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_63(a, b); } /** A monomorphic instance of libcrux_sha3.simd.portable.rotate_left with const generics - LEFT= 2 - RIGHT= 62 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_rotate_left_6a(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)2); } /** A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 with const generics - LEFT= 2 - RIGHT= 62 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable__vxarq_u64_6a(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_6a(a ^ b); } /** This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} */ /** A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 with const generics - LEFT= 2 - RIGHT= 62 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_xor_and_rotate_d2_6a(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_6a(a, b); } /** A monomorphic instance of libcrux_sha3.simd.portable.rotate_left with const generics - LEFT= 62 - RIGHT= 2 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_rotate_left_ab(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)62); } /** A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 with const generics - LEFT= 62 - RIGHT= 2 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable__vxarq_u64_ab(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_ab(a ^ b); } /** This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} */ /** A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 with const generics - LEFT= 62 - RIGHT= 2 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_xor_and_rotate_d2_ab(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_ab(a, b); } /** A monomorphic instance of libcrux_sha3.simd.portable.rotate_left with const generics - LEFT= 6 - RIGHT= 58 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_rotate_left_5b(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)6); } /** A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 with const generics - LEFT= 6 - RIGHT= 58 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable__vxarq_u64_5b(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_5b(a ^ b); } /** This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} */ /** A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 with const generics - LEFT= 6 - RIGHT= 58 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_xor_and_rotate_d2_5b(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_5b(a, b); } /** A monomorphic instance of libcrux_sha3.simd.portable.rotate_left with const generics - LEFT= 43 - RIGHT= 21 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_rotate_left_6f(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)43); } /** A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 with const generics - LEFT= 43 - RIGHT= 21 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable__vxarq_u64_6f(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_6f(a ^ b); } /** This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} */ /** A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 with const generics - LEFT= 43 - RIGHT= 21 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_xor_and_rotate_d2_6f(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_6f(a, b); } /** A monomorphic instance of libcrux_sha3.simd.portable.rotate_left with const generics - LEFT= 15 - RIGHT= 49 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_rotate_left_62(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)15); } /** A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 with const generics - LEFT= 15 - RIGHT= 49 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable__vxarq_u64_62(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_62(a ^ b); } /** This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} */ /** A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 with const generics - LEFT= 15 - RIGHT= 49 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_xor_and_rotate_d2_62(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_62(a, b); } /** A monomorphic instance of libcrux_sha3.simd.portable.rotate_left with const generics - LEFT= 61 - RIGHT= 3 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_rotate_left_23(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)61); } /** A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 with const generics - LEFT= 61 - RIGHT= 3 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable__vxarq_u64_23(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_23(a ^ b); } /** This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} */ /** A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 with const generics - LEFT= 61 - RIGHT= 3 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_xor_and_rotate_d2_23(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_23(a, b); } /** A monomorphic instance of libcrux_sha3.simd.portable.rotate_left with const generics - LEFT= 28 - RIGHT= 36 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_rotate_left_37(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)28); } /** A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 with const generics - LEFT= 28 - RIGHT= 36 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable__vxarq_u64_37(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_37(a ^ b); } /** This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} */ /** A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 with const generics - LEFT= 28 - RIGHT= 36 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_xor_and_rotate_d2_37(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_37(a, b); } /** A monomorphic instance of libcrux_sha3.simd.portable.rotate_left with const generics - LEFT= 55 - RIGHT= 9 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_rotate_left_bb(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)55); } /** A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 with const generics - LEFT= 55 - RIGHT= 9 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable__vxarq_u64_bb(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_bb(a ^ b); } /** This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} */ /** A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 with const generics - LEFT= 55 - RIGHT= 9 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_xor_and_rotate_d2_bb(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_bb(a, b); } /** A monomorphic instance of libcrux_sha3.simd.portable.rotate_left with const generics - LEFT= 25 - RIGHT= 39 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_rotate_left_b9(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)25); } /** A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 with const generics - LEFT= 25 - RIGHT= 39 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable__vxarq_u64_b9(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_b9(a ^ b); } /** This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} */ /** A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 with const generics - LEFT= 25 - RIGHT= 39 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_xor_and_rotate_d2_b9(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_b9(a, b); } /** A monomorphic instance of libcrux_sha3.simd.portable.rotate_left with const generics - LEFT= 21 - RIGHT= 43 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_rotate_left_54(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)21); } /** A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 with const generics - LEFT= 21 - RIGHT= 43 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable__vxarq_u64_54(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_54(a ^ b); } /** This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} */ /** A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 with const generics - LEFT= 21 - RIGHT= 43 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_xor_and_rotate_d2_54(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_54(a, b); } /** A monomorphic instance of libcrux_sha3.simd.portable.rotate_left with const generics - LEFT= 56 - RIGHT= 8 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_rotate_left_4c(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)56); } /** A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 with const generics - LEFT= 56 - RIGHT= 8 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable__vxarq_u64_4c(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_4c(a ^ b); } /** This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} */ /** A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 with const generics - LEFT= 56 - RIGHT= 8 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_xor_and_rotate_d2_4c(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_4c(a, b); } /** A monomorphic instance of libcrux_sha3.simd.portable.rotate_left with const generics - LEFT= 27 - RIGHT= 37 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_rotate_left_ce(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)27); } /** A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 with const generics - LEFT= 27 - RIGHT= 37 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable__vxarq_u64_ce(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_ce(a ^ b); } /** This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} */ /** A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 with const generics - LEFT= 27 - RIGHT= 37 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_xor_and_rotate_d2_ce(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_ce(a, b); } /** A monomorphic instance of libcrux_sha3.simd.portable.rotate_left with const generics - LEFT= 20 - RIGHT= 44 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_rotate_left_77(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)20); } /** A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 with const generics - LEFT= 20 - RIGHT= 44 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable__vxarq_u64_77(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_77(a ^ b); } /** This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} */ /** A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 with const generics - LEFT= 20 - RIGHT= 44 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_xor_and_rotate_d2_77(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_77(a, b); } /** A monomorphic instance of libcrux_sha3.simd.portable.rotate_left with const generics - LEFT= 39 - RIGHT= 25 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_rotate_left_25(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)39); } /** A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 with const generics - LEFT= 39 - RIGHT= 25 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable__vxarq_u64_25(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_25(a ^ b); } /** This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} */ /** A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 with const generics - LEFT= 39 - RIGHT= 25 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_xor_and_rotate_d2_25(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_25(a, b); } /** A monomorphic instance of libcrux_sha3.simd.portable.rotate_left with const generics - LEFT= 8 - RIGHT= 56 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_rotate_left_af(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)8); } /** A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 with const generics - LEFT= 8 - RIGHT= 56 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable__vxarq_u64_af(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_af(a ^ b); } /** This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} */ /** A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 with const generics - LEFT= 8 - RIGHT= 56 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_xor_and_rotate_d2_af(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_af(a, b); } /** A monomorphic instance of libcrux_sha3.simd.portable.rotate_left with const generics - LEFT= 14 - RIGHT= 50 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_rotate_left_fd(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)14); } /** A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 with const generics - LEFT= 14 - RIGHT= 50 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable__vxarq_u64_fd(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_fd(a ^ b); } /** This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} */ /** A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 with const generics - LEFT= 14 - RIGHT= 50 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_xor_and_rotate_d2_fd(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_fd(a, b); } /** This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.rho_80 with types uint64_t with const generics - N= 1 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_rho_80_04( libcrux_sha3_generic_keccak_KeccakState_17 *self, uint64_t t[5U]) { libcrux_sha3_generic_keccak_set_80_04( self, (size_t)0U, (size_t)0U, libcrux_sha3_simd_portable_xor_d2( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)0U}))[0U], t[0U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____0 = self; libcrux_sha3_generic_keccak_set_80_04( uu____0, (size_t)1U, (size_t)0U, libcrux_sha3_simd_portable_xor_and_rotate_d2_02( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)0U}))[0U], t[0U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____1 = self; libcrux_sha3_generic_keccak_set_80_04( uu____1, (size_t)2U, (size_t)0U, libcrux_sha3_simd_portable_xor_and_rotate_d2_ac( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)0U}))[0U], t[0U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____2 = self; libcrux_sha3_generic_keccak_set_80_04( uu____2, (size_t)3U, (size_t)0U, libcrux_sha3_simd_portable_xor_and_rotate_d2_020( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)0U}))[0U], t[0U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____3 = self; libcrux_sha3_generic_keccak_set_80_04( uu____3, (size_t)4U, (size_t)0U, libcrux_sha3_simd_portable_xor_and_rotate_d2_a9( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)0U}))[0U], t[0U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____4 = self; libcrux_sha3_generic_keccak_set_80_04( uu____4, (size_t)0U, (size_t)1U, libcrux_sha3_simd_portable_xor_and_rotate_d2_76( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)1U}))[0U], t[1U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____5 = self; libcrux_sha3_generic_keccak_set_80_04( uu____5, (size_t)1U, (size_t)1U, libcrux_sha3_simd_portable_xor_and_rotate_d2_58( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)1U}))[0U], t[1U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____6 = self; libcrux_sha3_generic_keccak_set_80_04( uu____6, (size_t)2U, (size_t)1U, libcrux_sha3_simd_portable_xor_and_rotate_d2_e0( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)1U}))[0U], t[1U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____7 = self; libcrux_sha3_generic_keccak_set_80_04( uu____7, (size_t)3U, (size_t)1U, libcrux_sha3_simd_portable_xor_and_rotate_d2_63( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)1U}))[0U], t[1U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____8 = self; libcrux_sha3_generic_keccak_set_80_04( uu____8, (size_t)4U, (size_t)1U, libcrux_sha3_simd_portable_xor_and_rotate_d2_6a( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)1U}))[0U], t[1U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____9 = self; libcrux_sha3_generic_keccak_set_80_04( uu____9, (size_t)0U, (size_t)2U, libcrux_sha3_simd_portable_xor_and_rotate_d2_ab( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)2U}))[0U], t[2U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____10 = self; libcrux_sha3_generic_keccak_set_80_04( uu____10, (size_t)1U, (size_t)2U, libcrux_sha3_simd_portable_xor_and_rotate_d2_5b( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)2U}))[0U], t[2U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____11 = self; libcrux_sha3_generic_keccak_set_80_04( uu____11, (size_t)2U, (size_t)2U, libcrux_sha3_simd_portable_xor_and_rotate_d2_6f( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)2U}))[0U], t[2U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____12 = self; libcrux_sha3_generic_keccak_set_80_04( uu____12, (size_t)3U, (size_t)2U, libcrux_sha3_simd_portable_xor_and_rotate_d2_62( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)2U}))[0U], t[2U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____13 = self; libcrux_sha3_generic_keccak_set_80_04( uu____13, (size_t)4U, (size_t)2U, libcrux_sha3_simd_portable_xor_and_rotate_d2_23( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)2U}))[0U], t[2U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____14 = self; libcrux_sha3_generic_keccak_set_80_04( uu____14, (size_t)0U, (size_t)3U, libcrux_sha3_simd_portable_xor_and_rotate_d2_37( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)3U}))[0U], t[3U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____15 = self; libcrux_sha3_generic_keccak_set_80_04( uu____15, (size_t)1U, (size_t)3U, libcrux_sha3_simd_portable_xor_and_rotate_d2_bb( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)3U}))[0U], t[3U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____16 = self; libcrux_sha3_generic_keccak_set_80_04( uu____16, (size_t)2U, (size_t)3U, libcrux_sha3_simd_portable_xor_and_rotate_d2_b9( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)3U}))[0U], t[3U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____17 = self; libcrux_sha3_generic_keccak_set_80_04( uu____17, (size_t)3U, (size_t)3U, libcrux_sha3_simd_portable_xor_and_rotate_d2_54( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)3U}))[0U], t[3U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____18 = self; libcrux_sha3_generic_keccak_set_80_04( uu____18, (size_t)4U, (size_t)3U, libcrux_sha3_simd_portable_xor_and_rotate_d2_4c( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)3U}))[0U], t[3U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____19 = self; libcrux_sha3_generic_keccak_set_80_04( uu____19, (size_t)0U, (size_t)4U, libcrux_sha3_simd_portable_xor_and_rotate_d2_ce( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)4U}))[0U], t[4U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____20 = self; libcrux_sha3_generic_keccak_set_80_04( uu____20, (size_t)1U, (size_t)4U, libcrux_sha3_simd_portable_xor_and_rotate_d2_77( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)4U}))[0U], t[4U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____21 = self; libcrux_sha3_generic_keccak_set_80_04( uu____21, (size_t)2U, (size_t)4U, libcrux_sha3_simd_portable_xor_and_rotate_d2_25( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)4U}))[0U], t[4U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____22 = self; libcrux_sha3_generic_keccak_set_80_04( uu____22, (size_t)3U, (size_t)4U, libcrux_sha3_simd_portable_xor_and_rotate_d2_af( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)4U}))[0U], t[4U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____23 = self; libcrux_sha3_generic_keccak_set_80_04( uu____23, (size_t)4U, (size_t)4U, libcrux_sha3_simd_portable_xor_and_rotate_d2_fd( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)4U}))[0U], t[4U])); } /** This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.pi_80 with types uint64_t with const generics - N= 1 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_pi_80_04( libcrux_sha3_generic_keccak_KeccakState_17 *self) { libcrux_sha3_generic_keccak_KeccakState_17 old = self[0U]; libcrux_sha3_generic_keccak_set_80_04( self, (size_t)1U, (size_t)0U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)3U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)2U, (size_t)0U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)1U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)3U, (size_t)0U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)4U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)4U, (size_t)0U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)2U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)0U, (size_t)1U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)1U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)1U, (size_t)1U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)4U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)2U, (size_t)1U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)2U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)3U, (size_t)1U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)0U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)4U, (size_t)1U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)3U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)0U, (size_t)2U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)2U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)1U, (size_t)2U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)0U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)2U, (size_t)2U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)3U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)3U, (size_t)2U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)1U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)4U, (size_t)2U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)4U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)0U, (size_t)3U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)3U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)1U, (size_t)3U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)1U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)2U, (size_t)3U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)4U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)3U, (size_t)3U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)2U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)4U, (size_t)3U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)0U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)0U, (size_t)4U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)4U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)1U, (size_t)4U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)2U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)2U, (size_t)4U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)0U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)3U, (size_t)4U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)3U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)4U, (size_t)4U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)1U}))[0U]); } /** This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.chi_80 with types uint64_t with const generics - N= 1 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_chi_80_04( libcrux_sha3_generic_keccak_KeccakState_17 *self) { libcrux_sha3_generic_keccak_KeccakState_17 old = self[0U]; for (size_t i0 = (size_t)0U; i0 < (size_t)5U; i0++) { size_t i1 = i0; for (size_t i = (size_t)0U; i < (size_t)5U; i++) { size_t j = i; libcrux_sha3_generic_keccak_set_80_04( self, i1, j, libcrux_sha3_simd_portable_and_not_xor_d2( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = i1, .snd = j}))[0U], libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){ .fst = i1, .snd = (j + (size_t)2U) % (size_t)5U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){ .fst = i1, .snd = (j + (size_t)1U) % (size_t)5U}))[0U])); } } } /** This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.iota_80 with types uint64_t with const generics - N= 1 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_iota_80_04( libcrux_sha3_generic_keccak_KeccakState_17 *self, size_t i) { libcrux_sha3_generic_keccak_set_80_04( self, (size_t)0U, (size_t)0U, libcrux_sha3_simd_portable_xor_constant_d2( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)0U}))[0U], libcrux_sha3_generic_keccak_constants_ROUNDCONSTANTS[i])); } /** This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.keccakf1600_80 with types uint64_t with const generics - N= 1 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_keccakf1600_80_04( libcrux_sha3_generic_keccak_KeccakState_17 *self) { for (size_t i = (size_t)0U; i < (size_t)24U; i++) { size_t i0 = i; uint64_t t[5U]; libcrux_sha3_generic_keccak_theta_80_04(self, t); libcrux_sha3_generic_keccak_KeccakState_17 *uu____0 = self; uint64_t uu____1[5U]; memcpy(uu____1, t, (size_t)5U * sizeof(uint64_t)); libcrux_sha3_generic_keccak_rho_80_04(uu____0, uu____1); libcrux_sha3_generic_keccak_pi_80_04(self); libcrux_sha3_generic_keccak_chi_80_04(self); libcrux_sha3_generic_keccak_iota_80_04(self, i0); } } /** This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_block_80 with types uint64_t with const generics - N= 1 - RATE= 72 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_block_80_c6( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *blocks, size_t start) { libcrux_sha3_simd_portable_load_block_a1_f8(self, blocks, start); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); } /** A monomorphic instance of libcrux_sha3.simd.portable.load_last with const generics - RATE= 72 - DELIMITER= 6 */ static KRML_MUSTINLINE void libcrux_sha3_simd_portable_load_last_96( uint64_t *state, Eurydice_slice blocks, size_t start, size_t len) { uint8_t buffer[72U] = {0U}; Eurydice_slice_copy( Eurydice_array_to_subslice3(buffer, (size_t)0U, len, uint8_t *), Eurydice_slice_subslice3(blocks, start, start + len, uint8_t *), uint8_t); buffer[len] = 6U; size_t uu____0 = (size_t)72U - (size_t)1U; buffer[uu____0] = (uint32_t)buffer[uu____0] | 128U; libcrux_sha3_simd_portable_load_block_f8( state, Eurydice_array_to_slice((size_t)72U, buffer, uint8_t), (size_t)0U); } /** This function found in impl {libcrux_sha3::traits::Absorb<1usize> for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} */ /** A monomorphic instance of libcrux_sha3.simd.portable.load_last_a1 with const generics - RATE= 72 - DELIMITER= 6 */ static inline void libcrux_sha3_simd_portable_load_last_a1_96( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *input, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_96(self->st, input[0U], start, len); } /** This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_final_80 with types uint64_t with const generics - N= 1 - RATE= 72 - DELIM= 6 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_final_80_9e( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *last, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_a1_96(self, last, start, len); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); } /** A monomorphic instance of libcrux_sha3.simd.portable.store_block with const generics - RATE= 72 */ static KRML_MUSTINLINE void libcrux_sha3_simd_portable_store_block_f8( uint64_t *s, Eurydice_slice out, size_t start, size_t len) { size_t octets = len / (size_t)8U; for (size_t i = (size_t)0U; i < octets; i++) { size_t i0 = i; Eurydice_slice uu____0 = Eurydice_slice_subslice3( out, start + (size_t)8U * i0, start + (size_t)8U * i0 + (size_t)8U, uint8_t *); uint8_t ret[8U]; core_num__u64__to_le_bytes( libcrux_sha3_traits_get_ij_04(s, i0 / (size_t)5U, i0 % (size_t)5U)[0U], ret); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)8U, ret, uint8_t), uint8_t); } size_t remaining = len % (size_t)8U; if (remaining > (size_t)0U) { Eurydice_slice uu____1 = Eurydice_slice_subslice3( out, start + len - remaining, start + len, uint8_t *); uint8_t ret[8U]; core_num__u64__to_le_bytes( libcrux_sha3_traits_get_ij_04(s, octets / (size_t)5U, octets % (size_t)5U)[0U], ret); Eurydice_slice_copy( uu____1, Eurydice_array_to_subslice3(ret, (size_t)0U, remaining, uint8_t *), uint8_t); } } /** This function found in impl {libcrux_sha3::traits::Squeeze1 for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} */ /** A monomorphic instance of libcrux_sha3.simd.portable.squeeze_13 with const generics - RATE= 72 */ static inline void libcrux_sha3_simd_portable_squeeze_13_f8( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice out, size_t start, size_t len) { libcrux_sha3_simd_portable_store_block_f8(self->st, out, start, len); } /** A monomorphic instance of libcrux_sha3.generic_keccak.portable.keccak1 with const generics - RATE= 72 - DELIM= 6 */ static inline void libcrux_sha3_generic_keccak_portable_keccak1_96( Eurydice_slice data, Eurydice_slice out) { libcrux_sha3_generic_keccak_KeccakState_17 s = libcrux_sha3_generic_keccak_new_80_04(); size_t data_len = Eurydice_slice_len(data, uint8_t); for (size_t i = (size_t)0U; i < data_len / (size_t)72U; i++) { size_t i0 = i; Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_block_80_c6(&s, buf, i0 * (size_t)72U); } size_t rem = data_len % (size_t)72U; Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_final_80_9e(&s, buf, data_len - rem, rem); size_t outlen = Eurydice_slice_len(out, uint8_t); size_t blocks = outlen / (size_t)72U; size_t last = outlen - outlen % (size_t)72U; if (blocks == (size_t)0U) { libcrux_sha3_simd_portable_squeeze_13_f8(&s, out, (size_t)0U, outlen); } else { libcrux_sha3_simd_portable_squeeze_13_f8(&s, out, (size_t)0U, (size_t)72U); for (size_t i = (size_t)1U; i < blocks; i++) { size_t i0 = i; libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_f8(&s, out, i0 * (size_t)72U, (size_t)72U); } if (last < outlen) { libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_f8(&s, out, last, outlen - last); } } } /** A portable SHA3 512 implementation. */ static KRML_MUSTINLINE void libcrux_sha3_portable_sha512(Eurydice_slice digest, Eurydice_slice data) { libcrux_sha3_generic_keccak_portable_keccak1_96(data, digest); } /** A monomorphic instance of libcrux_sha3.simd.portable.load_block with const generics - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_simd_portable_load_block_5b( uint64_t *state, Eurydice_slice blocks, size_t start) { uint64_t state_flat[25U] = {0U}; for (size_t i = (size_t)0U; i < (size_t)136U / (size_t)8U; i++) { size_t i0 = i; size_t offset = start + (size_t)8U * i0; uint8_t uu____0[8U]; Result_15 dst; Eurydice_slice_to_array2( &dst, Eurydice_slice_subslice3(blocks, offset, offset + (size_t)8U, uint8_t *), Eurydice_slice, uint8_t[8U], TryFromSliceError); unwrap_26_68(dst, uu____0); state_flat[i0] = core_num__u64__from_le_bytes(uu____0); } for (size_t i = (size_t)0U; i < (size_t)136U / (size_t)8U; i++) { size_t i0 = i; libcrux_sha3_traits_set_ij_04( state, i0 / (size_t)5U, i0 % (size_t)5U, libcrux_sha3_traits_get_ij_04(state, i0 / (size_t)5U, i0 % (size_t)5U)[0U] ^ state_flat[i0]); } } /** This function found in impl {libcrux_sha3::traits::Absorb<1usize> for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} */ /** A monomorphic instance of libcrux_sha3.simd.portable.load_block_a1 with const generics - RATE= 136 */ static inline void libcrux_sha3_simd_portable_load_block_a1_5b( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *input, size_t start) { libcrux_sha3_simd_portable_load_block_5b(self->st, input[0U], start); } /** This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_block_80 with types uint64_t with const generics - N= 1 - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_block_80_c60( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *blocks, size_t start) { libcrux_sha3_simd_portable_load_block_a1_5b(self, blocks, start); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); } /** A monomorphic instance of libcrux_sha3.simd.portable.load_last with const generics - RATE= 136 - DELIMITER= 6 */ static KRML_MUSTINLINE void libcrux_sha3_simd_portable_load_last_ad( uint64_t *state, Eurydice_slice blocks, size_t start, size_t len) { uint8_t buffer[136U] = {0U}; Eurydice_slice_copy( Eurydice_array_to_subslice3(buffer, (size_t)0U, len, uint8_t *), Eurydice_slice_subslice3(blocks, start, start + len, uint8_t *), uint8_t); buffer[len] = 6U; size_t uu____0 = (size_t)136U - (size_t)1U; buffer[uu____0] = (uint32_t)buffer[uu____0] | 128U; libcrux_sha3_simd_portable_load_block_5b( state, Eurydice_array_to_slice((size_t)136U, buffer, uint8_t), (size_t)0U); } /** This function found in impl {libcrux_sha3::traits::Absorb<1usize> for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} */ /** A monomorphic instance of libcrux_sha3.simd.portable.load_last_a1 with const generics - RATE= 136 - DELIMITER= 6 */ static inline void libcrux_sha3_simd_portable_load_last_a1_ad( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *input, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_ad(self->st, input[0U], start, len); } /** This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_final_80 with types uint64_t with const generics - N= 1 - RATE= 136 - DELIM= 6 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_final_80_9e0( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *last, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_a1_ad(self, last, start, len); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); } /** A monomorphic instance of libcrux_sha3.simd.portable.store_block with const generics - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_simd_portable_store_block_5b( uint64_t *s, Eurydice_slice out, size_t start, size_t len) { size_t octets = len / (size_t)8U; for (size_t i = (size_t)0U; i < octets; i++) { size_t i0 = i; Eurydice_slice uu____0 = Eurydice_slice_subslice3( out, start + (size_t)8U * i0, start + (size_t)8U * i0 + (size_t)8U, uint8_t *); uint8_t ret[8U]; core_num__u64__to_le_bytes( libcrux_sha3_traits_get_ij_04(s, i0 / (size_t)5U, i0 % (size_t)5U)[0U], ret); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)8U, ret, uint8_t), uint8_t); } size_t remaining = len % (size_t)8U; if (remaining > (size_t)0U) { Eurydice_slice uu____1 = Eurydice_slice_subslice3( out, start + len - remaining, start + len, uint8_t *); uint8_t ret[8U]; core_num__u64__to_le_bytes( libcrux_sha3_traits_get_ij_04(s, octets / (size_t)5U, octets % (size_t)5U)[0U], ret); Eurydice_slice_copy( uu____1, Eurydice_array_to_subslice3(ret, (size_t)0U, remaining, uint8_t *), uint8_t); } } /** This function found in impl {libcrux_sha3::traits::Squeeze1 for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} */ /** A monomorphic instance of libcrux_sha3.simd.portable.squeeze_13 with const generics - RATE= 136 */ static inline void libcrux_sha3_simd_portable_squeeze_13_5b( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice out, size_t start, size_t len) { libcrux_sha3_simd_portable_store_block_5b(self->st, out, start, len); } /** A monomorphic instance of libcrux_sha3.generic_keccak.portable.keccak1 with const generics - RATE= 136 - DELIM= 6 */ static inline void libcrux_sha3_generic_keccak_portable_keccak1_ad( Eurydice_slice data, Eurydice_slice out) { libcrux_sha3_generic_keccak_KeccakState_17 s = libcrux_sha3_generic_keccak_new_80_04(); size_t data_len = Eurydice_slice_len(data, uint8_t); for (size_t i = (size_t)0U; i < data_len / (size_t)136U; i++) { size_t i0 = i; Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_block_80_c60(&s, buf, i0 * (size_t)136U); } size_t rem = data_len % (size_t)136U; Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_final_80_9e0(&s, buf, data_len - rem, rem); size_t outlen = Eurydice_slice_len(out, uint8_t); size_t blocks = outlen / (size_t)136U; size_t last = outlen - outlen % (size_t)136U; if (blocks == (size_t)0U) { libcrux_sha3_simd_portable_squeeze_13_5b(&s, out, (size_t)0U, outlen); } else { libcrux_sha3_simd_portable_squeeze_13_5b(&s, out, (size_t)0U, (size_t)136U); for (size_t i = (size_t)1U; i < blocks; i++) { size_t i0 = i; libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_5b(&s, out, i0 * (size_t)136U, (size_t)136U); } if (last < outlen) { libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_5b(&s, out, last, outlen - last); } } } /** A portable SHA3 256 implementation. */ static KRML_MUSTINLINE void libcrux_sha3_portable_sha256(Eurydice_slice digest, Eurydice_slice data) { libcrux_sha3_generic_keccak_portable_keccak1_ad(data, digest); } /** A monomorphic instance of libcrux_sha3.simd.portable.load_last with const generics - RATE= 136 - DELIMITER= 31 */ static KRML_MUSTINLINE void libcrux_sha3_simd_portable_load_last_ad0( uint64_t *state, Eurydice_slice blocks, size_t start, size_t len) { uint8_t buffer[136U] = {0U}; Eurydice_slice_copy( Eurydice_array_to_subslice3(buffer, (size_t)0U, len, uint8_t *), Eurydice_slice_subslice3(blocks, start, start + len, uint8_t *), uint8_t); buffer[len] = 31U; size_t uu____0 = (size_t)136U - (size_t)1U; buffer[uu____0] = (uint32_t)buffer[uu____0] | 128U; libcrux_sha3_simd_portable_load_block_5b( state, Eurydice_array_to_slice((size_t)136U, buffer, uint8_t), (size_t)0U); } /** This function found in impl {libcrux_sha3::traits::Absorb<1usize> for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} */ /** A monomorphic instance of libcrux_sha3.simd.portable.load_last_a1 with const generics - RATE= 136 - DELIMITER= 31 */ static inline void libcrux_sha3_simd_portable_load_last_a1_ad0( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *input, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_ad0(self->st, input[0U], start, len); } /** This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_final_80 with types uint64_t with const generics - N= 1 - RATE= 136 - DELIM= 31 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_final_80_9e1( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *last, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_a1_ad0(self, last, start, len); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); } /** A monomorphic instance of libcrux_sha3.generic_keccak.portable.keccak1 with const generics - RATE= 136 - DELIM= 31 */ static inline void libcrux_sha3_generic_keccak_portable_keccak1_ad0( Eurydice_slice data, Eurydice_slice out) { libcrux_sha3_generic_keccak_KeccakState_17 s = libcrux_sha3_generic_keccak_new_80_04(); size_t data_len = Eurydice_slice_len(data, uint8_t); for (size_t i = (size_t)0U; i < data_len / (size_t)136U; i++) { size_t i0 = i; Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_block_80_c60(&s, buf, i0 * (size_t)136U); } size_t rem = data_len % (size_t)136U; Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_final_80_9e1(&s, buf, data_len - rem, rem); size_t outlen = Eurydice_slice_len(out, uint8_t); size_t blocks = outlen / (size_t)136U; size_t last = outlen - outlen % (size_t)136U; if (blocks == (size_t)0U) { libcrux_sha3_simd_portable_squeeze_13_5b(&s, out, (size_t)0U, outlen); } else { libcrux_sha3_simd_portable_squeeze_13_5b(&s, out, (size_t)0U, (size_t)136U); for (size_t i = (size_t)1U; i < blocks; i++) { size_t i0 = i; libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_5b(&s, out, i0 * (size_t)136U, (size_t)136U); } if (last < outlen) { libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_5b(&s, out, last, outlen - last); } } } /** A portable SHAKE256 implementation. */ static KRML_MUSTINLINE void libcrux_sha3_portable_shake256( Eurydice_slice digest, Eurydice_slice data) { libcrux_sha3_generic_keccak_portable_keccak1_ad0(data, digest); } typedef libcrux_sha3_generic_keccak_KeccakState_17 libcrux_sha3_portable_KeccakState; /** Create a new SHAKE-128 state object. */ static KRML_MUSTINLINE libcrux_sha3_generic_keccak_KeccakState_17 libcrux_sha3_portable_incremental_shake128_init(void) { return libcrux_sha3_generic_keccak_new_80_04(); } /** A monomorphic instance of libcrux_sha3.simd.portable.load_block with const generics - RATE= 168 */ static KRML_MUSTINLINE void libcrux_sha3_simd_portable_load_block_3a( uint64_t *state, Eurydice_slice blocks, size_t start) { uint64_t state_flat[25U] = {0U}; for (size_t i = (size_t)0U; i < (size_t)168U / (size_t)8U; i++) { size_t i0 = i; size_t offset = start + (size_t)8U * i0; uint8_t uu____0[8U]; Result_15 dst; Eurydice_slice_to_array2( &dst, Eurydice_slice_subslice3(blocks, offset, offset + (size_t)8U, uint8_t *), Eurydice_slice, uint8_t[8U], TryFromSliceError); unwrap_26_68(dst, uu____0); state_flat[i0] = core_num__u64__from_le_bytes(uu____0); } for (size_t i = (size_t)0U; i < (size_t)168U / (size_t)8U; i++) { size_t i0 = i; libcrux_sha3_traits_set_ij_04( state, i0 / (size_t)5U, i0 % (size_t)5U, libcrux_sha3_traits_get_ij_04(state, i0 / (size_t)5U, i0 % (size_t)5U)[0U] ^ state_flat[i0]); } } /** A monomorphic instance of libcrux_sha3.simd.portable.load_last with const generics - RATE= 168 - DELIMITER= 31 */ static KRML_MUSTINLINE void libcrux_sha3_simd_portable_load_last_c6( uint64_t *state, Eurydice_slice blocks, size_t start, size_t len) { uint8_t buffer[168U] = {0U}; Eurydice_slice_copy( Eurydice_array_to_subslice3(buffer, (size_t)0U, len, uint8_t *), Eurydice_slice_subslice3(blocks, start, start + len, uint8_t *), uint8_t); buffer[len] = 31U; size_t uu____0 = (size_t)168U - (size_t)1U; buffer[uu____0] = (uint32_t)buffer[uu____0] | 128U; libcrux_sha3_simd_portable_load_block_3a( state, Eurydice_array_to_slice((size_t)168U, buffer, uint8_t), (size_t)0U); } /** This function found in impl {libcrux_sha3::traits::Absorb<1usize> for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} */ /** A monomorphic instance of libcrux_sha3.simd.portable.load_last_a1 with const generics - RATE= 168 - DELIMITER= 31 */ static inline void libcrux_sha3_simd_portable_load_last_a1_c6( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *input, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_c6(self->st, input[0U], start, len); } /** This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_final_80 with types uint64_t with const generics - N= 1 - RATE= 168 - DELIM= 31 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_final_80_9e2( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *last, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_a1_c6(self, last, start, len); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); } /** Absorb */ static KRML_MUSTINLINE void libcrux_sha3_portable_incremental_shake128_absorb_final( libcrux_sha3_generic_keccak_KeccakState_17 *s, Eurydice_slice data0) { libcrux_sha3_generic_keccak_KeccakState_17 *uu____0 = s; Eurydice_slice uu____1[1U] = {data0}; libcrux_sha3_generic_keccak_absorb_final_80_9e2( uu____0, uu____1, (size_t)0U, Eurydice_slice_len(data0, uint8_t)); } /** A monomorphic instance of libcrux_sha3.simd.portable.store_block with const generics - RATE= 168 */ static KRML_MUSTINLINE void libcrux_sha3_simd_portable_store_block_3a( uint64_t *s, Eurydice_slice out, size_t start, size_t len) { size_t octets = len / (size_t)8U; for (size_t i = (size_t)0U; i < octets; i++) { size_t i0 = i; Eurydice_slice uu____0 = Eurydice_slice_subslice3( out, start + (size_t)8U * i0, start + (size_t)8U * i0 + (size_t)8U, uint8_t *); uint8_t ret[8U]; core_num__u64__to_le_bytes( libcrux_sha3_traits_get_ij_04(s, i0 / (size_t)5U, i0 % (size_t)5U)[0U], ret); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)8U, ret, uint8_t), uint8_t); } size_t remaining = len % (size_t)8U; if (remaining > (size_t)0U) { Eurydice_slice uu____1 = Eurydice_slice_subslice3( out, start + len - remaining, start + len, uint8_t *); uint8_t ret[8U]; core_num__u64__to_le_bytes( libcrux_sha3_traits_get_ij_04(s, octets / (size_t)5U, octets % (size_t)5U)[0U], ret); Eurydice_slice_copy( uu____1, Eurydice_array_to_subslice3(ret, (size_t)0U, remaining, uint8_t *), uint8_t); } } /** This function found in impl {libcrux_sha3::traits::Squeeze1 for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} */ /** A monomorphic instance of libcrux_sha3.simd.portable.squeeze_13 with const generics - RATE= 168 */ static inline void libcrux_sha3_simd_portable_squeeze_13_3a( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice out, size_t start, size_t len) { libcrux_sha3_simd_portable_store_block_3a(self->st, out, start, len); } /** This function found in impl {libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.portable.squeeze_first_three_blocks_b4 with const generics - RATE= 168 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_portable_squeeze_first_three_blocks_b4_3a( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice out) { libcrux_sha3_simd_portable_squeeze_13_3a(self, out, (size_t)0U, (size_t)168U); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); libcrux_sha3_simd_portable_squeeze_13_3a(self, out, (size_t)168U, (size_t)168U); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); libcrux_sha3_simd_portable_squeeze_13_3a(self, out, (size_t)2U * (size_t)168U, (size_t)168U); } /** Squeeze three blocks */ static KRML_MUSTINLINE void libcrux_sha3_portable_incremental_shake128_squeeze_first_three_blocks( libcrux_sha3_generic_keccak_KeccakState_17 *s, Eurydice_slice out0) { libcrux_sha3_generic_keccak_portable_squeeze_first_three_blocks_b4_3a(s, out0); } /** This function found in impl {libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.portable.squeeze_next_block_b4 with const generics - RATE= 168 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_portable_squeeze_next_block_b4_3a( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice out, size_t start) { libcrux_sha3_generic_keccak_keccakf1600_80_04(self); libcrux_sha3_simd_portable_squeeze_13_3a(self, out, start, (size_t)168U); } /** Squeeze another block */ static KRML_MUSTINLINE void libcrux_sha3_portable_incremental_shake128_squeeze_next_block( libcrux_sha3_generic_keccak_KeccakState_17 *s, Eurydice_slice out0) { libcrux_sha3_generic_keccak_portable_squeeze_next_block_b4_3a(s, out0, (size_t)0U); } #define libcrux_sha3_Algorithm_Sha224 1 #define libcrux_sha3_Algorithm_Sha256 2 #define libcrux_sha3_Algorithm_Sha384 3 #define libcrux_sha3_Algorithm_Sha512 4 typedef uint8_t libcrux_sha3_Algorithm; typedef uint8_t libcrux_sha3_Sha3_224Digest[28U]; typedef uint8_t libcrux_sha3_Sha3_256Digest[32U]; typedef uint8_t libcrux_sha3_Sha3_384Digest[48U]; typedef uint8_t libcrux_sha3_Sha3_512Digest[64U]; /** Returns the output size of a digest. */ static inline size_t libcrux_sha3_digest_size(libcrux_sha3_Algorithm mode) { switch (mode) { case libcrux_sha3_Algorithm_Sha224: { break; } case libcrux_sha3_Algorithm_Sha256: { return (size_t)32U; } case libcrux_sha3_Algorithm_Sha384: { return (size_t)48U; } case libcrux_sha3_Algorithm_Sha512: { return (size_t)64U; } default: { KRML_HOST_EPRINTF("KaRaMeL incomplete match at %s:%d\n", __FILE__, __LINE__); KRML_HOST_EXIT(253U); } } return (size_t)28U; } /** A monomorphic instance of libcrux_sha3.simd.portable.load_block with const generics - RATE= 144 */ static KRML_MUSTINLINE void libcrux_sha3_simd_portable_load_block_2c( uint64_t *state, Eurydice_slice blocks, size_t start) { uint64_t state_flat[25U] = {0U}; for (size_t i = (size_t)0U; i < (size_t)144U / (size_t)8U; i++) { size_t i0 = i; size_t offset = start + (size_t)8U * i0; uint8_t uu____0[8U]; Result_15 dst; Eurydice_slice_to_array2( &dst, Eurydice_slice_subslice3(blocks, offset, offset + (size_t)8U, uint8_t *), Eurydice_slice, uint8_t[8U], TryFromSliceError); unwrap_26_68(dst, uu____0); state_flat[i0] = core_num__u64__from_le_bytes(uu____0); } for (size_t i = (size_t)0U; i < (size_t)144U / (size_t)8U; i++) { size_t i0 = i; libcrux_sha3_traits_set_ij_04( state, i0 / (size_t)5U, i0 % (size_t)5U, libcrux_sha3_traits_get_ij_04(state, i0 / (size_t)5U, i0 % (size_t)5U)[0U] ^ state_flat[i0]); } } /** This function found in impl {libcrux_sha3::traits::Absorb<1usize> for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} */ /** A monomorphic instance of libcrux_sha3.simd.portable.load_block_a1 with const generics - RATE= 144 */ static inline void libcrux_sha3_simd_portable_load_block_a1_2c( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *input, size_t start) { libcrux_sha3_simd_portable_load_block_2c(self->st, input[0U], start); } /** This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_block_80 with types uint64_t with const generics - N= 1 - RATE= 144 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_block_80_c61( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *blocks, size_t start) { libcrux_sha3_simd_portable_load_block_a1_2c(self, blocks, start); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); } /** A monomorphic instance of libcrux_sha3.simd.portable.load_last with const generics - RATE= 144 - DELIMITER= 6 */ static KRML_MUSTINLINE void libcrux_sha3_simd_portable_load_last_1e( uint64_t *state, Eurydice_slice blocks, size_t start, size_t len) { uint8_t buffer[144U] = {0U}; Eurydice_slice_copy( Eurydice_array_to_subslice3(buffer, (size_t)0U, len, uint8_t *), Eurydice_slice_subslice3(blocks, start, start + len, uint8_t *), uint8_t); buffer[len] = 6U; size_t uu____0 = (size_t)144U - (size_t)1U; buffer[uu____0] = (uint32_t)buffer[uu____0] | 128U; libcrux_sha3_simd_portable_load_block_2c( state, Eurydice_array_to_slice((size_t)144U, buffer, uint8_t), (size_t)0U); } /** This function found in impl {libcrux_sha3::traits::Absorb<1usize> for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} */ /** A monomorphic instance of libcrux_sha3.simd.portable.load_last_a1 with const generics - RATE= 144 - DELIMITER= 6 */ static inline void libcrux_sha3_simd_portable_load_last_a1_1e( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *input, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_1e(self->st, input[0U], start, len); } /** This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_final_80 with types uint64_t with const generics - N= 1 - RATE= 144 - DELIM= 6 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_final_80_9e3( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *last, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_a1_1e(self, last, start, len); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); } /** A monomorphic instance of libcrux_sha3.simd.portable.store_block with const generics - RATE= 144 */ static KRML_MUSTINLINE void libcrux_sha3_simd_portable_store_block_2c( uint64_t *s, Eurydice_slice out, size_t start, size_t len) { size_t octets = len / (size_t)8U; for (size_t i = (size_t)0U; i < octets; i++) { size_t i0 = i; Eurydice_slice uu____0 = Eurydice_slice_subslice3( out, start + (size_t)8U * i0, start + (size_t)8U * i0 + (size_t)8U, uint8_t *); uint8_t ret[8U]; core_num__u64__to_le_bytes( libcrux_sha3_traits_get_ij_04(s, i0 / (size_t)5U, i0 % (size_t)5U)[0U], ret); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)8U, ret, uint8_t), uint8_t); } size_t remaining = len % (size_t)8U; if (remaining > (size_t)0U) { Eurydice_slice uu____1 = Eurydice_slice_subslice3( out, start + len - remaining, start + len, uint8_t *); uint8_t ret[8U]; core_num__u64__to_le_bytes( libcrux_sha3_traits_get_ij_04(s, octets / (size_t)5U, octets % (size_t)5U)[0U], ret); Eurydice_slice_copy( uu____1, Eurydice_array_to_subslice3(ret, (size_t)0U, remaining, uint8_t *), uint8_t); } } /** This function found in impl {libcrux_sha3::traits::Squeeze1 for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} */ /** A monomorphic instance of libcrux_sha3.simd.portable.squeeze_13 with const generics - RATE= 144 */ static inline void libcrux_sha3_simd_portable_squeeze_13_2c( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice out, size_t start, size_t len) { libcrux_sha3_simd_portable_store_block_2c(self->st, out, start, len); } /** A monomorphic instance of libcrux_sha3.generic_keccak.portable.keccak1 with const generics - RATE= 144 - DELIM= 6 */ static inline void libcrux_sha3_generic_keccak_portable_keccak1_1e( Eurydice_slice data, Eurydice_slice out) { libcrux_sha3_generic_keccak_KeccakState_17 s = libcrux_sha3_generic_keccak_new_80_04(); size_t data_len = Eurydice_slice_len(data, uint8_t); for (size_t i = (size_t)0U; i < data_len / (size_t)144U; i++) { size_t i0 = i; Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_block_80_c61(&s, buf, i0 * (size_t)144U); } size_t rem = data_len % (size_t)144U; Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_final_80_9e3(&s, buf, data_len - rem, rem); size_t outlen = Eurydice_slice_len(out, uint8_t); size_t blocks = outlen / (size_t)144U; size_t last = outlen - outlen % (size_t)144U; if (blocks == (size_t)0U) { libcrux_sha3_simd_portable_squeeze_13_2c(&s, out, (size_t)0U, outlen); } else { libcrux_sha3_simd_portable_squeeze_13_2c(&s, out, (size_t)0U, (size_t)144U); for (size_t i = (size_t)1U; i < blocks; i++) { size_t i0 = i; libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_2c(&s, out, i0 * (size_t)144U, (size_t)144U); } if (last < outlen) { libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_2c(&s, out, last, outlen - last); } } } /** A portable SHA3 224 implementation. */ static KRML_MUSTINLINE void libcrux_sha3_portable_sha224(Eurydice_slice digest, Eurydice_slice data) { libcrux_sha3_generic_keccak_portable_keccak1_1e(data, digest); } /** A monomorphic instance of libcrux_sha3.simd.portable.load_block with const generics - RATE= 104 */ static KRML_MUSTINLINE void libcrux_sha3_simd_portable_load_block_7a( uint64_t *state, Eurydice_slice blocks, size_t start) { uint64_t state_flat[25U] = {0U}; for (size_t i = (size_t)0U; i < (size_t)104U / (size_t)8U; i++) { size_t i0 = i; size_t offset = start + (size_t)8U * i0; uint8_t uu____0[8U]; Result_15 dst; Eurydice_slice_to_array2( &dst, Eurydice_slice_subslice3(blocks, offset, offset + (size_t)8U, uint8_t *), Eurydice_slice, uint8_t[8U], TryFromSliceError); unwrap_26_68(dst, uu____0); state_flat[i0] = core_num__u64__from_le_bytes(uu____0); } for (size_t i = (size_t)0U; i < (size_t)104U / (size_t)8U; i++) { size_t i0 = i; libcrux_sha3_traits_set_ij_04( state, i0 / (size_t)5U, i0 % (size_t)5U, libcrux_sha3_traits_get_ij_04(state, i0 / (size_t)5U, i0 % (size_t)5U)[0U] ^ state_flat[i0]); } } /** This function found in impl {libcrux_sha3::traits::Absorb<1usize> for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} */ /** A monomorphic instance of libcrux_sha3.simd.portable.load_block_a1 with const generics - RATE= 104 */ static inline void libcrux_sha3_simd_portable_load_block_a1_7a( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *input, size_t start) { libcrux_sha3_simd_portable_load_block_7a(self->st, input[0U], start); } /** This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_block_80 with types uint64_t with const generics - N= 1 - RATE= 104 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_block_80_c62( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *blocks, size_t start) { libcrux_sha3_simd_portable_load_block_a1_7a(self, blocks, start); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); } /** A monomorphic instance of libcrux_sha3.simd.portable.load_last with const generics - RATE= 104 - DELIMITER= 6 */ static KRML_MUSTINLINE void libcrux_sha3_simd_portable_load_last_7c( uint64_t *state, Eurydice_slice blocks, size_t start, size_t len) { uint8_t buffer[104U] = {0U}; Eurydice_slice_copy( Eurydice_array_to_subslice3(buffer, (size_t)0U, len, uint8_t *), Eurydice_slice_subslice3(blocks, start, start + len, uint8_t *), uint8_t); buffer[len] = 6U; size_t uu____0 = (size_t)104U - (size_t)1U; buffer[uu____0] = (uint32_t)buffer[uu____0] | 128U; libcrux_sha3_simd_portable_load_block_7a( state, Eurydice_array_to_slice((size_t)104U, buffer, uint8_t), (size_t)0U); } /** This function found in impl {libcrux_sha3::traits::Absorb<1usize> for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} */ /** A monomorphic instance of libcrux_sha3.simd.portable.load_last_a1 with const generics - RATE= 104 - DELIMITER= 6 */ static inline void libcrux_sha3_simd_portable_load_last_a1_7c( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *input, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_7c(self->st, input[0U], start, len); } /** This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_final_80 with types uint64_t with const generics - N= 1 - RATE= 104 - DELIM= 6 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_final_80_9e4( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *last, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_a1_7c(self, last, start, len); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); } /** A monomorphic instance of libcrux_sha3.simd.portable.store_block with const generics - RATE= 104 */ static KRML_MUSTINLINE void libcrux_sha3_simd_portable_store_block_7a( uint64_t *s, Eurydice_slice out, size_t start, size_t len) { size_t octets = len / (size_t)8U; for (size_t i = (size_t)0U; i < octets; i++) { size_t i0 = i; Eurydice_slice uu____0 = Eurydice_slice_subslice3( out, start + (size_t)8U * i0, start + (size_t)8U * i0 + (size_t)8U, uint8_t *); uint8_t ret[8U]; core_num__u64__to_le_bytes( libcrux_sha3_traits_get_ij_04(s, i0 / (size_t)5U, i0 % (size_t)5U)[0U], ret); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)8U, ret, uint8_t), uint8_t); } size_t remaining = len % (size_t)8U; if (remaining > (size_t)0U) { Eurydice_slice uu____1 = Eurydice_slice_subslice3( out, start + len - remaining, start + len, uint8_t *); uint8_t ret[8U]; core_num__u64__to_le_bytes( libcrux_sha3_traits_get_ij_04(s, octets / (size_t)5U, octets % (size_t)5U)[0U], ret); Eurydice_slice_copy( uu____1, Eurydice_array_to_subslice3(ret, (size_t)0U, remaining, uint8_t *), uint8_t); } } /** This function found in impl {libcrux_sha3::traits::Squeeze1 for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} */ /** A monomorphic instance of libcrux_sha3.simd.portable.squeeze_13 with const generics - RATE= 104 */ static inline void libcrux_sha3_simd_portable_squeeze_13_7a( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice out, size_t start, size_t len) { libcrux_sha3_simd_portable_store_block_7a(self->st, out, start, len); } /** A monomorphic instance of libcrux_sha3.generic_keccak.portable.keccak1 with const generics - RATE= 104 - DELIM= 6 */ static inline void libcrux_sha3_generic_keccak_portable_keccak1_7c( Eurydice_slice data, Eurydice_slice out) { libcrux_sha3_generic_keccak_KeccakState_17 s = libcrux_sha3_generic_keccak_new_80_04(); size_t data_len = Eurydice_slice_len(data, uint8_t); for (size_t i = (size_t)0U; i < data_len / (size_t)104U; i++) { size_t i0 = i; Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_block_80_c62(&s, buf, i0 * (size_t)104U); } size_t rem = data_len % (size_t)104U; Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_final_80_9e4(&s, buf, data_len - rem, rem); size_t outlen = Eurydice_slice_len(out, uint8_t); size_t blocks = outlen / (size_t)104U; size_t last = outlen - outlen % (size_t)104U; if (blocks == (size_t)0U) { libcrux_sha3_simd_portable_squeeze_13_7a(&s, out, (size_t)0U, outlen); } else { libcrux_sha3_simd_portable_squeeze_13_7a(&s, out, (size_t)0U, (size_t)104U); for (size_t i = (size_t)1U; i < blocks; i++) { size_t i0 = i; libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_7a(&s, out, i0 * (size_t)104U, (size_t)104U); } if (last < outlen) { libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_7a(&s, out, last, outlen - last); } } } /** A portable SHA3 384 implementation. */ static KRML_MUSTINLINE void libcrux_sha3_portable_sha384(Eurydice_slice digest, Eurydice_slice data) { libcrux_sha3_generic_keccak_portable_keccak1_7c(data, digest); } /** SHA3 224 Preconditions: - `digest.len() == 28` */ static inline void libcrux_sha3_sha224_ema(Eurydice_slice digest, Eurydice_slice payload) { libcrux_sha3_portable_sha224(digest, payload); } /** SHA3 224 */ static inline void libcrux_sha3_sha224(Eurydice_slice data, uint8_t ret[28U]) { uint8_t out[28U] = {0U}; libcrux_sha3_sha224_ema(Eurydice_array_to_slice((size_t)28U, out, uint8_t), data); memcpy(ret, out, (size_t)28U * sizeof(uint8_t)); } /** SHA3 256 */ static inline void libcrux_sha3_sha256_ema(Eurydice_slice digest, Eurydice_slice payload) { libcrux_sha3_portable_sha256(digest, payload); } /** SHA3 256 */ static inline void libcrux_sha3_sha256(Eurydice_slice data, uint8_t ret[32U]) { uint8_t out[32U] = {0U}; libcrux_sha3_sha256_ema(Eurydice_array_to_slice((size_t)32U, out, uint8_t), data); memcpy(ret, out, (size_t)32U * sizeof(uint8_t)); } /** SHA3 384 */ static inline void libcrux_sha3_sha384_ema(Eurydice_slice digest, Eurydice_slice payload) { libcrux_sha3_portable_sha384(digest, payload); } /** SHA3 384 */ static inline void libcrux_sha3_sha384(Eurydice_slice data, uint8_t ret[48U]) { uint8_t out[48U] = {0U}; libcrux_sha3_sha384_ema(Eurydice_array_to_slice((size_t)48U, out, uint8_t), data); memcpy(ret, out, (size_t)48U * sizeof(uint8_t)); } /** SHA3 512 */ static inline void libcrux_sha3_sha512_ema(Eurydice_slice digest, Eurydice_slice payload) { libcrux_sha3_portable_sha512(digest, payload); } /** SHA3 512 */ static inline void libcrux_sha3_sha512(Eurydice_slice data, uint8_t ret[64U]) { uint8_t out[64U] = {0U}; libcrux_sha3_sha512_ema(Eurydice_array_to_slice((size_t)64U, out, uint8_t), data); memcpy(ret, out, (size_t)64U * sizeof(uint8_t)); } /** This function found in impl {libcrux_sha3::traits::Absorb<1usize> for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} */ /** A monomorphic instance of libcrux_sha3.simd.portable.load_block_a1 with const generics - RATE= 168 */ static inline void libcrux_sha3_simd_portable_load_block_a1_3a( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *input, size_t start) { libcrux_sha3_simd_portable_load_block_3a(self->st, input[0U], start); } /** This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_block_80 with types uint64_t with const generics - N= 1 - RATE= 168 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_block_80_c63( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *blocks, size_t start) { libcrux_sha3_simd_portable_load_block_a1_3a(self, blocks, start); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); } /** A monomorphic instance of libcrux_sha3.generic_keccak.portable.keccak1 with const generics - RATE= 168 - DELIM= 31 */ static inline void libcrux_sha3_generic_keccak_portable_keccak1_c6( Eurydice_slice data, Eurydice_slice out) { libcrux_sha3_generic_keccak_KeccakState_17 s = libcrux_sha3_generic_keccak_new_80_04(); size_t data_len = Eurydice_slice_len(data, uint8_t); for (size_t i = (size_t)0U; i < data_len / (size_t)168U; i++) { size_t i0 = i; Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_block_80_c63(&s, buf, i0 * (size_t)168U); } size_t rem = data_len % (size_t)168U; Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_final_80_9e2(&s, buf, data_len - rem, rem); size_t outlen = Eurydice_slice_len(out, uint8_t); size_t blocks = outlen / (size_t)168U; size_t last = outlen - outlen % (size_t)168U; if (blocks == (size_t)0U) { libcrux_sha3_simd_portable_squeeze_13_3a(&s, out, (size_t)0U, outlen); } else { libcrux_sha3_simd_portable_squeeze_13_3a(&s, out, (size_t)0U, (size_t)168U); for (size_t i = (size_t)1U; i < blocks; i++) { size_t i0 = i; libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_3a(&s, out, i0 * (size_t)168U, (size_t)168U); } if (last < outlen) { libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_3a(&s, out, last, outlen - last); } } } /** A portable SHAKE128 implementation. */ static KRML_MUSTINLINE void libcrux_sha3_portable_shake128( Eurydice_slice digest, Eurydice_slice data) { libcrux_sha3_generic_keccak_portable_keccak1_c6(data, digest); } /** SHAKE 128 Writes `out.len()` bytes. */ static inline void libcrux_sha3_shake128_ema(Eurydice_slice out, Eurydice_slice data) { libcrux_sha3_portable_shake128(out, data); } /** SHAKE 256 Writes `out.len()` bytes. */ static inline void libcrux_sha3_shake256_ema(Eurydice_slice out, Eurydice_slice data) { libcrux_sha3_portable_shake256(out, data); } /** This function found in impl {libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.portable.squeeze_first_five_blocks_b4 with const generics - RATE= 168 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_portable_squeeze_first_five_blocks_b4_3a( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice out) { libcrux_sha3_simd_portable_squeeze_13_3a(self, out, (size_t)0U, (size_t)168U); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); libcrux_sha3_simd_portable_squeeze_13_3a(self, out, (size_t)168U, (size_t)168U); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); libcrux_sha3_simd_portable_squeeze_13_3a(self, out, (size_t)2U * (size_t)168U, (size_t)168U); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); libcrux_sha3_simd_portable_squeeze_13_3a(self, out, (size_t)3U * (size_t)168U, (size_t)168U); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); libcrux_sha3_simd_portable_squeeze_13_3a(self, out, (size_t)4U * (size_t)168U, (size_t)168U); } /** Squeeze five blocks */ static KRML_MUSTINLINE void libcrux_sha3_portable_incremental_shake128_squeeze_first_five_blocks( libcrux_sha3_generic_keccak_KeccakState_17 *s, Eurydice_slice out0) { libcrux_sha3_generic_keccak_portable_squeeze_first_five_blocks_b4_3a(s, out0); } /** Absorb some data for SHAKE-256 for the last time */ static KRML_MUSTINLINE void libcrux_sha3_portable_incremental_shake256_absorb_final( libcrux_sha3_generic_keccak_KeccakState_17 *s, Eurydice_slice data) { libcrux_sha3_generic_keccak_KeccakState_17 *uu____0 = s; Eurydice_slice uu____1[1U] = {data}; libcrux_sha3_generic_keccak_absorb_final_80_9e1( uu____0, uu____1, (size_t)0U, Eurydice_slice_len(data, uint8_t)); } /** Create a new SHAKE-256 state object. */ static KRML_MUSTINLINE libcrux_sha3_generic_keccak_KeccakState_17 libcrux_sha3_portable_incremental_shake256_init(void) { return libcrux_sha3_generic_keccak_new_80_04(); } /** This function found in impl {libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.portable.squeeze_first_block_b4 with const generics - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_portable_squeeze_first_block_b4_5b( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice out) { libcrux_sha3_simd_portable_squeeze_13_5b(self, out, (size_t)0U, (size_t)136U); } /** Squeeze the first SHAKE-256 block */ static KRML_MUSTINLINE void libcrux_sha3_portable_incremental_shake256_squeeze_first_block( libcrux_sha3_generic_keccak_KeccakState_17 *s, Eurydice_slice out) { libcrux_sha3_generic_keccak_portable_squeeze_first_block_b4_5b(s, out); } /** This function found in impl {libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.portable.squeeze_next_block_b4 with const generics - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_portable_squeeze_next_block_b4_5b( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice out, size_t start) { libcrux_sha3_generic_keccak_keccakf1600_80_04(self); libcrux_sha3_simd_portable_squeeze_13_5b(self, out, start, (size_t)136U); } /** Squeeze the next SHAKE-256 block */ static KRML_MUSTINLINE void libcrux_sha3_portable_incremental_shake256_squeeze_next_block( libcrux_sha3_generic_keccak_KeccakState_17 *s, Eurydice_slice out) { libcrux_sha3_generic_keccak_portable_squeeze_next_block_b4_5b(s, out, (size_t)0U); } /** A monomorphic instance of libcrux_sha3.generic_keccak.xof.KeccakXofState with types uint64_t with const generics - $1size_t - $136size_t */ typedef struct libcrux_sha3_generic_keccak_xof_KeccakXofState_e2_s { libcrux_sha3_generic_keccak_KeccakState_17 inner; uint8_t buf[1U][136U]; size_t buf_len; bool sponge; } libcrux_sha3_generic_keccak_xof_KeccakXofState_e2; typedef libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 libcrux_sha3_portable_incremental_Shake256Xof; /** This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.xof.fill_buffer_35 with types uint64_t with const generics - PARALLEL_LANES= 1 - RATE= 136 */ static inline size_t libcrux_sha3_generic_keccak_xof_fill_buffer_35_c6( libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 *self, Eurydice_slice *inputs) { size_t input_len = Eurydice_slice_len(inputs[0U], uint8_t); size_t consumed = (size_t)0U; if (self->buf_len > (size_t)0U) { if (self->buf_len + input_len >= (size_t)136U) { consumed = (size_t)136U - self->buf_len; for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; Eurydice_slice uu____0 = Eurydice_array_to_subslice_from( (size_t)136U, self->buf[i0], self->buf_len, uint8_t, size_t, uint8_t[]); Eurydice_slice_copy( uu____0, Eurydice_slice_subslice_to(inputs[i0], consumed, uint8_t, size_t, uint8_t[]), uint8_t); } self->buf_len = self->buf_len + consumed; } } return consumed; } /** This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.xof.absorb_full_35 with types uint64_t with const generics - PARALLEL_LANES= 1 - RATE= 136 */ static inline size_t libcrux_sha3_generic_keccak_xof_absorb_full_35_c6( libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 *self, Eurydice_slice *inputs) { size_t input_consumed = libcrux_sha3_generic_keccak_xof_fill_buffer_35_c6(self, inputs); if (input_consumed > (size_t)0U) { Eurydice_slice borrowed[1U]; for (size_t i = (size_t)0U; i < (size_t)1U; i++) { uint8_t buf[136U] = {0U}; borrowed[i] = core_array___Array_T__N___as_slice((size_t)136U, buf, uint8_t, Eurydice_slice); } for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; borrowed[i0] = Eurydice_array_to_slice((size_t)136U, self->buf[i0], uint8_t); } libcrux_sha3_simd_portable_load_block_a1_5b(&self->inner, borrowed, (size_t)0U); libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); self->buf_len = (size_t)0U; } size_t input_to_consume = Eurydice_slice_len(inputs[0U], uint8_t) - input_consumed; size_t num_blocks = input_to_consume / (size_t)136U; size_t remainder = input_to_consume % (size_t)136U; for (size_t i = (size_t)0U; i < num_blocks; i++) { size_t i0 = i; libcrux_sha3_simd_portable_load_block_a1_5b( &self->inner, inputs, input_consumed + i0 * (size_t)136U); libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); } return remainder; } /** This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.xof.absorb_35 with types uint64_t with const generics - PARALLEL_LANES= 1 - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_xof_absorb_35_c6( libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 *self, Eurydice_slice *inputs) { size_t input_remainder_len = libcrux_sha3_generic_keccak_xof_absorb_full_35_c6(self, inputs); if (input_remainder_len > (size_t)0U) { size_t input_len = Eurydice_slice_len(inputs[0U], uint8_t); for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; Eurydice_slice_copy(Eurydice_array_to_subslice3( self->buf[i0], self->buf_len, self->buf_len + input_remainder_len, uint8_t *), Eurydice_slice_subslice_from( inputs[i0], input_len - input_remainder_len, uint8_t, size_t, uint8_t[]), uint8_t); } self->buf_len = self->buf_len + input_remainder_len; } } /** Shake256 absorb */ /** This function found in impl {libcrux_sha3::portable::incremental::Xof<136usize> for libcrux_sha3::portable::incremental::Shake256Xof} */ static inline void libcrux_sha3_portable_incremental_absorb_42( libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 *self, Eurydice_slice input) { Eurydice_slice buf[1U] = {input}; libcrux_sha3_generic_keccak_xof_absorb_35_c6(self, buf); } /** This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.xof.absorb_final_35 with types uint64_t with const generics - PARALLEL_LANES= 1 - RATE= 136 - DELIMITER= 31 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_xof_absorb_final_35_9e( libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 *self, Eurydice_slice *inputs) { libcrux_sha3_generic_keccak_xof_absorb_35_c6(self, inputs); Eurydice_slice borrowed[1U]; for (size_t i = (size_t)0U; i < (size_t)1U; i++) { uint8_t buf[136U] = {0U}; borrowed[i] = core_array___Array_T__N___as_slice((size_t)136U, buf, uint8_t, Eurydice_slice); } for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; borrowed[i0] = Eurydice_array_to_slice((size_t)136U, self->buf[i0], uint8_t); } libcrux_sha3_simd_portable_load_last_a1_ad0(&self->inner, borrowed, (size_t)0U, self->buf_len); libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); } /** Shake256 absorb final */ /** This function found in impl {libcrux_sha3::portable::incremental::Xof<136usize> for libcrux_sha3::portable::incremental::Shake256Xof} */ static inline void libcrux_sha3_portable_incremental_absorb_final_42( libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 *self, Eurydice_slice input) { Eurydice_slice buf[1U] = {input}; libcrux_sha3_generic_keccak_xof_absorb_final_35_9e(self, buf); } /** This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.xof.zero_block_35 with types uint64_t with const generics - PARALLEL_LANES= 1 - RATE= 136 */ static inline void libcrux_sha3_generic_keccak_xof_zero_block_35_c6( uint8_t ret[136U]) { memset(ret, 0U, 136U * sizeof(uint8_t)); } /** This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.xof.new_35 with types uint64_t with const generics - PARALLEL_LANES= 1 - RATE= 136 */ static inline libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 libcrux_sha3_generic_keccak_xof_new_35_c6(void) { libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 lit; lit.inner = libcrux_sha3_generic_keccak_new_80_04(); uint8_t repeat_expression[1U][136U]; for (size_t i = (size_t)0U; i < (size_t)1U; i++) { libcrux_sha3_generic_keccak_xof_zero_block_35_c6(repeat_expression[i]); } memcpy(lit.buf, repeat_expression, (size_t)1U * sizeof(uint8_t[136U])); lit.buf_len = (size_t)0U; lit.sponge = false; return lit; } /** Shake256 new state */ /** This function found in impl {libcrux_sha3::portable::incremental::Xof<136usize> for libcrux_sha3::portable::incremental::Shake256Xof} */ static inline libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 libcrux_sha3_portable_incremental_new_42(void) { return libcrux_sha3_generic_keccak_xof_new_35_c6(); } /** Squeeze `N` x `LEN` bytes. Only `N = 1` for now. */ /** This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.xof.squeeze_85 with types uint64_t with const generics - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_xof_squeeze_85_c7( libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 *self, Eurydice_slice out) { if (self->sponge) { libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); } size_t out_len = Eurydice_slice_len(out, uint8_t); if (out_len > (size_t)0U) { if (out_len <= (size_t)136U) { libcrux_sha3_simd_portable_squeeze_13_5b(&self->inner, out, (size_t)0U, out_len); } else { size_t blocks = out_len / (size_t)136U; for (size_t i = (size_t)0U; i < blocks; i++) { size_t i0 = i; libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); libcrux_sha3_simd_portable_squeeze_13_5b( &self->inner, out, i0 * (size_t)136U, (size_t)136U); } size_t remaining = out_len % (size_t)136U; if (remaining > (size_t)0U) { libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); libcrux_sha3_simd_portable_squeeze_13_5b( &self->inner, out, blocks * (size_t)136U, remaining); } } self->sponge = true; } } /** Shake256 squeeze */ /** This function found in impl {libcrux_sha3::portable::incremental::Xof<136usize> for libcrux_sha3::portable::incremental::Shake256Xof} */ static inline void libcrux_sha3_portable_incremental_squeeze_42( libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 *self, Eurydice_slice out) { libcrux_sha3_generic_keccak_xof_squeeze_85_c7(self, out); } /** A monomorphic instance of libcrux_sha3.generic_keccak.xof.KeccakXofState with types uint64_t with const generics - $1size_t - $168size_t */ typedef struct libcrux_sha3_generic_keccak_xof_KeccakXofState_97_s { libcrux_sha3_generic_keccak_KeccakState_17 inner; uint8_t buf[1U][168U]; size_t buf_len; bool sponge; } libcrux_sha3_generic_keccak_xof_KeccakXofState_97; typedef libcrux_sha3_generic_keccak_xof_KeccakXofState_97 libcrux_sha3_portable_incremental_Shake128Xof; /** This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.xof.fill_buffer_35 with types uint64_t with const generics - PARALLEL_LANES= 1 - RATE= 168 */ static inline size_t libcrux_sha3_generic_keccak_xof_fill_buffer_35_c60( libcrux_sha3_generic_keccak_xof_KeccakXofState_97 *self, Eurydice_slice *inputs) { size_t input_len = Eurydice_slice_len(inputs[0U], uint8_t); size_t consumed = (size_t)0U; if (self->buf_len > (size_t)0U) { if (self->buf_len + input_len >= (size_t)168U) { consumed = (size_t)168U - self->buf_len; for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; Eurydice_slice uu____0 = Eurydice_array_to_subslice_from( (size_t)168U, self->buf[i0], self->buf_len, uint8_t, size_t, uint8_t[]); Eurydice_slice_copy( uu____0, Eurydice_slice_subslice_to(inputs[i0], consumed, uint8_t, size_t, uint8_t[]), uint8_t); } self->buf_len = self->buf_len + consumed; } } return consumed; } /** This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.xof.absorb_full_35 with types uint64_t with const generics - PARALLEL_LANES= 1 - RATE= 168 */ static inline size_t libcrux_sha3_generic_keccak_xof_absorb_full_35_c60( libcrux_sha3_generic_keccak_xof_KeccakXofState_97 *self, Eurydice_slice *inputs) { size_t input_consumed = libcrux_sha3_generic_keccak_xof_fill_buffer_35_c60(self, inputs); if (input_consumed > (size_t)0U) { Eurydice_slice borrowed[1U]; for (size_t i = (size_t)0U; i < (size_t)1U; i++) { uint8_t buf[168U] = {0U}; borrowed[i] = core_array___Array_T__N___as_slice((size_t)168U, buf, uint8_t, Eurydice_slice); } for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; borrowed[i0] = Eurydice_array_to_slice((size_t)168U, self->buf[i0], uint8_t); } libcrux_sha3_simd_portable_load_block_a1_3a(&self->inner, borrowed, (size_t)0U); libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); self->buf_len = (size_t)0U; } size_t input_to_consume = Eurydice_slice_len(inputs[0U], uint8_t) - input_consumed; size_t num_blocks = input_to_consume / (size_t)168U; size_t remainder = input_to_consume % (size_t)168U; for (size_t i = (size_t)0U; i < num_blocks; i++) { size_t i0 = i; libcrux_sha3_simd_portable_load_block_a1_3a( &self->inner, inputs, input_consumed + i0 * (size_t)168U); libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); } return remainder; } /** This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.xof.absorb_35 with types uint64_t with const generics - PARALLEL_LANES= 1 - RATE= 168 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_xof_absorb_35_c60( libcrux_sha3_generic_keccak_xof_KeccakXofState_97 *self, Eurydice_slice *inputs) { size_t input_remainder_len = libcrux_sha3_generic_keccak_xof_absorb_full_35_c60(self, inputs); if (input_remainder_len > (size_t)0U) { size_t input_len = Eurydice_slice_len(inputs[0U], uint8_t); for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; Eurydice_slice_copy(Eurydice_array_to_subslice3( self->buf[i0], self->buf_len, self->buf_len + input_remainder_len, uint8_t *), Eurydice_slice_subslice_from( inputs[i0], input_len - input_remainder_len, uint8_t, size_t, uint8_t[]), uint8_t); } self->buf_len = self->buf_len + input_remainder_len; } } /** This function found in impl {libcrux_sha3::portable::incremental::Xof<168usize> for libcrux_sha3::portable::incremental::Shake128Xof} */ static inline void libcrux_sha3_portable_incremental_absorb_26( libcrux_sha3_generic_keccak_xof_KeccakXofState_97 *self, Eurydice_slice input) { Eurydice_slice buf[1U] = {input}; libcrux_sha3_generic_keccak_xof_absorb_35_c60(self, buf); } /** This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.xof.absorb_final_35 with types uint64_t with const generics - PARALLEL_LANES= 1 - RATE= 168 - DELIMITER= 31 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_xof_absorb_final_35_9e0( libcrux_sha3_generic_keccak_xof_KeccakXofState_97 *self, Eurydice_slice *inputs) { libcrux_sha3_generic_keccak_xof_absorb_35_c60(self, inputs); Eurydice_slice borrowed[1U]; for (size_t i = (size_t)0U; i < (size_t)1U; i++) { uint8_t buf[168U] = {0U}; borrowed[i] = core_array___Array_T__N___as_slice((size_t)168U, buf, uint8_t, Eurydice_slice); } for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; borrowed[i0] = Eurydice_array_to_slice((size_t)168U, self->buf[i0], uint8_t); } libcrux_sha3_simd_portable_load_last_a1_c6(&self->inner, borrowed, (size_t)0U, self->buf_len); libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); } /** This function found in impl {libcrux_sha3::portable::incremental::Xof<168usize> for libcrux_sha3::portable::incremental::Shake128Xof} */ static inline void libcrux_sha3_portable_incremental_absorb_final_26( libcrux_sha3_generic_keccak_xof_KeccakXofState_97 *self, Eurydice_slice input) { Eurydice_slice buf[1U] = {input}; libcrux_sha3_generic_keccak_xof_absorb_final_35_9e0(self, buf); } /** This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.xof.zero_block_35 with types uint64_t with const generics - PARALLEL_LANES= 1 - RATE= 168 */ static inline void libcrux_sha3_generic_keccak_xof_zero_block_35_c60( uint8_t ret[168U]) { memset(ret, 0U, 168U * sizeof(uint8_t)); } /** This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.xof.new_35 with types uint64_t with const generics - PARALLEL_LANES= 1 - RATE= 168 */ static inline libcrux_sha3_generic_keccak_xof_KeccakXofState_97 libcrux_sha3_generic_keccak_xof_new_35_c60(void) { libcrux_sha3_generic_keccak_xof_KeccakXofState_97 lit; lit.inner = libcrux_sha3_generic_keccak_new_80_04(); uint8_t repeat_expression[1U][168U]; for (size_t i = (size_t)0U; i < (size_t)1U; i++) { libcrux_sha3_generic_keccak_xof_zero_block_35_c60(repeat_expression[i]); } memcpy(lit.buf, repeat_expression, (size_t)1U * sizeof(uint8_t[168U])); lit.buf_len = (size_t)0U; lit.sponge = false; return lit; } /** This function found in impl {libcrux_sha3::portable::incremental::Xof<168usize> for libcrux_sha3::portable::incremental::Shake128Xof} */ static inline libcrux_sha3_generic_keccak_xof_KeccakXofState_97 libcrux_sha3_portable_incremental_new_26(void) { return libcrux_sha3_generic_keccak_xof_new_35_c60(); } /** Squeeze `N` x `LEN` bytes. Only `N = 1` for now. */ /** This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.xof.squeeze_85 with types uint64_t with const generics - RATE= 168 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_xof_squeeze_85_13( libcrux_sha3_generic_keccak_xof_KeccakXofState_97 *self, Eurydice_slice out) { if (self->sponge) { libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); } size_t out_len = Eurydice_slice_len(out, uint8_t); if (out_len > (size_t)0U) { if (out_len <= (size_t)168U) { libcrux_sha3_simd_portable_squeeze_13_3a(&self->inner, out, (size_t)0U, out_len); } else { size_t blocks = out_len / (size_t)168U; for (size_t i = (size_t)0U; i < blocks; i++) { size_t i0 = i; libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); libcrux_sha3_simd_portable_squeeze_13_3a( &self->inner, out, i0 * (size_t)168U, (size_t)168U); } size_t remaining = out_len % (size_t)168U; if (remaining > (size_t)0U) { libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); libcrux_sha3_simd_portable_squeeze_13_3a( &self->inner, out, blocks * (size_t)168U, remaining); } } self->sponge = true; } } /** Shake128 squeeze */ /** This function found in impl {libcrux_sha3::portable::incremental::Xof<168usize> for libcrux_sha3::portable::incremental::Shake128Xof} */ static inline void libcrux_sha3_portable_incremental_squeeze_26( libcrux_sha3_generic_keccak_xof_KeccakXofState_97 *self, Eurydice_slice out) { libcrux_sha3_generic_keccak_xof_squeeze_85_13(self, out); } /** This function found in impl {core::clone::Clone for libcrux_sha3::portable::KeccakState} */ static inline libcrux_sha3_generic_keccak_KeccakState_17 libcrux_sha3_portable_clone_fe( libcrux_sha3_generic_keccak_KeccakState_17 *self) { return self[0U]; } /** This function found in impl {core::convert::From for u32} */ static inline uint32_t libcrux_sha3_from_6c(libcrux_sha3_Algorithm v) { switch (v) { case libcrux_sha3_Algorithm_Sha224: { break; } case libcrux_sha3_Algorithm_Sha256: { return 2U; } case libcrux_sha3_Algorithm_Sha384: { return 3U; } case libcrux_sha3_Algorithm_Sha512: { return 4U; } default: { KRML_HOST_EPRINTF("KaRaMeL incomplete match at %s:%d\n", __FILE__, __LINE__); KRML_HOST_EXIT(253U); } } return 1U; } /** This function found in impl {core::convert::From for libcrux_sha3::Algorithm} */ static inline libcrux_sha3_Algorithm libcrux_sha3_from_29(uint32_t v) { switch (v) { case 1U: { break; } case 2U: { return libcrux_sha3_Algorithm_Sha256; } case 3U: { return libcrux_sha3_Algorithm_Sha384; } case 4U: { return libcrux_sha3_Algorithm_Sha512; } default: { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "panic!"); KRML_HOST_EXIT(255U); } } return libcrux_sha3_Algorithm_Sha224; } #if defined(__cplusplus) } #endif #define libcrux_sha3_portable_H_DEFINED #endif /* libcrux_sha3_portable_H */ /* from libcrux/libcrux-ml-kem/extracts/c_header_only/generated/libcrux_mlkem768_portable.h */ /* * SPDX-FileCopyrightText: 2025 Cryspen Sarl * * SPDX-License-Identifier: MIT or Apache-2.0 * * This code was generated with the following revisions: * Charon: 667d2fc98984ff7f3df989c2367e6c1fa4a000e7 * Eurydice: 2381cbc416ef2ad0b561c362c500bc84f36b6785 * Karamel: 80f5435f2fc505973c469a4afcc8d875cddd0d8b * F*: 71d8221589d4d438af3706d89cb653cf53e18aab * Libcrux: 68dfed5a4a9e40277f62828471c029afed1ecdcc */ #ifndef libcrux_mlkem768_portable_H #define libcrux_mlkem768_portable_H #if defined(__cplusplus) extern "C" { #endif static inline void libcrux_ml_kem_hash_functions_portable_G( Eurydice_slice input, uint8_t ret[64U]) { uint8_t digest[64U] = {0U}; libcrux_sha3_portable_sha512( Eurydice_array_to_slice((size_t)64U, digest, uint8_t), input); memcpy(ret, digest, (size_t)64U * sizeof(uint8_t)); } static inline void libcrux_ml_kem_hash_functions_portable_H( Eurydice_slice input, uint8_t ret[32U]) { uint8_t digest[32U] = {0U}; libcrux_sha3_portable_sha256( Eurydice_array_to_slice((size_t)32U, digest, uint8_t), input); memcpy(ret, digest, (size_t)32U * sizeof(uint8_t)); } static const int16_t libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[128U] = {(int16_t)-1044, (int16_t)-758, (int16_t)-359, (int16_t)-1517, (int16_t)1493, (int16_t)1422, (int16_t)287, (int16_t)202, (int16_t)-171, (int16_t)622, (int16_t)1577, (int16_t)182, (int16_t)962, (int16_t)-1202, (int16_t)-1474, (int16_t)1468, (int16_t)573, (int16_t)-1325, (int16_t)264, (int16_t)383, (int16_t)-829, (int16_t)1458, (int16_t)-1602, (int16_t)-130, (int16_t)-681, (int16_t)1017, (int16_t)732, (int16_t)608, (int16_t)-1542, (int16_t)411, (int16_t)-205, (int16_t)-1571, (int16_t)1223, (int16_t)652, (int16_t)-552, (int16_t)1015, (int16_t)-1293, (int16_t)1491, (int16_t)-282, (int16_t)-1544, (int16_t)516, (int16_t)-8, (int16_t)-320, (int16_t)-666, (int16_t)-1618, (int16_t)-1162, (int16_t)126, (int16_t)1469, (int16_t)-853, (int16_t)-90, (int16_t)-271, (int16_t)830, (int16_t)107, (int16_t)-1421, (int16_t)-247, (int16_t)-951, (int16_t)-398, (int16_t)961, (int16_t)-1508, (int16_t)-725, (int16_t)448, (int16_t)-1065, (int16_t)677, (int16_t)-1275, (int16_t)-1103, (int16_t)430, (int16_t)555, (int16_t)843, (int16_t)-1251, (int16_t)871, (int16_t)1550, (int16_t)105, (int16_t)422, (int16_t)587, (int16_t)177, (int16_t)-235, (int16_t)-291, (int16_t)-460, (int16_t)1574, (int16_t)1653, (int16_t)-246, (int16_t)778, (int16_t)1159, (int16_t)-147, (int16_t)-777, (int16_t)1483, (int16_t)-602, (int16_t)1119, (int16_t)-1590, (int16_t)644, (int16_t)-872, (int16_t)349, (int16_t)418, (int16_t)329, (int16_t)-156, (int16_t)-75, (int16_t)817, (int16_t)1097, (int16_t)603, (int16_t)610, (int16_t)1322, (int16_t)-1285, (int16_t)-1465, (int16_t)384, (int16_t)-1215, (int16_t)-136, (int16_t)1218, (int16_t)-1335, (int16_t)-874, (int16_t)220, (int16_t)-1187, (int16_t)-1659, (int16_t)-1185, (int16_t)-1530, (int16_t)-1278, (int16_t)794, (int16_t)-1510, (int16_t)-854, (int16_t)-870, (int16_t)478, (int16_t)-108, (int16_t)-308, (int16_t)996, (int16_t)991, (int16_t)958, (int16_t)-1460, (int16_t)1522, (int16_t)1628}; static KRML_MUSTINLINE int16_t libcrux_ml_kem_polynomial_zeta(size_t i) { return libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[i]; } #define LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT ((size_t)16U) #define LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR ((size_t)16U) #define LIBCRUX_ML_KEM_VECTOR_TRAITS_MONTGOMERY_R_SQUARED_MOD_FIELD_MODULUS \ ((int16_t)1353) #define LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS ((int16_t)3329) #define LIBCRUX_ML_KEM_VECTOR_TRAITS_INVERSE_OF_MODULUS_MOD_MONTGOMERY_R \ (62209U) typedef struct libcrux_ml_kem_vector_portable_vector_type_PortableVector_s { int16_t elements[16U]; } libcrux_ml_kem_vector_portable_vector_type_PortableVector; static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_vector_type_from_i16_array( Eurydice_slice array) { libcrux_ml_kem_vector_portable_vector_type_PortableVector lit; int16_t ret[16U]; Result_0a dst; Eurydice_slice_to_array2( &dst, Eurydice_slice_subslice3(array, (size_t)0U, (size_t)16U, int16_t *), Eurydice_slice, int16_t[16U], TryFromSliceError); unwrap_26_00(dst, ret); memcpy(lit.elements, ret, (size_t)16U * sizeof(int16_t)); return lit; } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_from_i16_array_b8(Eurydice_slice array) { return libcrux_ml_kem_vector_portable_vector_type_from_i16_array( libcrux_secrets_int_classify_public_classify_ref_9b_39(array)); } typedef struct int16_t_x8_s { int16_t fst; int16_t snd; int16_t thd; int16_t f3; int16_t f4; int16_t f5; int16_t f6; int16_t f7; } int16_t_x8; static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_vector_type_zero(void) { libcrux_ml_kem_vector_portable_vector_type_PortableVector lit; int16_t ret[16U]; int16_t buf[16U] = {0U}; libcrux_secrets_int_public_integers_classify_27_46(buf, ret); memcpy(lit.elements, ret, (size_t)16U * sizeof(int16_t)); return lit; } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_ZERO_b8(void) { return libcrux_ml_kem_vector_portable_vector_type_zero(); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_arithmetic_add( libcrux_ml_kem_vector_portable_vector_type_PortableVector lhs, libcrux_ml_kem_vector_portable_vector_type_PortableVector *rhs) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; size_t uu____0 = i0; lhs.elements[uu____0] = lhs.elements[uu____0] + rhs->elements[i0]; } return lhs; } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_add_b8( libcrux_ml_kem_vector_portable_vector_type_PortableVector lhs, libcrux_ml_kem_vector_portable_vector_type_PortableVector *rhs) { return libcrux_ml_kem_vector_portable_arithmetic_add(lhs, rhs); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_arithmetic_sub( libcrux_ml_kem_vector_portable_vector_type_PortableVector lhs, libcrux_ml_kem_vector_portable_vector_type_PortableVector *rhs) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; size_t uu____0 = i0; lhs.elements[uu____0] = lhs.elements[uu____0] - rhs->elements[i0]; } return lhs; } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_sub_b8( libcrux_ml_kem_vector_portable_vector_type_PortableVector lhs, libcrux_ml_kem_vector_portable_vector_type_PortableVector *rhs) { return libcrux_ml_kem_vector_portable_arithmetic_sub(lhs, rhs); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_arithmetic_multiply_by_constant( libcrux_ml_kem_vector_portable_vector_type_PortableVector vec, int16_t c) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; size_t uu____0 = i0; vec.elements[uu____0] = vec.elements[uu____0] * c; } return vec; } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_multiply_by_constant_b8( libcrux_ml_kem_vector_portable_vector_type_PortableVector vec, int16_t c) { return libcrux_ml_kem_vector_portable_arithmetic_multiply_by_constant(vec, c); } /** Note: This function is not secret independent Only use with public values. */ static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_arithmetic_cond_subtract_3329( libcrux_ml_kem_vector_portable_vector_type_PortableVector vec) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; if (libcrux_secrets_int_public_integers_declassify_d8_39( vec.elements[i0]) >= (int16_t)3329) { size_t uu____0 = i0; vec.elements[uu____0] = vec.elements[uu____0] - (int16_t)3329; } } return vec; } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_cond_subtract_3329_b8( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { return libcrux_ml_kem_vector_portable_arithmetic_cond_subtract_3329(v); } #define LIBCRUX_ML_KEM_VECTOR_PORTABLE_ARITHMETIC_BARRETT_MULTIPLIER \ ((int32_t)20159) #define LIBCRUX_ML_KEM_VECTOR_TRAITS_BARRETT_SHIFT ((int32_t)26) #define LIBCRUX_ML_KEM_VECTOR_TRAITS_BARRETT_R \ ((int32_t)1 << (uint32_t)LIBCRUX_ML_KEM_VECTOR_TRAITS_BARRETT_SHIFT) /** Signed Barrett Reduction Given an input `value`, `barrett_reduce` outputs a representative `result` such that: - result ≡ value (mod FIELD_MODULUS) - the absolute value of `result` is bound as follows: `|result| ≤ FIELD_MODULUS / 2 · (|value|/BARRETT_R + 1) Note: The input bound is 28296 to prevent overflow in the multiplication of quotient by FIELD_MODULUS */ static inline int16_t libcrux_ml_kem_vector_portable_arithmetic_barrett_reduce_element( int16_t value) { int32_t t = libcrux_secrets_int_as_i32_f5(value) * LIBCRUX_ML_KEM_VECTOR_PORTABLE_ARITHMETIC_BARRETT_MULTIPLIER + (LIBCRUX_ML_KEM_VECTOR_TRAITS_BARRETT_R >> 1U); int16_t quotient = libcrux_secrets_int_as_i16_36( t >> (uint32_t)LIBCRUX_ML_KEM_VECTOR_TRAITS_BARRETT_SHIFT); return value - quotient * LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS; } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_arithmetic_barrett_reduce( libcrux_ml_kem_vector_portable_vector_type_PortableVector vec) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; int16_t vi = libcrux_ml_kem_vector_portable_arithmetic_barrett_reduce_element( vec.elements[i0]); vec.elements[i0] = vi; } return vec; } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_barrett_reduce_b8( libcrux_ml_kem_vector_portable_vector_type_PortableVector vector) { return libcrux_ml_kem_vector_portable_arithmetic_barrett_reduce(vector); } #define LIBCRUX_ML_KEM_VECTOR_PORTABLE_ARITHMETIC_MONTGOMERY_SHIFT (16U) /** Signed Montgomery Reduction Given an input `value`, `montgomery_reduce` outputs a representative `o` such that: - o ≡ value · MONTGOMERY_R^(-1) (mod FIELD_MODULUS) - the absolute value of `o` is bound as follows: `|result| ≤ ceil(|value| / MONTGOMERY_R) + 1665 In particular, if `|value| ≤ FIELD_MODULUS-1 * FIELD_MODULUS-1`, then `|o| <= FIELD_MODULUS-1`. And, if `|value| ≤ pow2 16 * FIELD_MODULUS-1`, then `|o| <= FIELD_MODULUS + 1664 */ static inline int16_t libcrux_ml_kem_vector_portable_arithmetic_montgomery_reduce_element( int32_t value) { int32_t k = libcrux_secrets_int_as_i32_f5(libcrux_secrets_int_as_i16_36(value)) * libcrux_secrets_int_as_i32_b8( libcrux_secrets_int_public_integers_classify_27_df( LIBCRUX_ML_KEM_VECTOR_TRAITS_INVERSE_OF_MODULUS_MOD_MONTGOMERY_R)); int32_t k_times_modulus = libcrux_secrets_int_as_i32_f5(libcrux_secrets_int_as_i16_36(k)) * libcrux_secrets_int_as_i32_f5( libcrux_secrets_int_public_integers_classify_27_39( LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS)); int16_t c = libcrux_secrets_int_as_i16_36( k_times_modulus >> (uint32_t)LIBCRUX_ML_KEM_VECTOR_PORTABLE_ARITHMETIC_MONTGOMERY_SHIFT); int16_t value_high = libcrux_secrets_int_as_i16_36( value >> (uint32_t)LIBCRUX_ML_KEM_VECTOR_PORTABLE_ARITHMETIC_MONTGOMERY_SHIFT); return value_high - c; } /** If `fe` is some field element 'x' of the Kyber field and `fer` is congruent to `y · MONTGOMERY_R`, this procedure outputs a value that is congruent to `x · y`, as follows: `fe · fer ≡ x · y · MONTGOMERY_R (mod FIELD_MODULUS)` `montgomery_reduce` takes the value `x · y · MONTGOMERY_R` and outputs a representative `x · y · MONTGOMERY_R * MONTGOMERY_R^{-1} ≡ x · y (mod FIELD_MODULUS)`. */ static KRML_MUSTINLINE int16_t libcrux_ml_kem_vector_portable_arithmetic_montgomery_multiply_fe_by_fer( int16_t fe, int16_t fer) { int32_t product = libcrux_secrets_int_as_i32_f5(fe) * libcrux_secrets_int_as_i32_f5(fer); return libcrux_ml_kem_vector_portable_arithmetic_montgomery_reduce_element( product); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_arithmetic_montgomery_multiply_by_constant( libcrux_ml_kem_vector_portable_vector_type_PortableVector vec, int16_t c) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; vec.elements[i0] = libcrux_ml_kem_vector_portable_arithmetic_montgomery_multiply_fe_by_fer( vec.elements[i0], c); } return vec; } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_montgomery_multiply_by_constant_b8( libcrux_ml_kem_vector_portable_vector_type_PortableVector vector, int16_t constant) { return libcrux_ml_kem_vector_portable_arithmetic_montgomery_multiply_by_constant( vector, libcrux_secrets_int_public_integers_classify_27_39(constant)); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_arithmetic_bitwise_and_with_constant( libcrux_ml_kem_vector_portable_vector_type_PortableVector vec, int16_t c) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; size_t uu____0 = i0; vec.elements[uu____0] = vec.elements[uu____0] & c; } return vec; } /** A monomorphic instance of libcrux_ml_kem.vector.portable.arithmetic.shift_right with const generics - SHIFT_BY= 15 */ static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_arithmetic_shift_right_ef( libcrux_ml_kem_vector_portable_vector_type_PortableVector vec) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; vec.elements[i0] = vec.elements[i0] >> (uint32_t)(int32_t)15; } return vec; } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_arithmetic_to_unsigned_representative( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { libcrux_ml_kem_vector_portable_vector_type_PortableVector t = libcrux_ml_kem_vector_portable_arithmetic_shift_right_ef(a); libcrux_ml_kem_vector_portable_vector_type_PortableVector fm = libcrux_ml_kem_vector_portable_arithmetic_bitwise_and_with_constant( t, LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS); return libcrux_ml_kem_vector_portable_arithmetic_add(a, &fm); } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_to_unsigned_representative_b8( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { return libcrux_ml_kem_vector_portable_arithmetic_to_unsigned_representative( a); } /** The `compress_*` functions implement the `Compress` function specified in the NIST FIPS 203 standard (Page 18, Expression 4.5), which is defined as: ```plaintext Compress_d: ℤq -> ℤ_{2ᵈ} Compress_d(x) = ⌈(2ᵈ/q)·x⌋ ``` Since `⌈x⌋ = ⌊x + 1/2⌋` we have: ```plaintext Compress_d(x) = ⌊(2ᵈ/q)·x + 1/2⌋ = ⌊(2^{d+1}·x + q) / 2q⌋ ``` For further information about the function implementations, consult the `implementation_notes.pdf` document in this directory. The NIST FIPS 203 standard can be found at . */ static inline uint8_t libcrux_ml_kem_vector_portable_compress_compress_message_coefficient( uint16_t fe) { int16_t shifted = libcrux_secrets_int_public_integers_classify_27_39((int16_t)1664) - libcrux_secrets_int_as_i16_ca(fe); int16_t mask = shifted >> 15U; int16_t shifted_to_positive = mask ^ shifted; int16_t shifted_positive_in_range = shifted_to_positive - (int16_t)832; int16_t r0 = shifted_positive_in_range >> 15U; int16_t r1 = r0 & (int16_t)1; return libcrux_secrets_int_as_u8_f5(r1); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_compress_compress_1( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; a.elements[i0] = libcrux_secrets_int_as_i16_59( libcrux_ml_kem_vector_portable_compress_compress_message_coefficient( libcrux_secrets_int_as_u16_f5(a.elements[i0]))); } return a; } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_compress_1_b8( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { return libcrux_ml_kem_vector_portable_compress_compress_1(a); } static KRML_MUSTINLINE uint32_t libcrux_ml_kem_vector_portable_arithmetic_get_n_least_significant_bits( uint8_t n, uint32_t value) { return value & ((1U << (uint32_t)n) - 1U); } static inline int16_t libcrux_ml_kem_vector_portable_compress_compress_ciphertext_coefficient( uint8_t coefficient_bits, uint16_t fe) { uint64_t compressed = libcrux_secrets_int_as_u64_ca(fe) << (uint32_t)coefficient_bits; compressed = compressed + 1664ULL; compressed = compressed * 10321340ULL; compressed = compressed >> 35U; return libcrux_secrets_int_as_i16_b8( libcrux_ml_kem_vector_portable_arithmetic_get_n_least_significant_bits( coefficient_bits, libcrux_secrets_int_as_u32_a3(compressed))); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_compress_decompress_1( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { libcrux_ml_kem_vector_portable_vector_type_PortableVector z = libcrux_ml_kem_vector_portable_vector_type_zero(); libcrux_ml_kem_vector_portable_vector_type_PortableVector s = libcrux_ml_kem_vector_portable_arithmetic_sub(z, &a); libcrux_ml_kem_vector_portable_vector_type_PortableVector res = libcrux_ml_kem_vector_portable_arithmetic_bitwise_and_with_constant( s, (int16_t)1665); return res; } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_decompress_1_b8( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { return libcrux_ml_kem_vector_portable_compress_decompress_1(a); } static KRML_MUSTINLINE void libcrux_ml_kem_vector_portable_ntt_ntt_step( libcrux_ml_kem_vector_portable_vector_type_PortableVector *vec, int16_t zeta, size_t i, size_t j) { int16_t t = libcrux_ml_kem_vector_portable_arithmetic_montgomery_multiply_fe_by_fer( vec->elements[j], libcrux_secrets_int_public_integers_classify_27_39(zeta)); int16_t a_minus_t = vec->elements[i] - t; int16_t a_plus_t = vec->elements[i] + t; vec->elements[j] = a_minus_t; vec->elements[i] = a_plus_t; } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_ntt_ntt_layer_1_step( libcrux_ml_kem_vector_portable_vector_type_PortableVector vec, int16_t zeta0, int16_t zeta1, int16_t zeta2, int16_t zeta3) { libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta0, (size_t)0U, (size_t)2U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta0, (size_t)1U, (size_t)3U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta1, (size_t)4U, (size_t)6U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta1, (size_t)5U, (size_t)7U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta2, (size_t)8U, (size_t)10U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta2, (size_t)9U, (size_t)11U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta3, (size_t)12U, (size_t)14U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta3, (size_t)13U, (size_t)15U); return vec; } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_ntt_layer_1_step_b8( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, int16_t zeta0, int16_t zeta1, int16_t zeta2, int16_t zeta3) { return libcrux_ml_kem_vector_portable_ntt_ntt_layer_1_step(a, zeta0, zeta1, zeta2, zeta3); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_ntt_ntt_layer_2_step( libcrux_ml_kem_vector_portable_vector_type_PortableVector vec, int16_t zeta0, int16_t zeta1) { libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta0, (size_t)0U, (size_t)4U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta0, (size_t)1U, (size_t)5U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta0, (size_t)2U, (size_t)6U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta0, (size_t)3U, (size_t)7U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta1, (size_t)8U, (size_t)12U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta1, (size_t)9U, (size_t)13U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta1, (size_t)10U, (size_t)14U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta1, (size_t)11U, (size_t)15U); return vec; } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_ntt_layer_2_step_b8( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, int16_t zeta0, int16_t zeta1) { return libcrux_ml_kem_vector_portable_ntt_ntt_layer_2_step(a, zeta0, zeta1); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_ntt_ntt_layer_3_step( libcrux_ml_kem_vector_portable_vector_type_PortableVector vec, int16_t zeta) { libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta, (size_t)0U, (size_t)8U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta, (size_t)1U, (size_t)9U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta, (size_t)2U, (size_t)10U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta, (size_t)3U, (size_t)11U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta, (size_t)4U, (size_t)12U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta, (size_t)5U, (size_t)13U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta, (size_t)6U, (size_t)14U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta, (size_t)7U, (size_t)15U); return vec; } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_ntt_layer_3_step_b8( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, int16_t zeta) { return libcrux_ml_kem_vector_portable_ntt_ntt_layer_3_step(a, zeta); } static KRML_MUSTINLINE void libcrux_ml_kem_vector_portable_ntt_inv_ntt_step( libcrux_ml_kem_vector_portable_vector_type_PortableVector *vec, int16_t zeta, size_t i, size_t j) { int16_t a_minus_b = vec->elements[j] - vec->elements[i]; int16_t a_plus_b = vec->elements[j] + vec->elements[i]; int16_t o0 = libcrux_ml_kem_vector_portable_arithmetic_barrett_reduce_element( a_plus_b); int16_t o1 = libcrux_ml_kem_vector_portable_arithmetic_montgomery_multiply_fe_by_fer( a_minus_b, libcrux_secrets_int_public_integers_classify_27_39(zeta)); vec->elements[i] = o0; vec->elements[j] = o1; } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_ntt_inv_ntt_layer_1_step( libcrux_ml_kem_vector_portable_vector_type_PortableVector vec, int16_t zeta0, int16_t zeta1, int16_t zeta2, int16_t zeta3) { libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta0, (size_t)0U, (size_t)2U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta0, (size_t)1U, (size_t)3U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta1, (size_t)4U, (size_t)6U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta1, (size_t)5U, (size_t)7U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta2, (size_t)8U, (size_t)10U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta2, (size_t)9U, (size_t)11U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta3, (size_t)12U, (size_t)14U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta3, (size_t)13U, (size_t)15U); return vec; } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_inv_ntt_layer_1_step_b8( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, int16_t zeta0, int16_t zeta1, int16_t zeta2, int16_t zeta3) { return libcrux_ml_kem_vector_portable_ntt_inv_ntt_layer_1_step( a, zeta0, zeta1, zeta2, zeta3); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_ntt_inv_ntt_layer_2_step( libcrux_ml_kem_vector_portable_vector_type_PortableVector vec, int16_t zeta0, int16_t zeta1) { libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta0, (size_t)0U, (size_t)4U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta0, (size_t)1U, (size_t)5U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta0, (size_t)2U, (size_t)6U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta0, (size_t)3U, (size_t)7U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta1, (size_t)8U, (size_t)12U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta1, (size_t)9U, (size_t)13U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta1, (size_t)10U, (size_t)14U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta1, (size_t)11U, (size_t)15U); return vec; } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_inv_ntt_layer_2_step_b8( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, int16_t zeta0, int16_t zeta1) { return libcrux_ml_kem_vector_portable_ntt_inv_ntt_layer_2_step(a, zeta0, zeta1); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_ntt_inv_ntt_layer_3_step( libcrux_ml_kem_vector_portable_vector_type_PortableVector vec, int16_t zeta) { libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta, (size_t)0U, (size_t)8U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta, (size_t)1U, (size_t)9U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta, (size_t)2U, (size_t)10U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta, (size_t)3U, (size_t)11U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta, (size_t)4U, (size_t)12U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta, (size_t)5U, (size_t)13U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta, (size_t)6U, (size_t)14U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta, (size_t)7U, (size_t)15U); return vec; } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_inv_ntt_layer_3_step_b8( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, int16_t zeta) { return libcrux_ml_kem_vector_portable_ntt_inv_ntt_layer_3_step(a, zeta); } /** Compute the product of two Kyber binomials with respect to the modulus `X² - zeta`. This function almost implements Algorithm 11 of the NIST FIPS 203 standard, which is reproduced below: ```plaintext Input: a₀, a₁, b₀, b₁ ∈ ℤq. Input: γ ∈ ℤq. Output: c₀, c₁ ∈ ℤq. c₀ ← a₀·b₀ + a₁·b₁·γ c₁ ← a₀·b₁ + a₁·b₀ return c₀, c₁ ``` We say "almost" because the coefficients output by this function are in the Montgomery domain (unlike in the specification). The NIST FIPS 203 standard can be found at . */ static KRML_MUSTINLINE void libcrux_ml_kem_vector_portable_ntt_ntt_multiply_binomials( libcrux_ml_kem_vector_portable_vector_type_PortableVector *a, libcrux_ml_kem_vector_portable_vector_type_PortableVector *b, int16_t zeta, size_t i, libcrux_ml_kem_vector_portable_vector_type_PortableVector *out) { int16_t ai = a->elements[(size_t)2U * i]; int16_t bi = b->elements[(size_t)2U * i]; int16_t aj = a->elements[(size_t)2U * i + (size_t)1U]; int16_t bj = b->elements[(size_t)2U * i + (size_t)1U]; int32_t ai_bi = libcrux_secrets_int_as_i32_f5(ai) * libcrux_secrets_int_as_i32_f5(bi); int32_t aj_bj_ = libcrux_secrets_int_as_i32_f5(aj) * libcrux_secrets_int_as_i32_f5(bj); int16_t aj_bj = libcrux_ml_kem_vector_portable_arithmetic_montgomery_reduce_element( aj_bj_); int32_t aj_bj_zeta = libcrux_secrets_int_as_i32_f5(aj_bj) * libcrux_secrets_int_as_i32_f5(zeta); int32_t ai_bi_aj_bj = ai_bi + aj_bj_zeta; int16_t o0 = libcrux_ml_kem_vector_portable_arithmetic_montgomery_reduce_element( ai_bi_aj_bj); int32_t ai_bj = libcrux_secrets_int_as_i32_f5(ai) * libcrux_secrets_int_as_i32_f5(bj); int32_t aj_bi = libcrux_secrets_int_as_i32_f5(aj) * libcrux_secrets_int_as_i32_f5(bi); int32_t ai_bj_aj_bi = ai_bj + aj_bi; int16_t o1 = libcrux_ml_kem_vector_portable_arithmetic_montgomery_reduce_element( ai_bj_aj_bi); out->elements[(size_t)2U * i] = o0; out->elements[(size_t)2U * i + (size_t)1U] = o1; } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_ntt_ntt_multiply( libcrux_ml_kem_vector_portable_vector_type_PortableVector *lhs, libcrux_ml_kem_vector_portable_vector_type_PortableVector *rhs, int16_t zeta0, int16_t zeta1, int16_t zeta2, int16_t zeta3) { int16_t nzeta0 = -zeta0; int16_t nzeta1 = -zeta1; int16_t nzeta2 = -zeta2; int16_t nzeta3 = -zeta3; libcrux_ml_kem_vector_portable_vector_type_PortableVector out = libcrux_ml_kem_vector_portable_vector_type_zero(); libcrux_ml_kem_vector_portable_ntt_ntt_multiply_binomials( lhs, rhs, libcrux_secrets_int_public_integers_classify_27_39(zeta0), (size_t)0U, &out); libcrux_ml_kem_vector_portable_ntt_ntt_multiply_binomials( lhs, rhs, libcrux_secrets_int_public_integers_classify_27_39(nzeta0), (size_t)1U, &out); libcrux_ml_kem_vector_portable_ntt_ntt_multiply_binomials( lhs, rhs, libcrux_secrets_int_public_integers_classify_27_39(zeta1), (size_t)2U, &out); libcrux_ml_kem_vector_portable_ntt_ntt_multiply_binomials( lhs, rhs, libcrux_secrets_int_public_integers_classify_27_39(nzeta1), (size_t)3U, &out); libcrux_ml_kem_vector_portable_ntt_ntt_multiply_binomials( lhs, rhs, libcrux_secrets_int_public_integers_classify_27_39(zeta2), (size_t)4U, &out); libcrux_ml_kem_vector_portable_ntt_ntt_multiply_binomials( lhs, rhs, libcrux_secrets_int_public_integers_classify_27_39(nzeta2), (size_t)5U, &out); libcrux_ml_kem_vector_portable_ntt_ntt_multiply_binomials( lhs, rhs, libcrux_secrets_int_public_integers_classify_27_39(zeta3), (size_t)6U, &out); libcrux_ml_kem_vector_portable_ntt_ntt_multiply_binomials( lhs, rhs, libcrux_secrets_int_public_integers_classify_27_39(nzeta3), (size_t)7U, &out); return out; } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_ntt_multiply_b8( libcrux_ml_kem_vector_portable_vector_type_PortableVector *lhs, libcrux_ml_kem_vector_portable_vector_type_PortableVector *rhs, int16_t zeta0, int16_t zeta1, int16_t zeta2, int16_t zeta3) { return libcrux_ml_kem_vector_portable_ntt_ntt_multiply(lhs, rhs, zeta0, zeta1, zeta2, zeta3); } static KRML_MUSTINLINE void libcrux_ml_kem_vector_portable_serialize_serialize_1( libcrux_ml_kem_vector_portable_vector_type_PortableVector v, uint8_t ret[2U]) { uint8_t result0 = (((((((uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[0U]) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[1U]) << 1U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[2U]) << 2U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[3U]) << 3U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[4U]) << 4U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[5U]) << 5U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[6U]) << 6U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[7U]) << 7U; uint8_t result1 = (((((((uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[8U]) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[9U]) << 1U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[10U]) << 2U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[11U]) << 3U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[12U]) << 4U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[13U]) << 5U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[14U]) << 6U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[15U]) << 7U; ret[0U] = result0; ret[1U] = result1; } static inline void libcrux_ml_kem_vector_portable_serialize_1( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, uint8_t ret[2U]) { uint8_t ret0[2U]; libcrux_ml_kem_vector_portable_serialize_serialize_1(a, ret0); libcrux_secrets_int_public_integers_declassify_d8_d4(ret0, ret); } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ static inline void libcrux_ml_kem_vector_portable_serialize_1_b8( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, uint8_t ret[2U]) { libcrux_ml_kem_vector_portable_serialize_1(a, ret); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_serialize_deserialize_1(Eurydice_slice v) { int16_t result0 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)0U, uint8_t, uint8_t *) & 1U); int16_t result1 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)0U, uint8_t, uint8_t *) >> 1U & 1U); int16_t result2 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)0U, uint8_t, uint8_t *) >> 2U & 1U); int16_t result3 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)0U, uint8_t, uint8_t *) >> 3U & 1U); int16_t result4 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)0U, uint8_t, uint8_t *) >> 4U & 1U); int16_t result5 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)0U, uint8_t, uint8_t *) >> 5U & 1U); int16_t result6 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)0U, uint8_t, uint8_t *) >> 6U & 1U); int16_t result7 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)0U, uint8_t, uint8_t *) >> 7U & 1U); int16_t result8 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)1U, uint8_t, uint8_t *) & 1U); int16_t result9 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)1U, uint8_t, uint8_t *) >> 1U & 1U); int16_t result10 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)1U, uint8_t, uint8_t *) >> 2U & 1U); int16_t result11 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)1U, uint8_t, uint8_t *) >> 3U & 1U); int16_t result12 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)1U, uint8_t, uint8_t *) >> 4U & 1U); int16_t result13 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)1U, uint8_t, uint8_t *) >> 5U & 1U); int16_t result14 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)1U, uint8_t, uint8_t *) >> 6U & 1U); int16_t result15 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)1U, uint8_t, uint8_t *) >> 7U & 1U); return ( KRML_CLITERAL(libcrux_ml_kem_vector_portable_vector_type_PortableVector){ .elements = {result0, result1, result2, result3, result4, result5, result6, result7, result8, result9, result10, result11, result12, result13, result14, result15}}); } static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_deserialize_1(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_serialize_deserialize_1( libcrux_secrets_int_classify_public_classify_ref_9b_90(a)); } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_deserialize_1_b8(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_deserialize_1(a); } typedef struct uint8_t_x4_s { uint8_t fst; uint8_t snd; uint8_t thd; uint8_t f3; } uint8_t_x4; static KRML_MUSTINLINE uint8_t_x4 libcrux_ml_kem_vector_portable_serialize_serialize_4_int(Eurydice_slice v) { uint8_t result0 = (uint32_t)libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)1U, int16_t, int16_t *)) << 4U | (uint32_t)libcrux_secrets_int_as_u8_f5(Eurydice_slice_index( v, (size_t)0U, int16_t, int16_t *)); uint8_t result1 = (uint32_t)libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)3U, int16_t, int16_t *)) << 4U | (uint32_t)libcrux_secrets_int_as_u8_f5(Eurydice_slice_index( v, (size_t)2U, int16_t, int16_t *)); uint8_t result2 = (uint32_t)libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)5U, int16_t, int16_t *)) << 4U | (uint32_t)libcrux_secrets_int_as_u8_f5(Eurydice_slice_index( v, (size_t)4U, int16_t, int16_t *)); uint8_t result3 = (uint32_t)libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)7U, int16_t, int16_t *)) << 4U | (uint32_t)libcrux_secrets_int_as_u8_f5(Eurydice_slice_index( v, (size_t)6U, int16_t, int16_t *)); return (KRML_CLITERAL(uint8_t_x4){ .fst = result0, .snd = result1, .thd = result2, .f3 = result3}); } static KRML_MUSTINLINE void libcrux_ml_kem_vector_portable_serialize_serialize_4( libcrux_ml_kem_vector_portable_vector_type_PortableVector v, uint8_t ret[8U]) { uint8_t_x4 result0_3 = libcrux_ml_kem_vector_portable_serialize_serialize_4_int( Eurydice_array_to_subslice3(v.elements, (size_t)0U, (size_t)8U, int16_t *)); uint8_t_x4 result4_7 = libcrux_ml_kem_vector_portable_serialize_serialize_4_int( Eurydice_array_to_subslice3(v.elements, (size_t)8U, (size_t)16U, int16_t *)); ret[0U] = result0_3.fst; ret[1U] = result0_3.snd; ret[2U] = result0_3.thd; ret[3U] = result0_3.f3; ret[4U] = result4_7.fst; ret[5U] = result4_7.snd; ret[6U] = result4_7.thd; ret[7U] = result4_7.f3; } static inline void libcrux_ml_kem_vector_portable_serialize_4( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, uint8_t ret[8U]) { uint8_t ret0[8U]; libcrux_ml_kem_vector_portable_serialize_serialize_4(a, ret0); libcrux_secrets_int_public_integers_declassify_d8_76(ret0, ret); } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ static inline void libcrux_ml_kem_vector_portable_serialize_4_b8( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, uint8_t ret[8U]) { libcrux_ml_kem_vector_portable_serialize_4(a, ret); } static KRML_MUSTINLINE int16_t_x8 libcrux_ml_kem_vector_portable_serialize_deserialize_4_int( Eurydice_slice bytes) { int16_t v0 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(bytes, (size_t)0U, uint8_t, uint8_t *) & 15U); int16_t v1 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(bytes, (size_t)0U, uint8_t, uint8_t *) >> 4U & 15U); int16_t v2 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *) & 15U); int16_t v3 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *) >> 4U & 15U); int16_t v4 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(bytes, (size_t)2U, uint8_t, uint8_t *) & 15U); int16_t v5 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(bytes, (size_t)2U, uint8_t, uint8_t *) >> 4U & 15U); int16_t v6 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(bytes, (size_t)3U, uint8_t, uint8_t *) & 15U); int16_t v7 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(bytes, (size_t)3U, uint8_t, uint8_t *) >> 4U & 15U); return (KRML_CLITERAL(int16_t_x8){.fst = v0, .snd = v1, .thd = v2, .f3 = v3, .f4 = v4, .f5 = v5, .f6 = v6, .f7 = v7}); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_serialize_deserialize_4(Eurydice_slice bytes) { int16_t_x8 v0_7 = libcrux_ml_kem_vector_portable_serialize_deserialize_4_int( Eurydice_slice_subslice3(bytes, (size_t)0U, (size_t)4U, uint8_t *)); int16_t_x8 v8_15 = libcrux_ml_kem_vector_portable_serialize_deserialize_4_int( Eurydice_slice_subslice3(bytes, (size_t)4U, (size_t)8U, uint8_t *)); return ( KRML_CLITERAL(libcrux_ml_kem_vector_portable_vector_type_PortableVector){ .elements = {v0_7.fst, v0_7.snd, v0_7.thd, v0_7.f3, v0_7.f4, v0_7.f5, v0_7.f6, v0_7.f7, v8_15.fst, v8_15.snd, v8_15.thd, v8_15.f3, v8_15.f4, v8_15.f5, v8_15.f6, v8_15.f7}}); } static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_deserialize_4(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_serialize_deserialize_4( libcrux_secrets_int_classify_public_classify_ref_9b_90(a)); } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_deserialize_4_b8(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_deserialize_4(a); } typedef struct uint8_t_x5_s { uint8_t fst; uint8_t snd; uint8_t thd; uint8_t f3; uint8_t f4; } uint8_t_x5; static KRML_MUSTINLINE uint8_t_x5 libcrux_ml_kem_vector_portable_serialize_serialize_10_int(Eurydice_slice v) { uint8_t r0 = libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)0U, int16_t, int16_t *) & (int16_t)255); uint8_t r1 = (uint32_t)libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)1U, int16_t, int16_t *) & (int16_t)63) << 2U | (uint32_t)libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)0U, int16_t, int16_t *) >> 8U & (int16_t)3); uint8_t r2 = (uint32_t)libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)2U, int16_t, int16_t *) & (int16_t)15) << 4U | (uint32_t)libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)1U, int16_t, int16_t *) >> 6U & (int16_t)15); uint8_t r3 = (uint32_t)libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)3U, int16_t, int16_t *) & (int16_t)3) << 6U | (uint32_t)libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)2U, int16_t, int16_t *) >> 4U & (int16_t)63); uint8_t r4 = libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)3U, int16_t, int16_t *) >> 2U & (int16_t)255); return (KRML_CLITERAL(uint8_t_x5){ .fst = r0, .snd = r1, .thd = r2, .f3 = r3, .f4 = r4}); } static KRML_MUSTINLINE void libcrux_ml_kem_vector_portable_serialize_serialize_10( libcrux_ml_kem_vector_portable_vector_type_PortableVector v, uint8_t ret[20U]) { uint8_t_x5 r0_4 = libcrux_ml_kem_vector_portable_serialize_serialize_10_int( Eurydice_array_to_subslice3(v.elements, (size_t)0U, (size_t)4U, int16_t *)); uint8_t_x5 r5_9 = libcrux_ml_kem_vector_portable_serialize_serialize_10_int( Eurydice_array_to_subslice3(v.elements, (size_t)4U, (size_t)8U, int16_t *)); uint8_t_x5 r10_14 = libcrux_ml_kem_vector_portable_serialize_serialize_10_int( Eurydice_array_to_subslice3(v.elements, (size_t)8U, (size_t)12U, int16_t *)); uint8_t_x5 r15_19 = libcrux_ml_kem_vector_portable_serialize_serialize_10_int( Eurydice_array_to_subslice3(v.elements, (size_t)12U, (size_t)16U, int16_t *)); ret[0U] = r0_4.fst; ret[1U] = r0_4.snd; ret[2U] = r0_4.thd; ret[3U] = r0_4.f3; ret[4U] = r0_4.f4; ret[5U] = r5_9.fst; ret[6U] = r5_9.snd; ret[7U] = r5_9.thd; ret[8U] = r5_9.f3; ret[9U] = r5_9.f4; ret[10U] = r10_14.fst; ret[11U] = r10_14.snd; ret[12U] = r10_14.thd; ret[13U] = r10_14.f3; ret[14U] = r10_14.f4; ret[15U] = r15_19.fst; ret[16U] = r15_19.snd; ret[17U] = r15_19.thd; ret[18U] = r15_19.f3; ret[19U] = r15_19.f4; } static inline void libcrux_ml_kem_vector_portable_serialize_10( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, uint8_t ret[20U]) { uint8_t ret0[20U]; libcrux_ml_kem_vector_portable_serialize_serialize_10(a, ret0); libcrux_secrets_int_public_integers_declassify_d8_57(ret0, ret); } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ static inline void libcrux_ml_kem_vector_portable_serialize_10_b8( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, uint8_t ret[20U]) { libcrux_ml_kem_vector_portable_serialize_10(a, ret); } static KRML_MUSTINLINE int16_t_x8 libcrux_ml_kem_vector_portable_serialize_deserialize_10_int( Eurydice_slice bytes) { int16_t r0 = libcrux_secrets_int_as_i16_f5( (libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *)) & (int16_t)3) << 8U | (libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)0U, uint8_t, uint8_t *)) & (int16_t)255)); int16_t r1 = libcrux_secrets_int_as_i16_f5( (libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)2U, uint8_t, uint8_t *)) & (int16_t)15) << 6U | libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *)) >> 2U); int16_t r2 = libcrux_secrets_int_as_i16_f5( (libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)3U, uint8_t, uint8_t *)) & (int16_t)63) << 4U | libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)2U, uint8_t, uint8_t *)) >> 4U); int16_t r3 = libcrux_secrets_int_as_i16_f5( libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)4U, uint8_t, uint8_t *)) << 2U | libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)3U, uint8_t, uint8_t *)) >> 6U); int16_t r4 = libcrux_secrets_int_as_i16_f5( (libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)6U, uint8_t, uint8_t *)) & (int16_t)3) << 8U | (libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)5U, uint8_t, uint8_t *)) & (int16_t)255)); int16_t r5 = libcrux_secrets_int_as_i16_f5( (libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)7U, uint8_t, uint8_t *)) & (int16_t)15) << 6U | libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)6U, uint8_t, uint8_t *)) >> 2U); int16_t r6 = libcrux_secrets_int_as_i16_f5( (libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)8U, uint8_t, uint8_t *)) & (int16_t)63) << 4U | libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)7U, uint8_t, uint8_t *)) >> 4U); int16_t r7 = libcrux_secrets_int_as_i16_f5( libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)9U, uint8_t, uint8_t *)) << 2U | libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)8U, uint8_t, uint8_t *)) >> 6U); return (KRML_CLITERAL(int16_t_x8){.fst = r0, .snd = r1, .thd = r2, .f3 = r3, .f4 = r4, .f5 = r5, .f6 = r6, .f7 = r7}); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_serialize_deserialize_10(Eurydice_slice bytes) { int16_t_x8 v0_7 = libcrux_ml_kem_vector_portable_serialize_deserialize_10_int( Eurydice_slice_subslice3(bytes, (size_t)0U, (size_t)10U, uint8_t *)); int16_t_x8 v8_15 = libcrux_ml_kem_vector_portable_serialize_deserialize_10_int( Eurydice_slice_subslice3(bytes, (size_t)10U, (size_t)20U, uint8_t *)); return ( KRML_CLITERAL(libcrux_ml_kem_vector_portable_vector_type_PortableVector){ .elements = {v0_7.fst, v0_7.snd, v0_7.thd, v0_7.f3, v0_7.f4, v0_7.f5, v0_7.f6, v0_7.f7, v8_15.fst, v8_15.snd, v8_15.thd, v8_15.f3, v8_15.f4, v8_15.f5, v8_15.f6, v8_15.f7}}); } static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_deserialize_10(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_serialize_deserialize_10( libcrux_secrets_int_classify_public_classify_ref_9b_90(a)); } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_deserialize_10_b8(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_deserialize_10(a); } typedef struct uint8_t_x3_s { uint8_t fst; uint8_t snd; uint8_t thd; } uint8_t_x3; static KRML_MUSTINLINE uint8_t_x3 libcrux_ml_kem_vector_portable_serialize_serialize_12_int(Eurydice_slice v) { uint8_t r0 = libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)0U, int16_t, int16_t *) & (int16_t)255); uint8_t r1 = libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)0U, int16_t, int16_t *) >> 8U | (Eurydice_slice_index(v, (size_t)1U, int16_t, int16_t *) & (int16_t)15) << 4U); uint8_t r2 = libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)1U, int16_t, int16_t *) >> 4U & (int16_t)255); return (KRML_CLITERAL(uint8_t_x3){.fst = r0, .snd = r1, .thd = r2}); } static KRML_MUSTINLINE void libcrux_ml_kem_vector_portable_serialize_serialize_12( libcrux_ml_kem_vector_portable_vector_type_PortableVector v, uint8_t ret[24U]) { uint8_t_x3 r0_2 = libcrux_ml_kem_vector_portable_serialize_serialize_12_int( Eurydice_array_to_subslice3(v.elements, (size_t)0U, (size_t)2U, int16_t *)); uint8_t_x3 r3_5 = libcrux_ml_kem_vector_portable_serialize_serialize_12_int( Eurydice_array_to_subslice3(v.elements, (size_t)2U, (size_t)4U, int16_t *)); uint8_t_x3 r6_8 = libcrux_ml_kem_vector_portable_serialize_serialize_12_int( Eurydice_array_to_subslice3(v.elements, (size_t)4U, (size_t)6U, int16_t *)); uint8_t_x3 r9_11 = libcrux_ml_kem_vector_portable_serialize_serialize_12_int( Eurydice_array_to_subslice3(v.elements, (size_t)6U, (size_t)8U, int16_t *)); uint8_t_x3 r12_14 = libcrux_ml_kem_vector_portable_serialize_serialize_12_int( Eurydice_array_to_subslice3(v.elements, (size_t)8U, (size_t)10U, int16_t *)); uint8_t_x3 r15_17 = libcrux_ml_kem_vector_portable_serialize_serialize_12_int( Eurydice_array_to_subslice3(v.elements, (size_t)10U, (size_t)12U, int16_t *)); uint8_t_x3 r18_20 = libcrux_ml_kem_vector_portable_serialize_serialize_12_int( Eurydice_array_to_subslice3(v.elements, (size_t)12U, (size_t)14U, int16_t *)); uint8_t_x3 r21_23 = libcrux_ml_kem_vector_portable_serialize_serialize_12_int( Eurydice_array_to_subslice3(v.elements, (size_t)14U, (size_t)16U, int16_t *)); ret[0U] = r0_2.fst; ret[1U] = r0_2.snd; ret[2U] = r0_2.thd; ret[3U] = r3_5.fst; ret[4U] = r3_5.snd; ret[5U] = r3_5.thd; ret[6U] = r6_8.fst; ret[7U] = r6_8.snd; ret[8U] = r6_8.thd; ret[9U] = r9_11.fst; ret[10U] = r9_11.snd; ret[11U] = r9_11.thd; ret[12U] = r12_14.fst; ret[13U] = r12_14.snd; ret[14U] = r12_14.thd; ret[15U] = r15_17.fst; ret[16U] = r15_17.snd; ret[17U] = r15_17.thd; ret[18U] = r18_20.fst; ret[19U] = r18_20.snd; ret[20U] = r18_20.thd; ret[21U] = r21_23.fst; ret[22U] = r21_23.snd; ret[23U] = r21_23.thd; } static inline void libcrux_ml_kem_vector_portable_serialize_12( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, uint8_t ret[24U]) { uint8_t ret0[24U]; libcrux_ml_kem_vector_portable_serialize_serialize_12(a, ret0); libcrux_secrets_int_public_integers_declassify_d8_d2(ret0, ret); } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ static inline void libcrux_ml_kem_vector_portable_serialize_12_b8( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, uint8_t ret[24U]) { libcrux_ml_kem_vector_portable_serialize_12(a, ret); } typedef struct int16_t_x2_s { int16_t fst; int16_t snd; } int16_t_x2; static KRML_MUSTINLINE int16_t_x2 libcrux_ml_kem_vector_portable_serialize_deserialize_12_int( Eurydice_slice bytes) { int16_t byte0 = libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)0U, uint8_t, uint8_t *)); int16_t byte1 = libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *)); int16_t byte2 = libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)2U, uint8_t, uint8_t *)); int16_t r0 = (byte1 & (int16_t)15) << 8U | (byte0 & (int16_t)255); int16_t r1 = byte2 << 4U | (byte1 >> 4U & (int16_t)15); return (KRML_CLITERAL(int16_t_x2){.fst = r0, .snd = r1}); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_serialize_deserialize_12(Eurydice_slice bytes) { int16_t_x2 v0_1 = libcrux_ml_kem_vector_portable_serialize_deserialize_12_int( Eurydice_slice_subslice3(bytes, (size_t)0U, (size_t)3U, uint8_t *)); int16_t_x2 v2_3 = libcrux_ml_kem_vector_portable_serialize_deserialize_12_int( Eurydice_slice_subslice3(bytes, (size_t)3U, (size_t)6U, uint8_t *)); int16_t_x2 v4_5 = libcrux_ml_kem_vector_portable_serialize_deserialize_12_int( Eurydice_slice_subslice3(bytes, (size_t)6U, (size_t)9U, uint8_t *)); int16_t_x2 v6_7 = libcrux_ml_kem_vector_portable_serialize_deserialize_12_int( Eurydice_slice_subslice3(bytes, (size_t)9U, (size_t)12U, uint8_t *)); int16_t_x2 v8_9 = libcrux_ml_kem_vector_portable_serialize_deserialize_12_int( Eurydice_slice_subslice3(bytes, (size_t)12U, (size_t)15U, uint8_t *)); int16_t_x2 v10_11 = libcrux_ml_kem_vector_portable_serialize_deserialize_12_int( Eurydice_slice_subslice3(bytes, (size_t)15U, (size_t)18U, uint8_t *)); int16_t_x2 v12_13 = libcrux_ml_kem_vector_portable_serialize_deserialize_12_int( Eurydice_slice_subslice3(bytes, (size_t)18U, (size_t)21U, uint8_t *)); int16_t_x2 v14_15 = libcrux_ml_kem_vector_portable_serialize_deserialize_12_int( Eurydice_slice_subslice3(bytes, (size_t)21U, (size_t)24U, uint8_t *)); return ( KRML_CLITERAL(libcrux_ml_kem_vector_portable_vector_type_PortableVector){ .elements = {v0_1.fst, v0_1.snd, v2_3.fst, v2_3.snd, v4_5.fst, v4_5.snd, v6_7.fst, v6_7.snd, v8_9.fst, v8_9.snd, v10_11.fst, v10_11.snd, v12_13.fst, v12_13.snd, v14_15.fst, v14_15.snd}}); } static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_deserialize_12(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_serialize_deserialize_12( libcrux_secrets_int_classify_public_classify_ref_9b_90(a)); } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_deserialize_12_b8(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_deserialize_12(a); } static KRML_MUSTINLINE size_t libcrux_ml_kem_vector_portable_sampling_rej_sample(Eurydice_slice a, Eurydice_slice result) { size_t sampled = (size_t)0U; for (size_t i = (size_t)0U; i < Eurydice_slice_len(a, uint8_t) / (size_t)3U; i++) { size_t i0 = i; int16_t b1 = (int16_t)Eurydice_slice_index(a, i0 * (size_t)3U + (size_t)0U, uint8_t, uint8_t *); int16_t b2 = (int16_t)Eurydice_slice_index(a, i0 * (size_t)3U + (size_t)1U, uint8_t, uint8_t *); int16_t b3 = (int16_t)Eurydice_slice_index(a, i0 * (size_t)3U + (size_t)2U, uint8_t, uint8_t *); int16_t d1 = (b2 & (int16_t)15) << 8U | b1; int16_t d2 = b3 << 4U | b2 >> 4U; if (d1 < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS) { if (sampled < (size_t)16U) { Eurydice_slice_index(result, sampled, int16_t, int16_t *) = d1; sampled++; } } if (d2 < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS) { if (sampled < (size_t)16U) { Eurydice_slice_index(result, sampled, int16_t, int16_t *) = d2; sampled++; } } } return sampled; } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ static inline size_t libcrux_ml_kem_vector_portable_rej_sample_b8( Eurydice_slice a, Eurydice_slice out) { return libcrux_ml_kem_vector_portable_sampling_rej_sample(a, out); } #define LIBCRUX_ML_KEM_MLKEM768_VECTOR_U_COMPRESSION_FACTOR ((size_t)10U) #define LIBCRUX_ML_KEM_MLKEM768_C1_BLOCK_SIZE \ (LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT * \ LIBCRUX_ML_KEM_MLKEM768_VECTOR_U_COMPRESSION_FACTOR / (size_t)8U) #define LIBCRUX_ML_KEM_MLKEM768_RANK ((size_t)3U) #define LIBCRUX_ML_KEM_MLKEM768_C1_SIZE \ (LIBCRUX_ML_KEM_MLKEM768_C1_BLOCK_SIZE * LIBCRUX_ML_KEM_MLKEM768_RANK) #define LIBCRUX_ML_KEM_MLKEM768_VECTOR_V_COMPRESSION_FACTOR ((size_t)4U) #define LIBCRUX_ML_KEM_MLKEM768_C2_SIZE \ (LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT * \ LIBCRUX_ML_KEM_MLKEM768_VECTOR_V_COMPRESSION_FACTOR / (size_t)8U) #define LIBCRUX_ML_KEM_MLKEM768_CPA_PKE_CIPHERTEXT_SIZE \ (LIBCRUX_ML_KEM_MLKEM768_C1_SIZE + LIBCRUX_ML_KEM_MLKEM768_C2_SIZE) #define LIBCRUX_ML_KEM_MLKEM768_T_AS_NTT_ENCODED_SIZE \ (LIBCRUX_ML_KEM_MLKEM768_RANK * \ LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT * \ LIBCRUX_ML_KEM_CONSTANTS_BITS_PER_COEFFICIENT / (size_t)8U) #define LIBCRUX_ML_KEM_MLKEM768_CPA_PKE_PUBLIC_KEY_SIZE \ (LIBCRUX_ML_KEM_MLKEM768_T_AS_NTT_ENCODED_SIZE + (size_t)32U) #define LIBCRUX_ML_KEM_MLKEM768_CPA_PKE_SECRET_KEY_SIZE \ (LIBCRUX_ML_KEM_MLKEM768_RANK * \ LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT * \ LIBCRUX_ML_KEM_CONSTANTS_BITS_PER_COEFFICIENT / (size_t)8U) #define LIBCRUX_ML_KEM_MLKEM768_ETA1 ((size_t)2U) #define LIBCRUX_ML_KEM_MLKEM768_ETA1_RANDOMNESS_SIZE \ (LIBCRUX_ML_KEM_MLKEM768_ETA1 * (size_t)64U) #define LIBCRUX_ML_KEM_MLKEM768_ETA2 ((size_t)2U) #define LIBCRUX_ML_KEM_MLKEM768_ETA2_RANDOMNESS_SIZE \ (LIBCRUX_ML_KEM_MLKEM768_ETA2 * (size_t)64U) #define LIBCRUX_ML_KEM_MLKEM768_IMPLICIT_REJECTION_HASH_INPUT_SIZE \ (LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE + \ LIBCRUX_ML_KEM_MLKEM768_CPA_PKE_CIPHERTEXT_SIZE) typedef libcrux_ml_kem_types_MlKemPrivateKey_d9 libcrux_ml_kem_mlkem768_MlKem768PrivateKey; typedef libcrux_ml_kem_types_MlKemPublicKey_30 libcrux_ml_kem_mlkem768_MlKem768PublicKey; #define LIBCRUX_ML_KEM_MLKEM768_RANKED_BYTES_PER_RING_ELEMENT \ (LIBCRUX_ML_KEM_MLKEM768_RANK * \ LIBCRUX_ML_KEM_CONSTANTS_BITS_PER_RING_ELEMENT / (size_t)8U) #define LIBCRUX_ML_KEM_MLKEM768_SECRET_KEY_SIZE \ (LIBCRUX_ML_KEM_MLKEM768_CPA_PKE_SECRET_KEY_SIZE + \ LIBCRUX_ML_KEM_MLKEM768_CPA_PKE_PUBLIC_KEY_SIZE + \ LIBCRUX_ML_KEM_CONSTANTS_H_DIGEST_SIZE + \ LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE) /** A monomorphic instance of libcrux_ml_kem.polynomial.PolynomialRingElement with types libcrux_ml_kem_vector_portable_vector_type_PortableVector */ typedef struct libcrux_ml_kem_polynomial_PolynomialRingElement_1d_s { libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficients[16U]; } libcrux_ml_kem_polynomial_PolynomialRingElement_1d; /** A monomorphic instance of libcrux_ml_kem.ind_cpa.unpacked.IndCpaPrivateKeyUnpacked with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - $3size_t */ typedef struct libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_a0_s { libcrux_ml_kem_polynomial_PolynomialRingElement_1d secret_as_ntt[3U]; } libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_a0; /** This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.ZERO_d6 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_polynomial_ZERO_d6_ea(void) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d lit; libcrux_ml_kem_vector_portable_vector_type_PortableVector repeat_expression[16U]; for (size_t i = (size_t)0U; i < (size_t)16U; i++) { repeat_expression[i] = libcrux_ml_kem_vector_portable_ZERO_b8(); } memcpy(lit.coefficients, repeat_expression, (size_t)16U * sizeof(libcrux_ml_kem_vector_portable_vector_type_PortableVector)); return lit; } /** This function found in impl {core::ops::function::FnMut<(usize), libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]> for libcrux_ml_kem::ind_cpa::decrypt::closure[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.decrypt.call_mut_0b with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - CIPHERTEXT_SIZE= 1088 - VECTOR_U_ENCODED_SIZE= 960 - U_COMPRESSION_FACTOR= 10 - V_COMPRESSION_FACTOR= 4 */ static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_ind_cpa_decrypt_call_mut_0b_42(void **_, size_t tupled_args) { return libcrux_ml_kem_polynomial_ZERO_d6_ea(); } /** A monomorphic instance of libcrux_ml_kem.serialize.deserialize_to_uncompressed_ring_element with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_serialize_deserialize_to_uncompressed_ring_element_ea( Eurydice_slice serialized) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d re = libcrux_ml_kem_polynomial_ZERO_d6_ea(); for (size_t i = (size_t)0U; i < Eurydice_slice_len(serialized, uint8_t) / (size_t)24U; i++) { size_t i0 = i; Eurydice_slice bytes = Eurydice_slice_subslice3(serialized, i0 * (size_t)24U, i0 * (size_t)24U + (size_t)24U, uint8_t *); libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_deserialize_12_b8(bytes); re.coefficients[i0] = uu____0; } return re; } /** Call [`deserialize_to_uncompressed_ring_element`] for each ring element. */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.deserialize_vector with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_deserialize_vector_1b( Eurydice_slice secret_key, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *secret_as_ntt) { for (size_t i = (size_t)0U; i < (size_t)3U; i++) { size_t i0 = i; libcrux_ml_kem_polynomial_PolynomialRingElement_1d uu____0 = libcrux_ml_kem_serialize_deserialize_to_uncompressed_ring_element_ea( Eurydice_slice_subslice3( secret_key, i0 * LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT, (i0 + (size_t)1U) * LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT, uint8_t *)); secret_as_ntt[i0] = uu____0; } } /** This function found in impl {core::ops::function::FnMut<(usize), libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]> for libcrux_ml_kem::ind_cpa::deserialize_then_decompress_u::closure[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.deserialize_then_decompress_u.call_mut_35 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - CIPHERTEXT_SIZE= 1088 - U_COMPRESSION_FACTOR= 10 */ static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_ind_cpa_deserialize_then_decompress_u_call_mut_35_6c( void **_, size_t tupled_args) { return libcrux_ml_kem_polynomial_ZERO_d6_ea(); } /** A monomorphic instance of libcrux_ml_kem.vector.portable.compress.decompress_ciphertext_coefficient with const generics - COEFFICIENT_BITS= 10 */ static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_compress_decompress_ciphertext_coefficient_ef( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; int32_t decompressed = libcrux_secrets_int_as_i32_f5(a.elements[i0]) * libcrux_secrets_int_as_i32_f5( libcrux_secrets_int_public_integers_classify_27_39( LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS)); decompressed = (decompressed << 1U) + ((int32_t)1 << (uint32_t)(int32_t)10); decompressed = decompressed >> (uint32_t)((int32_t)10 + (int32_t)1); a.elements[i0] = libcrux_secrets_int_as_i16_36(decompressed); } return a; } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ /** A monomorphic instance of libcrux_ml_kem.vector.portable.decompress_ciphertext_coefficient_b8 with const generics - COEFFICIENT_BITS= 10 */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_decompress_ciphertext_coefficient_b8_ef( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { return libcrux_ml_kem_vector_portable_compress_decompress_ciphertext_coefficient_ef( a); } /** A monomorphic instance of libcrux_ml_kem.serialize.deserialize_then_decompress_10 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_serialize_deserialize_then_decompress_10_ea( Eurydice_slice serialized) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d re = libcrux_ml_kem_polynomial_ZERO_d6_ea(); for (size_t i = (size_t)0U; i < Eurydice_slice_len(serialized, uint8_t) / (size_t)20U; i++) { size_t i0 = i; Eurydice_slice bytes = Eurydice_slice_subslice3(serialized, i0 * (size_t)20U, i0 * (size_t)20U + (size_t)20U, uint8_t *); libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient = libcrux_ml_kem_vector_portable_deserialize_10_b8(bytes); libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_decompress_ciphertext_coefficient_b8_ef( coefficient); re.coefficients[i0] = uu____0; } return re; } /** A monomorphic instance of libcrux_ml_kem.serialize.deserialize_then_decompress_ring_element_u with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - COMPRESSION_FACTOR= 10 */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_serialize_deserialize_then_decompress_ring_element_u_0a( Eurydice_slice serialized) { return libcrux_ml_kem_serialize_deserialize_then_decompress_10_ea(serialized); } typedef struct libcrux_ml_kem_vector_portable_vector_type_PortableVector_x2_s { libcrux_ml_kem_vector_portable_vector_type_PortableVector fst; libcrux_ml_kem_vector_portable_vector_type_PortableVector snd; } libcrux_ml_kem_vector_portable_vector_type_PortableVector_x2; /** A monomorphic instance of libcrux_ml_kem.ntt.ntt_layer_int_vec_step with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector_x2 libcrux_ml_kem_ntt_ntt_layer_int_vec_step_ea( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, libcrux_ml_kem_vector_portable_vector_type_PortableVector b, int16_t zeta_r) { libcrux_ml_kem_vector_portable_vector_type_PortableVector t = libcrux_ml_kem_vector_portable_montgomery_multiply_by_constant_b8(b, zeta_r); b = libcrux_ml_kem_vector_portable_sub_b8(a, &t); a = libcrux_ml_kem_vector_portable_add_b8(a, &t); return (KRML_CLITERAL( libcrux_ml_kem_vector_portable_vector_type_PortableVector_x2){.fst = a, .snd = b}); } /** A monomorphic instance of libcrux_ml_kem.ntt.ntt_at_layer_4_plus with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_ntt_ntt_at_layer_4_plus_ea( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re, size_t layer, size_t _initial_coefficient_bound) { size_t step = (size_t)1U << (uint32_t)layer; for (size_t i0 = (size_t)0U; i0 < (size_t)128U >> (uint32_t)layer; i0++) { size_t round = i0; zeta_i[0U] = zeta_i[0U] + (size_t)1U; size_t offset = round * step * (size_t)2U; size_t offset_vec = offset / (size_t)16U; size_t step_vec = step / (size_t)16U; for (size_t i = offset_vec; i < offset_vec + step_vec; i++) { size_t j = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector_x2 uu____0 = libcrux_ml_kem_ntt_ntt_layer_int_vec_step_ea( re->coefficients[j], re->coefficients[j + step_vec], libcrux_ml_kem_polynomial_zeta(zeta_i[0U])); libcrux_ml_kem_vector_portable_vector_type_PortableVector x = uu____0.fst; libcrux_ml_kem_vector_portable_vector_type_PortableVector y = uu____0.snd; re->coefficients[j] = x; re->coefficients[j + step_vec] = y; } } } /** A monomorphic instance of libcrux_ml_kem.ntt.ntt_at_layer_3 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_ntt_ntt_at_layer_3_ea( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re, size_t _initial_coefficient_bound) { for (size_t i = (size_t)0U; i < (size_t)16U; i++) { size_t round = i; zeta_i[0U] = zeta_i[0U] + (size_t)1U; libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_ntt_layer_3_step_b8( re->coefficients[round], libcrux_ml_kem_polynomial_zeta(zeta_i[0U])); re->coefficients[round] = uu____0; } } /** A monomorphic instance of libcrux_ml_kem.ntt.ntt_at_layer_2 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_ntt_ntt_at_layer_2_ea( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re, size_t _initial_coefficient_bound) { for (size_t i = (size_t)0U; i < (size_t)16U; i++) { size_t round = i; zeta_i[0U] = zeta_i[0U] + (size_t)1U; re->coefficients[round] = libcrux_ml_kem_vector_portable_ntt_layer_2_step_b8( re->coefficients[round], libcrux_ml_kem_polynomial_zeta(zeta_i[0U]), libcrux_ml_kem_polynomial_zeta(zeta_i[0U] + (size_t)1U)); zeta_i[0U] = zeta_i[0U] + (size_t)1U; } } /** A monomorphic instance of libcrux_ml_kem.ntt.ntt_at_layer_1 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_ntt_ntt_at_layer_1_ea( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re, size_t _initial_coefficient_bound) { for (size_t i = (size_t)0U; i < (size_t)16U; i++) { size_t round = i; zeta_i[0U] = zeta_i[0U] + (size_t)1U; re->coefficients[round] = libcrux_ml_kem_vector_portable_ntt_layer_1_step_b8( re->coefficients[round], libcrux_ml_kem_polynomial_zeta(zeta_i[0U]), libcrux_ml_kem_polynomial_zeta(zeta_i[0U] + (size_t)1U), libcrux_ml_kem_polynomial_zeta(zeta_i[0U] + (size_t)2U), libcrux_ml_kem_polynomial_zeta(zeta_i[0U] + (size_t)3U)); zeta_i[0U] = zeta_i[0U] + (size_t)3U; } } /** A monomorphic instance of libcrux_ml_kem.polynomial.poly_barrett_reduce with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_polynomial_poly_barrett_reduce_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *myself) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT; i++) { size_t i0 = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_barrett_reduce_b8( myself->coefficients[i0]); myself->coefficients[i0] = uu____0; } } /** This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.poly_barrett_reduce_d6 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_polynomial_poly_barrett_reduce_d6_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *self) { libcrux_ml_kem_polynomial_poly_barrett_reduce_ea(self); } /** A monomorphic instance of libcrux_ml_kem.ntt.ntt_vector_u with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - VECTOR_U_COMPRESSION_FACTOR= 10 */ static KRML_MUSTINLINE void libcrux_ml_kem_ntt_ntt_vector_u_0a( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re) { size_t zeta_i = (size_t)0U; libcrux_ml_kem_ntt_ntt_at_layer_4_plus_ea(&zeta_i, re, (size_t)7U, (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_4_plus_ea(&zeta_i, re, (size_t)6U, (size_t)2U * (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_4_plus_ea(&zeta_i, re, (size_t)5U, (size_t)3U * (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_4_plus_ea(&zeta_i, re, (size_t)4U, (size_t)4U * (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_3_ea(&zeta_i, re, (size_t)5U * (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_2_ea(&zeta_i, re, (size_t)6U * (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_1_ea(&zeta_i, re, (size_t)7U * (size_t)3328U); libcrux_ml_kem_polynomial_poly_barrett_reduce_d6_ea(re); } /** Call [`deserialize_then_decompress_ring_element_u`] on each ring element in the `ciphertext`. */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.deserialize_then_decompress_u with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - CIPHERTEXT_SIZE= 1088 - U_COMPRESSION_FACTOR= 10 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_deserialize_then_decompress_u_6c( uint8_t *ciphertext, libcrux_ml_kem_polynomial_PolynomialRingElement_1d ret[3U]) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d u_as_ntt[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { /* original Rust expression is not an lvalue in C */ void *lvalue = (void *)0U; u_as_ntt[i] = libcrux_ml_kem_ind_cpa_deserialize_then_decompress_u_call_mut_35_6c( &lvalue, i); } for (size_t i = (size_t)0U; i < Eurydice_slice_len( Eurydice_array_to_slice((size_t)1088U, ciphertext, uint8_t), uint8_t) / (LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT * (size_t)10U / (size_t)8U); i++) { size_t i0 = i; Eurydice_slice u_bytes = Eurydice_array_to_subslice3( ciphertext, i0 * (LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT * (size_t)10U / (size_t)8U), i0 * (LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT * (size_t)10U / (size_t)8U) + LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT * (size_t)10U / (size_t)8U, uint8_t *); u_as_ntt[i0] = libcrux_ml_kem_serialize_deserialize_then_decompress_ring_element_u_0a( u_bytes); libcrux_ml_kem_ntt_ntt_vector_u_0a(&u_as_ntt[i0]); } memcpy( ret, u_as_ntt, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); } /** A monomorphic instance of libcrux_ml_kem.vector.portable.compress.decompress_ciphertext_coefficient with const generics - COEFFICIENT_BITS= 4 */ static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_compress_decompress_ciphertext_coefficient_d1( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; int32_t decompressed = libcrux_secrets_int_as_i32_f5(a.elements[i0]) * libcrux_secrets_int_as_i32_f5( libcrux_secrets_int_public_integers_classify_27_39( LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS)); decompressed = (decompressed << 1U) + ((int32_t)1 << (uint32_t)(int32_t)4); decompressed = decompressed >> (uint32_t)((int32_t)4 + (int32_t)1); a.elements[i0] = libcrux_secrets_int_as_i16_36(decompressed); } return a; } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ /** A monomorphic instance of libcrux_ml_kem.vector.portable.decompress_ciphertext_coefficient_b8 with const generics - COEFFICIENT_BITS= 4 */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_decompress_ciphertext_coefficient_b8_d1( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { return libcrux_ml_kem_vector_portable_compress_decompress_ciphertext_coefficient_d1( a); } /** A monomorphic instance of libcrux_ml_kem.serialize.deserialize_then_decompress_4 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_serialize_deserialize_then_decompress_4_ea( Eurydice_slice serialized) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d re = libcrux_ml_kem_polynomial_ZERO_d6_ea(); for (size_t i = (size_t)0U; i < Eurydice_slice_len(serialized, uint8_t) / (size_t)8U; i++) { size_t i0 = i; Eurydice_slice bytes = Eurydice_slice_subslice3( serialized, i0 * (size_t)8U, i0 * (size_t)8U + (size_t)8U, uint8_t *); libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient = libcrux_ml_kem_vector_portable_deserialize_4_b8(bytes); libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_decompress_ciphertext_coefficient_b8_d1( coefficient); re.coefficients[i0] = uu____0; } return re; } /** A monomorphic instance of libcrux_ml_kem.serialize.deserialize_then_decompress_ring_element_v with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - COMPRESSION_FACTOR= 4 */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_serialize_deserialize_then_decompress_ring_element_v_89( Eurydice_slice serialized) { return libcrux_ml_kem_serialize_deserialize_then_decompress_4_ea(serialized); } /** A monomorphic instance of libcrux_ml_kem.polynomial.ZERO with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_polynomial_ZERO_ea(void) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d lit; libcrux_ml_kem_vector_portable_vector_type_PortableVector repeat_expression[16U]; for (size_t i = (size_t)0U; i < (size_t)16U; i++) { repeat_expression[i] = libcrux_ml_kem_vector_portable_ZERO_b8(); } memcpy(lit.coefficients, repeat_expression, (size_t)16U * sizeof(libcrux_ml_kem_vector_portable_vector_type_PortableVector)); return lit; } /** Given two `KyberPolynomialRingElement`s in their NTT representations, compute their product. Given two polynomials in the NTT domain `f^` and `ĵ`, the `iᵗʰ` coefficient of the product `k̂` is determined by the calculation: ```plaintext ĥ[2·i] + ĥ[2·i + 1]X = (f^[2·i] + f^[2·i + 1]X)·(ĝ[2·i] + ĝ[2·i + 1]X) mod (X² - ζ^(2·BitRev₇(i) + 1)) ``` This function almost implements Algorithm 10 of the NIST FIPS 203 standard, which is reproduced below: ```plaintext Input: Two arrays fˆ ∈ ℤ₂₅₆ and ĝ ∈ ℤ₂₅₆. Output: An array ĥ ∈ ℤq. for(i ← 0; i < 128; i++) (ĥ[2i], ĥ[2i+1]) ← BaseCaseMultiply(fˆ[2i], fˆ[2i+1], ĝ[2i], ĝ[2i+1], ζ^(2·BitRev₇(i) + 1)) end for return ĥ ``` We say "almost" because the coefficients of the ring element output by this function are in the Montgomery domain. The NIST FIPS 203 standard can be found at . */ /** A monomorphic instance of libcrux_ml_kem.polynomial.ntt_multiply with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_polynomial_ntt_multiply_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *myself, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *rhs) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d out = libcrux_ml_kem_polynomial_ZERO_ea(); for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT; i++) { size_t i0 = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_ntt_multiply_b8( &myself->coefficients[i0], &rhs->coefficients[i0], libcrux_ml_kem_polynomial_zeta((size_t)64U + (size_t)4U * i0), libcrux_ml_kem_polynomial_zeta((size_t)64U + (size_t)4U * i0 + (size_t)1U), libcrux_ml_kem_polynomial_zeta((size_t)64U + (size_t)4U * i0 + (size_t)2U), libcrux_ml_kem_polynomial_zeta((size_t)64U + (size_t)4U * i0 + (size_t)3U)); out.coefficients[i0] = uu____0; } return out; } /** This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.ntt_multiply_d6 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_polynomial_ntt_multiply_d6_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *self, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *rhs) { return libcrux_ml_kem_polynomial_ntt_multiply_ea(self, rhs); } /** Given two polynomial ring elements `lhs` and `rhs`, compute the pointwise sum of their constituent coefficients. */ /** A monomorphic instance of libcrux_ml_kem.polynomial.add_to_ring_element with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_polynomial_add_to_ring_element_1b( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *myself, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *rhs) { for (size_t i = (size_t)0U; i < Eurydice_slice_len( Eurydice_array_to_slice( (size_t)16U, myself->coefficients, libcrux_ml_kem_vector_portable_vector_type_PortableVector), libcrux_ml_kem_vector_portable_vector_type_PortableVector); i++) { size_t i0 = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_add_b8(myself->coefficients[i0], &rhs->coefficients[i0]); myself->coefficients[i0] = uu____0; } } /** This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.add_to_ring_element_d6 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_polynomial_add_to_ring_element_d6_1b( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *self, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *rhs) { libcrux_ml_kem_polynomial_add_to_ring_element_1b(self, rhs); } /** A monomorphic instance of libcrux_ml_kem.invert_ntt.invert_ntt_at_layer_1 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_1_ea( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re) { for (size_t i = (size_t)0U; i < (size_t)16U; i++) { size_t round = i; zeta_i[0U] = zeta_i[0U] - (size_t)1U; re->coefficients[round] = libcrux_ml_kem_vector_portable_inv_ntt_layer_1_step_b8( re->coefficients[round], libcrux_ml_kem_polynomial_zeta(zeta_i[0U]), libcrux_ml_kem_polynomial_zeta(zeta_i[0U] - (size_t)1U), libcrux_ml_kem_polynomial_zeta(zeta_i[0U] - (size_t)2U), libcrux_ml_kem_polynomial_zeta(zeta_i[0U] - (size_t)3U)); zeta_i[0U] = zeta_i[0U] - (size_t)3U; } } /** A monomorphic instance of libcrux_ml_kem.invert_ntt.invert_ntt_at_layer_2 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_2_ea( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re) { for (size_t i = (size_t)0U; i < (size_t)16U; i++) { size_t round = i; zeta_i[0U] = zeta_i[0U] - (size_t)1U; re->coefficients[round] = libcrux_ml_kem_vector_portable_inv_ntt_layer_2_step_b8( re->coefficients[round], libcrux_ml_kem_polynomial_zeta(zeta_i[0U]), libcrux_ml_kem_polynomial_zeta(zeta_i[0U] - (size_t)1U)); zeta_i[0U] = zeta_i[0U] - (size_t)1U; } } /** A monomorphic instance of libcrux_ml_kem.invert_ntt.invert_ntt_at_layer_3 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_3_ea( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re) { for (size_t i = (size_t)0U; i < (size_t)16U; i++) { size_t round = i; zeta_i[0U] = zeta_i[0U] - (size_t)1U; libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_inv_ntt_layer_3_step_b8( re->coefficients[round], libcrux_ml_kem_polynomial_zeta(zeta_i[0U])); re->coefficients[round] = uu____0; } } /** A monomorphic instance of libcrux_ml_kem.invert_ntt.inv_ntt_layer_int_vec_step_reduce with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector_x2 libcrux_ml_kem_invert_ntt_inv_ntt_layer_int_vec_step_reduce_ea( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, libcrux_ml_kem_vector_portable_vector_type_PortableVector b, int16_t zeta_r) { libcrux_ml_kem_vector_portable_vector_type_PortableVector a_minus_b = libcrux_ml_kem_vector_portable_sub_b8(b, &a); a = libcrux_ml_kem_vector_portable_barrett_reduce_b8( libcrux_ml_kem_vector_portable_add_b8(a, &b)); b = libcrux_ml_kem_vector_portable_montgomery_multiply_by_constant_b8( a_minus_b, zeta_r); return (KRML_CLITERAL( libcrux_ml_kem_vector_portable_vector_type_PortableVector_x2){.fst = a, .snd = b}); } /** A monomorphic instance of libcrux_ml_kem.invert_ntt.invert_ntt_at_layer_4_plus with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_4_plus_ea( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re, size_t layer) { size_t step = (size_t)1U << (uint32_t)layer; for (size_t i0 = (size_t)0U; i0 < (size_t)128U >> (uint32_t)layer; i0++) { size_t round = i0; zeta_i[0U] = zeta_i[0U] - (size_t)1U; size_t offset = round * step * (size_t)2U; size_t offset_vec = offset / LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; size_t step_vec = step / LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; for (size_t i = offset_vec; i < offset_vec + step_vec; i++) { size_t j = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector_x2 uu____0 = libcrux_ml_kem_invert_ntt_inv_ntt_layer_int_vec_step_reduce_ea( re->coefficients[j], re->coefficients[j + step_vec], libcrux_ml_kem_polynomial_zeta(zeta_i[0U])); libcrux_ml_kem_vector_portable_vector_type_PortableVector x = uu____0.fst; libcrux_ml_kem_vector_portable_vector_type_PortableVector y = uu____0.snd; re->coefficients[j] = x; re->coefficients[j + step_vec] = y; } } } /** A monomorphic instance of libcrux_ml_kem.invert_ntt.invert_ntt_montgomery with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_invert_ntt_invert_ntt_montgomery_1b( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re) { size_t zeta_i = LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT / (size_t)2U; libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_1_ea(&zeta_i, re); libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_2_ea(&zeta_i, re); libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_3_ea(&zeta_i, re); libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_4_plus_ea(&zeta_i, re, (size_t)4U); libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_4_plus_ea(&zeta_i, re, (size_t)5U); libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_4_plus_ea(&zeta_i, re, (size_t)6U); libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_4_plus_ea(&zeta_i, re, (size_t)7U); libcrux_ml_kem_polynomial_poly_barrett_reduce_d6_ea(re); } /** A monomorphic instance of libcrux_ml_kem.polynomial.subtract_reduce with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_polynomial_subtract_reduce_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *myself, libcrux_ml_kem_polynomial_PolynomialRingElement_1d b) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT; i++) { size_t i0 = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient_normal_form = libcrux_ml_kem_vector_portable_montgomery_multiply_by_constant_b8( b.coefficients[i0], (int16_t)1441); libcrux_ml_kem_vector_portable_vector_type_PortableVector diff = libcrux_ml_kem_vector_portable_sub_b8(myself->coefficients[i0], &coefficient_normal_form); libcrux_ml_kem_vector_portable_vector_type_PortableVector red = libcrux_ml_kem_vector_portable_barrett_reduce_b8(diff); b.coefficients[i0] = red; } return b; } /** This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.subtract_reduce_d6 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_polynomial_subtract_reduce_d6_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *self, libcrux_ml_kem_polynomial_PolynomialRingElement_1d b) { return libcrux_ml_kem_polynomial_subtract_reduce_ea(self, b); } /** The following functions compute various expressions involving vectors and matrices. The computation of these expressions has been abstracted away into these functions in order to save on loop iterations. Compute v − InverseNTT(sᵀ ◦ NTT(u)) */ /** A monomorphic instance of libcrux_ml_kem.matrix.compute_message with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_matrix_compute_message_1b( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *v, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *secret_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *u_as_ntt) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d result = libcrux_ml_kem_polynomial_ZERO_d6_ea(); for (size_t i = (size_t)0U; i < (size_t)3U; i++) { size_t i0 = i; libcrux_ml_kem_polynomial_PolynomialRingElement_1d product = libcrux_ml_kem_polynomial_ntt_multiply_d6_ea(&secret_as_ntt[i0], &u_as_ntt[i0]); libcrux_ml_kem_polynomial_add_to_ring_element_d6_1b(&result, &product); } libcrux_ml_kem_invert_ntt_invert_ntt_montgomery_1b(&result); return libcrux_ml_kem_polynomial_subtract_reduce_d6_ea(v, result); } /** A monomorphic instance of libcrux_ml_kem.serialize.to_unsigned_field_modulus with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_serialize_to_unsigned_field_modulus_ea( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { return libcrux_ml_kem_vector_portable_to_unsigned_representative_b8(a); } /** A monomorphic instance of libcrux_ml_kem.serialize.compress_then_serialize_message with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_serialize_compress_then_serialize_message_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d re, uint8_t ret[32U]) { uint8_t serialized[32U] = {0U}; for (size_t i = (size_t)0U; i < (size_t)16U; i++) { size_t i0 = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient = libcrux_ml_kem_serialize_to_unsigned_field_modulus_ea( re.coefficients[i0]); libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient_compressed = libcrux_ml_kem_vector_portable_compress_1_b8(coefficient); uint8_t bytes[2U]; libcrux_ml_kem_vector_portable_serialize_1_b8(coefficient_compressed, bytes); Eurydice_slice_copy( Eurydice_array_to_subslice3(serialized, (size_t)2U * i0, (size_t)2U * i0 + (size_t)2U, uint8_t *), Eurydice_array_to_slice((size_t)2U, bytes, uint8_t), uint8_t); } memcpy(ret, serialized, (size_t)32U * sizeof(uint8_t)); } /** This function implements Algorithm 14 of the NIST FIPS 203 specification; this is the Kyber CPA-PKE decryption algorithm. Algorithm 14 is reproduced below: ```plaintext Input: decryption key dkₚₖₑ ∈ 𝔹^{384k}. Input: ciphertext c ∈ 𝔹^{32(dᵤk + dᵥ)}. Output: message m ∈ 𝔹^{32}. c₁ ← c[0 : 32dᵤk] c₂ ← c[32dᵤk : 32(dᵤk + dᵥ)] u ← Decompress_{dᵤ}(ByteDecode_{dᵤ}(c₁)) v ← Decompress_{dᵥ}(ByteDecode_{dᵥ}(c₂)) ŝ ← ByteDecode₁₂(dkₚₖₑ) w ← v - NTT-¹(ŝᵀ ◦ NTT(u)) m ← ByteEncode₁(Compress₁(w)) return m ``` The NIST FIPS 203 standard can be found at . */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.decrypt_unpacked with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - CIPHERTEXT_SIZE= 1088 - VECTOR_U_ENCODED_SIZE= 960 - U_COMPRESSION_FACTOR= 10 - V_COMPRESSION_FACTOR= 4 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_decrypt_unpacked_42( libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_a0 *secret_key, uint8_t *ciphertext, uint8_t ret[32U]) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d u_as_ntt[3U]; libcrux_ml_kem_ind_cpa_deserialize_then_decompress_u_6c(ciphertext, u_as_ntt); libcrux_ml_kem_polynomial_PolynomialRingElement_1d v = libcrux_ml_kem_serialize_deserialize_then_decompress_ring_element_v_89( Eurydice_array_to_subslice_from((size_t)1088U, ciphertext, (size_t)960U, uint8_t, size_t, uint8_t[])); libcrux_ml_kem_polynomial_PolynomialRingElement_1d message = libcrux_ml_kem_matrix_compute_message_1b(&v, secret_key->secret_as_ntt, u_as_ntt); uint8_t ret0[32U]; libcrux_ml_kem_serialize_compress_then_serialize_message_ea(message, ret0); memcpy(ret, ret0, (size_t)32U * sizeof(uint8_t)); } /** A monomorphic instance of libcrux_ml_kem.ind_cpa.decrypt with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - CIPHERTEXT_SIZE= 1088 - VECTOR_U_ENCODED_SIZE= 960 - U_COMPRESSION_FACTOR= 10 - V_COMPRESSION_FACTOR= 4 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_decrypt_42( Eurydice_slice secret_key, uint8_t *ciphertext, uint8_t ret[32U]) { libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_a0 secret_key_unpacked; libcrux_ml_kem_polynomial_PolynomialRingElement_1d ret0[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { /* original Rust expression is not an lvalue in C */ void *lvalue = (void *)0U; ret0[i] = libcrux_ml_kem_ind_cpa_decrypt_call_mut_0b_42(&lvalue, i); } memcpy( secret_key_unpacked.secret_as_ntt, ret0, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); libcrux_ml_kem_ind_cpa_deserialize_vector_1b( secret_key, secret_key_unpacked.secret_as_ntt); uint8_t ret1[32U]; libcrux_ml_kem_ind_cpa_decrypt_unpacked_42(&secret_key_unpacked, ciphertext, ret1); memcpy(ret, ret1, (size_t)32U * sizeof(uint8_t)); } /** This function found in impl {libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash} */ /** A monomorphic instance of libcrux_ml_kem.hash_functions.portable.G_4a with const generics - K= 3 */ static inline void libcrux_ml_kem_hash_functions_portable_G_4a_e0( Eurydice_slice input, uint8_t ret[64U]) { libcrux_ml_kem_hash_functions_portable_G(input, ret); } /** A monomorphic instance of libcrux_ml_kem.hash_functions.portable.PRF with const generics - LEN= 32 */ static inline void libcrux_ml_kem_hash_functions_portable_PRF_9e( Eurydice_slice input, uint8_t ret[32U]) { uint8_t digest[32U] = {0U}; libcrux_sha3_portable_shake256( Eurydice_array_to_slice((size_t)32U, digest, uint8_t), input); memcpy(ret, digest, (size_t)32U * sizeof(uint8_t)); } /** This function found in impl {libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash} */ /** A monomorphic instance of libcrux_ml_kem.hash_functions.portable.PRF_4a with const generics - K= 3 - LEN= 32 */ static inline void libcrux_ml_kem_hash_functions_portable_PRF_4a_41( Eurydice_slice input, uint8_t ret[32U]) { libcrux_ml_kem_hash_functions_portable_PRF_9e(input, ret); } /** A monomorphic instance of libcrux_ml_kem.ind_cpa.unpacked.IndCpaPublicKeyUnpacked with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - $3size_t */ typedef struct libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0_s { libcrux_ml_kem_polynomial_PolynomialRingElement_1d t_as_ntt[3U]; uint8_t seed_for_A[32U]; libcrux_ml_kem_polynomial_PolynomialRingElement_1d A[3U][3U]; } libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0; /** This function found in impl {core::default::Default for libcrux_ml_kem::ind_cpa::unpacked::IndCpaPublicKeyUnpacked[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.unpacked.default_8b with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static inline libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 libcrux_ml_kem_ind_cpa_unpacked_default_8b_1b(void) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d uu____0[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { uu____0[i] = libcrux_ml_kem_polynomial_ZERO_d6_ea(); } uint8_t uu____1[32U] = {0U}; libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 lit; memcpy( lit.t_as_ntt, uu____0, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); memcpy(lit.seed_for_A, uu____1, (size_t)32U * sizeof(uint8_t)); libcrux_ml_kem_polynomial_PolynomialRingElement_1d repeat_expression0[3U][3U]; for (size_t i0 = (size_t)0U; i0 < (size_t)3U; i0++) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d repeat_expression[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { repeat_expression[i] = libcrux_ml_kem_polynomial_ZERO_d6_ea(); } memcpy(repeat_expression0[i0], repeat_expression, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); } memcpy(lit.A, repeat_expression0, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U])); return lit; } /** Only use with public values. This MUST NOT be used with secret inputs, like its caller `deserialize_ring_elements_reduced`. */ /** A monomorphic instance of libcrux_ml_kem.serialize.deserialize_to_reduced_ring_element with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_serialize_deserialize_to_reduced_ring_element_ea( Eurydice_slice serialized) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d re = libcrux_ml_kem_polynomial_ZERO_d6_ea(); for (size_t i = (size_t)0U; i < Eurydice_slice_len(serialized, uint8_t) / (size_t)24U; i++) { size_t i0 = i; Eurydice_slice bytes = Eurydice_slice_subslice3(serialized, i0 * (size_t)24U, i0 * (size_t)24U + (size_t)24U, uint8_t *); libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient = libcrux_ml_kem_vector_portable_deserialize_12_b8(bytes); libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_cond_subtract_3329_b8(coefficient); re.coefficients[i0] = uu____0; } return re; } /** See [deserialize_ring_elements_reduced_out]. */ /** A monomorphic instance of libcrux_ml_kem.serialize.deserialize_ring_elements_reduced with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_1b( Eurydice_slice public_key, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *deserialized_pk) { for (size_t i = (size_t)0U; i < Eurydice_slice_len(public_key, uint8_t) / LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT; i++) { size_t i0 = i; Eurydice_slice ring_element = Eurydice_slice_subslice3( public_key, i0 * LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT, i0 * LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT + LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT, uint8_t *); libcrux_ml_kem_polynomial_PolynomialRingElement_1d uu____0 = libcrux_ml_kem_serialize_deserialize_to_reduced_ring_element_ea( ring_element); deserialized_pk[i0] = uu____0; } } /** A monomorphic instance of libcrux_ml_kem.hash_functions.portable.PortableHash with const generics - $3size_t */ typedef struct libcrux_ml_kem_hash_functions_portable_PortableHash_88_s { libcrux_sha3_generic_keccak_KeccakState_17 shake128_state[3U]; } libcrux_ml_kem_hash_functions_portable_PortableHash_88; /** A monomorphic instance of libcrux_ml_kem.hash_functions.portable.shake128_init_absorb_final with const generics - K= 3 */ static inline libcrux_ml_kem_hash_functions_portable_PortableHash_88 libcrux_ml_kem_hash_functions_portable_shake128_init_absorb_final_e0( uint8_t (*input)[34U]) { libcrux_ml_kem_hash_functions_portable_PortableHash_88 shake128_state; libcrux_sha3_generic_keccak_KeccakState_17 repeat_expression[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { repeat_expression[i] = libcrux_sha3_portable_incremental_shake128_init(); } memcpy(shake128_state.shake128_state, repeat_expression, (size_t)3U * sizeof(libcrux_sha3_generic_keccak_KeccakState_17)); for (size_t i = (size_t)0U; i < (size_t)3U; i++) { size_t i0 = i; libcrux_sha3_portable_incremental_shake128_absorb_final( &shake128_state.shake128_state[i0], Eurydice_array_to_slice((size_t)34U, input[i0], uint8_t)); } return shake128_state; } /** This function found in impl {libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash} */ /** A monomorphic instance of libcrux_ml_kem.hash_functions.portable.shake128_init_absorb_final_4a with const generics - K= 3 */ static inline libcrux_ml_kem_hash_functions_portable_PortableHash_88 libcrux_ml_kem_hash_functions_portable_shake128_init_absorb_final_4a_e0( uint8_t (*input)[34U]) { return libcrux_ml_kem_hash_functions_portable_shake128_init_absorb_final_e0( input); } /** A monomorphic instance of libcrux_ml_kem.hash_functions.portable.shake128_squeeze_first_three_blocks with const generics - K= 3 */ static inline void libcrux_ml_kem_hash_functions_portable_shake128_squeeze_first_three_blocks_e0( libcrux_ml_kem_hash_functions_portable_PortableHash_88 *st, uint8_t ret[3U][504U]) { uint8_t out[3U][504U] = {{0U}}; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { size_t i0 = i; libcrux_sha3_portable_incremental_shake128_squeeze_first_three_blocks( &st->shake128_state[i0], Eurydice_array_to_slice((size_t)504U, out[i0], uint8_t)); } memcpy(ret, out, (size_t)3U * sizeof(uint8_t[504U])); } /** This function found in impl {libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash} */ /** A monomorphic instance of libcrux_ml_kem.hash_functions.portable.shake128_squeeze_first_three_blocks_4a with const generics - K= 3 */ static inline void libcrux_ml_kem_hash_functions_portable_shake128_squeeze_first_three_blocks_4a_e0( libcrux_ml_kem_hash_functions_portable_PortableHash_88 *self, uint8_t ret[3U][504U]) { libcrux_ml_kem_hash_functions_portable_shake128_squeeze_first_three_blocks_e0( self, ret); } /** If `bytes` contains a set of uniformly random bytes, this function uniformly samples a ring element `â` that is treated as being the NTT representation of the corresponding polynomial `a`. Since rejection sampling is used, it is possible the supplied bytes are not enough to sample the element, in which case an `Err` is returned and the caller must try again with a fresh set of bytes. This function partially implements Algorithm 6 of the NIST FIPS 203 standard, We say "partially" because this implementation only accepts a finite set of bytes as input and returns an error if the set is not enough; Algorithm 6 of the FIPS 203 standard on the other hand samples from an infinite stream of bytes until the ring element is filled. Algorithm 6 is reproduced below: ```plaintext Input: byte stream B ∈ 𝔹*. Output: array â ∈ ℤ₂₅₆. i ← 0 j ← 0 while j < 256 do d₁ ← B[i] + 256·(B[i+1] mod 16) d₂ ← ⌊B[i+1]/16⌋ + 16·B[i+2] if d₁ < q then â[j] ← d₁ j ← j + 1 end if if d₂ < q and j < 256 then â[j] ← d₂ j ← j + 1 end if i ← i + 3 end while return â ``` The NIST FIPS 203 standard can be found at . */ /** A monomorphic instance of libcrux_ml_kem.sampling.sample_from_uniform_distribution_next with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - N= 504 */ static KRML_MUSTINLINE bool libcrux_ml_kem_sampling_sample_from_uniform_distribution_next_89( uint8_t (*randomness)[504U], size_t *sampled_coefficients, int16_t (*out)[272U]) { for (size_t i0 = (size_t)0U; i0 < (size_t)3U; i0++) { size_t i1 = i0; for (size_t i = (size_t)0U; i < (size_t)504U / (size_t)24U; i++) { size_t r = i; if (sampled_coefficients[i1] < LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT) { size_t sampled = libcrux_ml_kem_vector_portable_rej_sample_b8( Eurydice_array_to_subslice3(randomness[i1], r * (size_t)24U, r * (size_t)24U + (size_t)24U, uint8_t *), Eurydice_array_to_subslice3(out[i1], sampled_coefficients[i1], sampled_coefficients[i1] + (size_t)16U, int16_t *)); size_t uu____0 = i1; sampled_coefficients[uu____0] = sampled_coefficients[uu____0] + sampled; } } } bool done = true; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { size_t i0 = i; if (sampled_coefficients[i0] >= LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT) { sampled_coefficients[i0] = LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT; } else { done = false; } } return done; } /** A monomorphic instance of libcrux_ml_kem.hash_functions.portable.shake128_squeeze_next_block with const generics - K= 3 */ static inline void libcrux_ml_kem_hash_functions_portable_shake128_squeeze_next_block_e0( libcrux_ml_kem_hash_functions_portable_PortableHash_88 *st, uint8_t ret[3U][168U]) { uint8_t out[3U][168U] = {{0U}}; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { size_t i0 = i; libcrux_sha3_portable_incremental_shake128_squeeze_next_block( &st->shake128_state[i0], Eurydice_array_to_slice((size_t)168U, out[i0], uint8_t)); } memcpy(ret, out, (size_t)3U * sizeof(uint8_t[168U])); } /** This function found in impl {libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash} */ /** A monomorphic instance of libcrux_ml_kem.hash_functions.portable.shake128_squeeze_next_block_4a with const generics - K= 3 */ static inline void libcrux_ml_kem_hash_functions_portable_shake128_squeeze_next_block_4a_e0( libcrux_ml_kem_hash_functions_portable_PortableHash_88 *self, uint8_t ret[3U][168U]) { libcrux_ml_kem_hash_functions_portable_shake128_squeeze_next_block_e0(self, ret); } /** If `bytes` contains a set of uniformly random bytes, this function uniformly samples a ring element `â` that is treated as being the NTT representation of the corresponding polynomial `a`. Since rejection sampling is used, it is possible the supplied bytes are not enough to sample the element, in which case an `Err` is returned and the caller must try again with a fresh set of bytes. This function partially implements Algorithm 6 of the NIST FIPS 203 standard, We say "partially" because this implementation only accepts a finite set of bytes as input and returns an error if the set is not enough; Algorithm 6 of the FIPS 203 standard on the other hand samples from an infinite stream of bytes until the ring element is filled. Algorithm 6 is reproduced below: ```plaintext Input: byte stream B ∈ 𝔹*. Output: array â ∈ ℤ₂₅₆. i ← 0 j ← 0 while j < 256 do d₁ ← B[i] + 256·(B[i+1] mod 16) d₂ ← ⌊B[i+1]/16⌋ + 16·B[i+2] if d₁ < q then â[j] ← d₁ j ← j + 1 end if if d₂ < q and j < 256 then â[j] ← d₂ j ← j + 1 end if i ← i + 3 end while return â ``` The NIST FIPS 203 standard can be found at . */ /** A monomorphic instance of libcrux_ml_kem.sampling.sample_from_uniform_distribution_next with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - N= 168 */ static KRML_MUSTINLINE bool libcrux_ml_kem_sampling_sample_from_uniform_distribution_next_890( uint8_t (*randomness)[168U], size_t *sampled_coefficients, int16_t (*out)[272U]) { for (size_t i0 = (size_t)0U; i0 < (size_t)3U; i0++) { size_t i1 = i0; for (size_t i = (size_t)0U; i < (size_t)168U / (size_t)24U; i++) { size_t r = i; if (sampled_coefficients[i1] < LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT) { size_t sampled = libcrux_ml_kem_vector_portable_rej_sample_b8( Eurydice_array_to_subslice3(randomness[i1], r * (size_t)24U, r * (size_t)24U + (size_t)24U, uint8_t *), Eurydice_array_to_subslice3(out[i1], sampled_coefficients[i1], sampled_coefficients[i1] + (size_t)16U, int16_t *)); size_t uu____0 = i1; sampled_coefficients[uu____0] = sampled_coefficients[uu____0] + sampled; } } } bool done = true; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { size_t i0 = i; if (sampled_coefficients[i0] >= LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT) { sampled_coefficients[i0] = LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT; } else { done = false; } } return done; } /** A monomorphic instance of libcrux_ml_kem.polynomial.from_i16_array with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_polynomial_from_i16_array_ea(Eurydice_slice a) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d result = libcrux_ml_kem_polynomial_ZERO_ea(); for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT; i++) { size_t i0 = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_from_i16_array_b8( Eurydice_slice_subslice3(a, i0 * (size_t)16U, (i0 + (size_t)1U) * (size_t)16U, int16_t *)); result.coefficients[i0] = uu____0; } return result; } /** This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.from_i16_array_d6 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_polynomial_from_i16_array_d6_ea(Eurydice_slice a) { return libcrux_ml_kem_polynomial_from_i16_array_ea(a); } /** This function found in impl {core::ops::function::FnMut<(@@Array), libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@2]> for libcrux_ml_kem::sampling::sample_from_xof::closure[TraitClause@@0, TraitClause@@1, TraitClause@@2, TraitClause@@3]} */ /** A monomorphic instance of libcrux_ml_kem.sampling.sample_from_xof.call_mut_e7 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 */ static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_sampling_sample_from_xof_call_mut_e7_2b( void **_, int16_t tupled_args[272U]) { int16_t s[272U]; memcpy(s, tupled_args, (size_t)272U * sizeof(int16_t)); return libcrux_ml_kem_polynomial_from_i16_array_d6_ea( Eurydice_array_to_subslice3(s, (size_t)0U, (size_t)256U, int16_t *)); } /** A monomorphic instance of libcrux_ml_kem.sampling.sample_from_xof with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_sampling_sample_from_xof_2b( uint8_t (*seeds)[34U], libcrux_ml_kem_polynomial_PolynomialRingElement_1d ret[3U]) { size_t sampled_coefficients[3U] = {0U}; int16_t out[3U][272U] = {{0U}}; libcrux_ml_kem_hash_functions_portable_PortableHash_88 xof_state = libcrux_ml_kem_hash_functions_portable_shake128_init_absorb_final_4a_e0( seeds); uint8_t randomness0[3U][504U]; libcrux_ml_kem_hash_functions_portable_shake128_squeeze_first_three_blocks_4a_e0( &xof_state, randomness0); bool done = libcrux_ml_kem_sampling_sample_from_uniform_distribution_next_89( randomness0, sampled_coefficients, out); while (true) { if (done) { break; } else { uint8_t randomness[3U][168U]; libcrux_ml_kem_hash_functions_portable_shake128_squeeze_next_block_4a_e0( &xof_state, randomness); done = libcrux_ml_kem_sampling_sample_from_uniform_distribution_next_890( randomness, sampled_coefficients, out); } } /* Passing arrays by value in Rust generates a copy in C */ int16_t copy_of_out[3U][272U]; memcpy(copy_of_out, out, (size_t)3U * sizeof(int16_t[272U])); libcrux_ml_kem_polynomial_PolynomialRingElement_1d ret0[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { /* original Rust expression is not an lvalue in C */ void *lvalue = (void *)0U; ret0[i] = libcrux_ml_kem_sampling_sample_from_xof_call_mut_e7_2b( &lvalue, copy_of_out[i]); } memcpy( ret, ret0, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); } /** A monomorphic instance of libcrux_ml_kem.matrix.sample_matrix_A with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_matrix_sample_matrix_A_2b( libcrux_ml_kem_polynomial_PolynomialRingElement_1d (*A_transpose)[3U], uint8_t *seed, bool transpose) { for (size_t i0 = (size_t)0U; i0 < (size_t)3U; i0++) { size_t i1 = i0; uint8_t seeds[3U][34U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { core_array__core__clone__Clone_for__Array_T__N___clone( (size_t)34U, seed, seeds[i], uint8_t, void *); } for (size_t i = (size_t)0U; i < (size_t)3U; i++) { size_t j = i; seeds[j][32U] = (uint8_t)i1; seeds[j][33U] = (uint8_t)j; } libcrux_ml_kem_polynomial_PolynomialRingElement_1d sampled[3U]; libcrux_ml_kem_sampling_sample_from_xof_2b(seeds, sampled); for (size_t i = (size_t)0U; i < Eurydice_slice_len( Eurydice_array_to_slice( (size_t)3U, sampled, libcrux_ml_kem_polynomial_PolynomialRingElement_1d), libcrux_ml_kem_polynomial_PolynomialRingElement_1d); i++) { size_t j = i; libcrux_ml_kem_polynomial_PolynomialRingElement_1d sample = sampled[j]; if (transpose) { A_transpose[j][i1] = sample; } else { A_transpose[i1][j] = sample; } } } } /** A monomorphic instance of libcrux_ml_kem.ind_cpa.build_unpacked_public_key_mut with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - T_AS_NTT_ENCODED_SIZE= 1152 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_build_unpacked_public_key_mut_3f( Eurydice_slice public_key, libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 *unpacked_public_key) { Eurydice_slice uu____0 = Eurydice_slice_subslice_to( public_key, (size_t)1152U, uint8_t, size_t, uint8_t[]); libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_1b( uu____0, unpacked_public_key->t_as_ntt); Eurydice_slice seed = Eurydice_slice_subslice_from( public_key, (size_t)1152U, uint8_t, size_t, uint8_t[]); libcrux_ml_kem_polynomial_PolynomialRingElement_1d(*uu____1)[3U] = unpacked_public_key->A; uint8_t ret[34U]; libcrux_ml_kem_utils_into_padded_array_b6(seed, ret); libcrux_ml_kem_matrix_sample_matrix_A_2b(uu____1, ret, false); } /** A monomorphic instance of libcrux_ml_kem.ind_cpa.build_unpacked_public_key with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - T_AS_NTT_ENCODED_SIZE= 1152 */ static KRML_MUSTINLINE libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 libcrux_ml_kem_ind_cpa_build_unpacked_public_key_3f( Eurydice_slice public_key) { libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 unpacked_public_key = libcrux_ml_kem_ind_cpa_unpacked_default_8b_1b(); libcrux_ml_kem_ind_cpa_build_unpacked_public_key_mut_3f(public_key, &unpacked_public_key); return unpacked_public_key; } /** A monomorphic instance of K. with types libcrux_ml_kem_polynomial_PolynomialRingElement libcrux_ml_kem_vector_portable_vector_type_PortableVector[3size_t], libcrux_ml_kem_polynomial_PolynomialRingElement libcrux_ml_kem_vector_portable_vector_type_PortableVector */ typedef struct tuple_ed_s { libcrux_ml_kem_polynomial_PolynomialRingElement_1d fst[3U]; libcrux_ml_kem_polynomial_PolynomialRingElement_1d snd; } tuple_ed; /** This function found in impl {core::ops::function::FnMut<(usize), libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@2]> for libcrux_ml_kem::ind_cpa::encrypt_c1::closure[TraitClause@@0, TraitClause@@1, TraitClause@@2, TraitClause@@3]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.encrypt_c1.call_mut_f1 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - C1_LEN= 960 - U_COMPRESSION_FACTOR= 10 - BLOCK_LEN= 320 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 - ETA2= 2 - ETA2_RANDOMNESS_SIZE= 128 */ static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_ind_cpa_encrypt_c1_call_mut_f1_85(void **_, size_t tupled_args) { return libcrux_ml_kem_polynomial_ZERO_d6_ea(); } /** A monomorphic instance of libcrux_ml_kem.hash_functions.portable.PRFxN with const generics - K= 3 - LEN= 128 */ static inline void libcrux_ml_kem_hash_functions_portable_PRFxN_41( uint8_t (*input)[33U], uint8_t ret[3U][128U]) { uint8_t out[3U][128U] = {{0U}}; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { size_t i0 = i; libcrux_sha3_portable_shake256( Eurydice_array_to_slice((size_t)128U, out[i0], uint8_t), Eurydice_array_to_slice((size_t)33U, input[i0], uint8_t)); } memcpy(ret, out, (size_t)3U * sizeof(uint8_t[128U])); } /** This function found in impl {libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash} */ /** A monomorphic instance of libcrux_ml_kem.hash_functions.portable.PRFxN_4a with const generics - K= 3 - LEN= 128 */ static inline void libcrux_ml_kem_hash_functions_portable_PRFxN_4a_41( uint8_t (*input)[33U], uint8_t ret[3U][128U]) { libcrux_ml_kem_hash_functions_portable_PRFxN_41(input, ret); } /** Given a series of uniformly random bytes in `randomness`, for some number `eta`, the `sample_from_binomial_distribution_{eta}` functions sample a ring element from a binomial distribution centered at 0 that uses two sets of `eta` coin flips. If, for example, `eta = ETA`, each ring coefficient is a value `v` such such that `v ∈ {-ETA, -ETA + 1, ..., 0, ..., ETA + 1, ETA}` and: ```plaintext - If v < 0, Pr[v] = Pr[-v] - If v >= 0, Pr[v] = BINOMIAL_COEFFICIENT(2 * ETA; ETA - v) / 2 ^ (2 * ETA) ``` The values `v < 0` are mapped to the appropriate `KyberFieldElement`. The expected value is: ```plaintext E[X] = (-ETA)Pr[-ETA] + (-(ETA - 1))Pr[-(ETA - 1)] + ... + (ETA - 1)Pr[ETA - 1] + (ETA)Pr[ETA] = 0 since Pr[-v] = Pr[v] when v < 0. ``` And the variance is: ```plaintext Var(X) = E[(X - E[X])^2] = E[X^2] = sum_(v=-ETA to ETA)v^2 * (BINOMIAL_COEFFICIENT(2 * ETA; ETA - v) / 2^(2 * ETA)) = ETA / 2 ``` This function implements Algorithm 7 of the NIST FIPS 203 standard, which is reproduced below: ```plaintext Input: byte array B ∈ 𝔹^{64η}. Output: array f ∈ ℤ₂₅₆. b ← BytesToBits(B) for (i ← 0; i < 256; i++) x ← ∑(j=0 to η - 1) b[2iη + j] y ← ∑(j=0 to η - 1) b[2iη + η + j] f[i] ← x−y mod q end for return f ``` The NIST FIPS 203 standard can be found at . */ /** A monomorphic instance of libcrux_ml_kem.sampling.sample_from_binomial_distribution_2 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_sampling_sample_from_binomial_distribution_2_ea( Eurydice_slice randomness) { int16_t sampled_i16s[256U] = {0U}; for (size_t i0 = (size_t)0U; i0 < Eurydice_slice_len(randomness, uint8_t) / (size_t)4U; i0++) { size_t chunk_number = i0; Eurydice_slice byte_chunk = Eurydice_slice_subslice3( randomness, chunk_number * (size_t)4U, chunk_number * (size_t)4U + (size_t)4U, uint8_t *); uint32_t random_bits_as_u32 = (((uint32_t)Eurydice_slice_index(byte_chunk, (size_t)0U, uint8_t, uint8_t *) | (uint32_t)Eurydice_slice_index(byte_chunk, (size_t)1U, uint8_t, uint8_t *) << 8U) | (uint32_t)Eurydice_slice_index(byte_chunk, (size_t)2U, uint8_t, uint8_t *) << 16U) | (uint32_t)Eurydice_slice_index(byte_chunk, (size_t)3U, uint8_t, uint8_t *) << 24U; uint32_t even_bits = random_bits_as_u32 & 1431655765U; uint32_t odd_bits = random_bits_as_u32 >> 1U & 1431655765U; uint32_t coin_toss_outcomes = even_bits + odd_bits; for (uint32_t i = 0U; i < 32U / 4U; i++) { uint32_t outcome_set = i; uint32_t outcome_set0 = outcome_set * 4U; int16_t outcome_1 = (int16_t)(coin_toss_outcomes >> (uint32_t)outcome_set0 & 3U); int16_t outcome_2 = (int16_t)(coin_toss_outcomes >> (uint32_t)(outcome_set0 + 2U) & 3U); size_t offset = (size_t)(outcome_set0 >> 2U); sampled_i16s[(size_t)8U * chunk_number + offset] = outcome_1 - outcome_2; } } return libcrux_ml_kem_polynomial_from_i16_array_d6_ea( Eurydice_array_to_slice((size_t)256U, sampled_i16s, int16_t)); } /** A monomorphic instance of libcrux_ml_kem.sampling.sample_from_binomial_distribution with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - ETA= 2 */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_sampling_sample_from_binomial_distribution_a0( Eurydice_slice randomness) { return libcrux_ml_kem_sampling_sample_from_binomial_distribution_2_ea( randomness); } /** A monomorphic instance of libcrux_ml_kem.ntt.ntt_at_layer_7 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_ntt_ntt_at_layer_7_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re) { size_t step = LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT / (size_t)2U; for (size_t i = (size_t)0U; i < step; i++) { size_t j = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector t = libcrux_ml_kem_vector_portable_multiply_by_constant_b8( re->coefficients[j + step], (int16_t)-1600); re->coefficients[j + step] = libcrux_ml_kem_vector_portable_sub_b8(re->coefficients[j], &t); libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____1 = libcrux_ml_kem_vector_portable_add_b8(re->coefficients[j], &t); re->coefficients[j] = uu____1; } } /** A monomorphic instance of libcrux_ml_kem.ntt.ntt_binomially_sampled_ring_element with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_ntt_ntt_binomially_sampled_ring_element_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re) { libcrux_ml_kem_ntt_ntt_at_layer_7_ea(re); size_t zeta_i = (size_t)1U; libcrux_ml_kem_ntt_ntt_at_layer_4_plus_ea(&zeta_i, re, (size_t)6U, (size_t)11207U); libcrux_ml_kem_ntt_ntt_at_layer_4_plus_ea(&zeta_i, re, (size_t)5U, (size_t)11207U + (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_4_plus_ea( &zeta_i, re, (size_t)4U, (size_t)11207U + (size_t)2U * (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_3_ea( &zeta_i, re, (size_t)11207U + (size_t)3U * (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_2_ea( &zeta_i, re, (size_t)11207U + (size_t)4U * (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_1_ea( &zeta_i, re, (size_t)11207U + (size_t)5U * (size_t)3328U); libcrux_ml_kem_polynomial_poly_barrett_reduce_d6_ea(re); } /** Sample a vector of ring elements from a centered binomial distribution and convert them into their NTT representations. */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.sample_vector_cbd_then_ntt with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - ETA= 2 - ETA_RANDOMNESS_SIZE= 128 */ static KRML_MUSTINLINE uint8_t libcrux_ml_kem_ind_cpa_sample_vector_cbd_then_ntt_3b( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re_as_ntt, uint8_t *prf_input, uint8_t domain_separator) { uint8_t prf_inputs[3U][33U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { core_array__core__clone__Clone_for__Array_T__N___clone( (size_t)33U, prf_input, prf_inputs[i], uint8_t, void *); } domain_separator = libcrux_ml_kem_utils_prf_input_inc_e0(prf_inputs, domain_separator); uint8_t prf_outputs[3U][128U]; libcrux_ml_kem_hash_functions_portable_PRFxN_4a_41(prf_inputs, prf_outputs); for (size_t i = (size_t)0U; i < (size_t)3U; i++) { size_t i0 = i; re_as_ntt[i0] = libcrux_ml_kem_sampling_sample_from_binomial_distribution_a0( Eurydice_array_to_slice((size_t)128U, prf_outputs[i0], uint8_t)); libcrux_ml_kem_ntt_ntt_binomially_sampled_ring_element_ea(&re_as_ntt[i0]); } return domain_separator; } /** This function found in impl {core::ops::function::FnMut<(usize), libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@2]> for libcrux_ml_kem::ind_cpa::encrypt_c1::closure#1[TraitClause@@0, TraitClause@@1, TraitClause@@2, TraitClause@@3]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.encrypt_c1.call_mut_dd with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - C1_LEN= 960 - U_COMPRESSION_FACTOR= 10 - BLOCK_LEN= 320 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 - ETA2= 2 - ETA2_RANDOMNESS_SIZE= 128 */ static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_ind_cpa_encrypt_c1_call_mut_dd_85(void **_, size_t tupled_args) { return libcrux_ml_kem_polynomial_ZERO_d6_ea(); } /** Sample a vector of ring elements from a centered binomial distribution. */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.sample_ring_element_cbd with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - ETA2_RANDOMNESS_SIZE= 128 - ETA2= 2 */ static KRML_MUSTINLINE uint8_t libcrux_ml_kem_ind_cpa_sample_ring_element_cbd_3b( uint8_t *prf_input, uint8_t domain_separator, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *error_1) { uint8_t prf_inputs[3U][33U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { core_array__core__clone__Clone_for__Array_T__N___clone( (size_t)33U, prf_input, prf_inputs[i], uint8_t, void *); } domain_separator = libcrux_ml_kem_utils_prf_input_inc_e0(prf_inputs, domain_separator); uint8_t prf_outputs[3U][128U]; libcrux_ml_kem_hash_functions_portable_PRFxN_4a_41(prf_inputs, prf_outputs); for (size_t i = (size_t)0U; i < (size_t)3U; i++) { size_t i0 = i; libcrux_ml_kem_polynomial_PolynomialRingElement_1d uu____0 = libcrux_ml_kem_sampling_sample_from_binomial_distribution_a0( Eurydice_array_to_slice((size_t)128U, prf_outputs[i0], uint8_t)); error_1[i0] = uu____0; } return domain_separator; } /** A monomorphic instance of libcrux_ml_kem.hash_functions.portable.PRF with const generics - LEN= 128 */ static inline void libcrux_ml_kem_hash_functions_portable_PRF_a6( Eurydice_slice input, uint8_t ret[128U]) { uint8_t digest[128U] = {0U}; libcrux_sha3_portable_shake256( Eurydice_array_to_slice((size_t)128U, digest, uint8_t), input); memcpy(ret, digest, (size_t)128U * sizeof(uint8_t)); } /** This function found in impl {libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash} */ /** A monomorphic instance of libcrux_ml_kem.hash_functions.portable.PRF_4a with const generics - K= 3 - LEN= 128 */ static inline void libcrux_ml_kem_hash_functions_portable_PRF_4a_410( Eurydice_slice input, uint8_t ret[128U]) { libcrux_ml_kem_hash_functions_portable_PRF_a6(input, ret); } /** This function found in impl {core::ops::function::FnMut<(usize), libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]> for libcrux_ml_kem::matrix::compute_vector_u::closure[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.matrix.compute_vector_u.call_mut_a8 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_matrix_compute_vector_u_call_mut_a8_1b(void **_, size_t tupled_args) { return libcrux_ml_kem_polynomial_ZERO_d6_ea(); } /** A monomorphic instance of libcrux_ml_kem.polynomial.add_error_reduce with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_polynomial_add_error_reduce_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *myself, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *error) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT; i++) { size_t j = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient_normal_form = libcrux_ml_kem_vector_portable_montgomery_multiply_by_constant_b8( myself->coefficients[j], (int16_t)1441); libcrux_ml_kem_vector_portable_vector_type_PortableVector sum = libcrux_ml_kem_vector_portable_add_b8(coefficient_normal_form, &error->coefficients[j]); libcrux_ml_kem_vector_portable_vector_type_PortableVector red = libcrux_ml_kem_vector_portable_barrett_reduce_b8(sum); myself->coefficients[j] = red; } } /** This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.add_error_reduce_d6 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_polynomial_add_error_reduce_d6_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *self, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *error) { libcrux_ml_kem_polynomial_add_error_reduce_ea(self, error); } /** Compute u := InvertNTT(Aᵀ ◦ r̂) + e₁ */ /** A monomorphic instance of libcrux_ml_kem.matrix.compute_vector_u with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_matrix_compute_vector_u_1b( libcrux_ml_kem_polynomial_PolynomialRingElement_1d (*a_as_ntt)[3U], libcrux_ml_kem_polynomial_PolynomialRingElement_1d *r_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *error_1, libcrux_ml_kem_polynomial_PolynomialRingElement_1d ret[3U]) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d result[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { /* original Rust expression is not an lvalue in C */ void *lvalue = (void *)0U; result[i] = libcrux_ml_kem_matrix_compute_vector_u_call_mut_a8_1b(&lvalue, i); } for (size_t i0 = (size_t)0U; i0 < Eurydice_slice_len( Eurydice_array_to_slice( (size_t)3U, a_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U]), libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U]); i0++) { size_t i1 = i0; libcrux_ml_kem_polynomial_PolynomialRingElement_1d *row = a_as_ntt[i1]; for (size_t i = (size_t)0U; i < Eurydice_slice_len( Eurydice_array_to_slice( (size_t)3U, row, libcrux_ml_kem_polynomial_PolynomialRingElement_1d), libcrux_ml_kem_polynomial_PolynomialRingElement_1d); i++) { size_t j = i; libcrux_ml_kem_polynomial_PolynomialRingElement_1d *a_element = &row[j]; libcrux_ml_kem_polynomial_PolynomialRingElement_1d product = libcrux_ml_kem_polynomial_ntt_multiply_d6_ea(a_element, &r_as_ntt[j]); libcrux_ml_kem_polynomial_add_to_ring_element_d6_1b(&result[i1], &product); } libcrux_ml_kem_invert_ntt_invert_ntt_montgomery_1b(&result[i1]); libcrux_ml_kem_polynomial_add_error_reduce_d6_ea(&result[i1], &error_1[i1]); } memcpy( ret, result, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); } /** A monomorphic instance of libcrux_ml_kem.vector.portable.compress.compress with const generics - COEFFICIENT_BITS= 10 */ static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_compress_compress_ef( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; int16_t uu____0 = libcrux_secrets_int_as_i16_f5( libcrux_ml_kem_vector_portable_compress_compress_ciphertext_coefficient( (uint8_t)(int32_t)10, libcrux_secrets_int_as_u16_f5(a.elements[i0]))); a.elements[i0] = uu____0; } return a; } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ /** A monomorphic instance of libcrux_ml_kem.vector.portable.compress_b8 with const generics - COEFFICIENT_BITS= 10 */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_compress_b8_ef( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { return libcrux_ml_kem_vector_portable_compress_compress_ef(a); } /** A monomorphic instance of libcrux_ml_kem.serialize.compress_then_serialize_10 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - OUT_LEN= 320 */ static KRML_MUSTINLINE void libcrux_ml_kem_serialize_compress_then_serialize_10_ff( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re, uint8_t ret[320U]) { uint8_t serialized[320U] = {0U}; for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT; i++) { size_t i0 = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient = libcrux_ml_kem_vector_portable_compress_b8_ef( libcrux_ml_kem_serialize_to_unsigned_field_modulus_ea( re->coefficients[i0])); uint8_t bytes[20U]; libcrux_ml_kem_vector_portable_serialize_10_b8(coefficient, bytes); Eurydice_slice_copy( Eurydice_array_to_subslice3(serialized, (size_t)20U * i0, (size_t)20U * i0 + (size_t)20U, uint8_t *), Eurydice_array_to_slice((size_t)20U, bytes, uint8_t), uint8_t); } memcpy(ret, serialized, (size_t)320U * sizeof(uint8_t)); } /** A monomorphic instance of libcrux_ml_kem.serialize.compress_then_serialize_ring_element_u with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - COMPRESSION_FACTOR= 10 - OUT_LEN= 320 */ static KRML_MUSTINLINE void libcrux_ml_kem_serialize_compress_then_serialize_ring_element_u_fe( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re, uint8_t ret[320U]) { uint8_t uu____0[320U]; libcrux_ml_kem_serialize_compress_then_serialize_10_ff(re, uu____0); memcpy(ret, uu____0, (size_t)320U * sizeof(uint8_t)); } /** Call [`compress_then_serialize_ring_element_u`] on each ring element. */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.compress_then_serialize_u with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - OUT_LEN= 960 - COMPRESSION_FACTOR= 10 - BLOCK_LEN= 320 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_compress_then_serialize_u_43( libcrux_ml_kem_polynomial_PolynomialRingElement_1d input[3U], Eurydice_slice out) { for (size_t i = (size_t)0U; i < Eurydice_slice_len( Eurydice_array_to_slice( (size_t)3U, input, libcrux_ml_kem_polynomial_PolynomialRingElement_1d), libcrux_ml_kem_polynomial_PolynomialRingElement_1d); i++) { size_t i0 = i; libcrux_ml_kem_polynomial_PolynomialRingElement_1d re = input[i0]; Eurydice_slice uu____0 = Eurydice_slice_subslice3( out, i0 * ((size_t)960U / (size_t)3U), (i0 + (size_t)1U) * ((size_t)960U / (size_t)3U), uint8_t *); uint8_t ret[320U]; libcrux_ml_kem_serialize_compress_then_serialize_ring_element_u_fe(&re, ret); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)320U, ret, uint8_t), uint8_t); } } /** A monomorphic instance of libcrux_ml_kem.ind_cpa.encrypt_c1 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - C1_LEN= 960 - U_COMPRESSION_FACTOR= 10 - BLOCK_LEN= 320 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 - ETA2= 2 - ETA2_RANDOMNESS_SIZE= 128 */ static KRML_MUSTINLINE tuple_ed libcrux_ml_kem_ind_cpa_encrypt_c1_85( Eurydice_slice randomness, libcrux_ml_kem_polynomial_PolynomialRingElement_1d (*matrix)[3U], Eurydice_slice ciphertext) { uint8_t prf_input[33U]; libcrux_ml_kem_utils_into_padded_array_c8(randomness, prf_input); libcrux_ml_kem_polynomial_PolynomialRingElement_1d r_as_ntt[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { /* original Rust expression is not an lvalue in C */ void *lvalue = (void *)0U; r_as_ntt[i] = libcrux_ml_kem_ind_cpa_encrypt_c1_call_mut_f1_85(&lvalue, i); } uint8_t domain_separator0 = libcrux_ml_kem_ind_cpa_sample_vector_cbd_then_ntt_3b(r_as_ntt, prf_input, 0U); libcrux_ml_kem_polynomial_PolynomialRingElement_1d error_1[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { /* original Rust expression is not an lvalue in C */ void *lvalue = (void *)0U; error_1[i] = libcrux_ml_kem_ind_cpa_encrypt_c1_call_mut_dd_85(&lvalue, i); } uint8_t domain_separator = libcrux_ml_kem_ind_cpa_sample_ring_element_cbd_3b( prf_input, domain_separator0, error_1); prf_input[32U] = domain_separator; uint8_t prf_output[128U]; libcrux_ml_kem_hash_functions_portable_PRF_4a_410( Eurydice_array_to_slice((size_t)33U, prf_input, uint8_t), prf_output); libcrux_ml_kem_polynomial_PolynomialRingElement_1d error_2 = libcrux_ml_kem_sampling_sample_from_binomial_distribution_a0( Eurydice_array_to_slice((size_t)128U, prf_output, uint8_t)); libcrux_ml_kem_polynomial_PolynomialRingElement_1d u[3U]; libcrux_ml_kem_matrix_compute_vector_u_1b(matrix, r_as_ntt, error_1, u); libcrux_ml_kem_polynomial_PolynomialRingElement_1d uu____0[3U]; memcpy( uu____0, u, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); libcrux_ml_kem_ind_cpa_compress_then_serialize_u_43(uu____0, ciphertext); /* Passing arrays by value in Rust generates a copy in C */ libcrux_ml_kem_polynomial_PolynomialRingElement_1d copy_of_r_as_ntt[3U]; memcpy( copy_of_r_as_ntt, r_as_ntt, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); tuple_ed lit; memcpy( lit.fst, copy_of_r_as_ntt, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); lit.snd = error_2; return lit; } /** A monomorphic instance of libcrux_ml_kem.serialize.deserialize_then_decompress_message with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_serialize_deserialize_then_decompress_message_ea( uint8_t *serialized) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d re = libcrux_ml_kem_polynomial_ZERO_d6_ea(); for (size_t i = (size_t)0U; i < (size_t)16U; i++) { size_t i0 = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient_compressed = libcrux_ml_kem_vector_portable_deserialize_1_b8( Eurydice_array_to_subslice3(serialized, (size_t)2U * i0, (size_t)2U * i0 + (size_t)2U, uint8_t *)); libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_decompress_1_b8(coefficient_compressed); re.coefficients[i0] = uu____0; } return re; } /** A monomorphic instance of libcrux_ml_kem.polynomial.add_message_error_reduce with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_polynomial_add_message_error_reduce_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *myself, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *message, libcrux_ml_kem_polynomial_PolynomialRingElement_1d result) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT; i++) { size_t i0 = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient_normal_form = libcrux_ml_kem_vector_portable_montgomery_multiply_by_constant_b8( result.coefficients[i0], (int16_t)1441); libcrux_ml_kem_vector_portable_vector_type_PortableVector sum1 = libcrux_ml_kem_vector_portable_add_b8(myself->coefficients[i0], &message->coefficients[i0]); libcrux_ml_kem_vector_portable_vector_type_PortableVector sum2 = libcrux_ml_kem_vector_portable_add_b8(coefficient_normal_form, &sum1); libcrux_ml_kem_vector_portable_vector_type_PortableVector red = libcrux_ml_kem_vector_portable_barrett_reduce_b8(sum2); result.coefficients[i0] = red; } return result; } /** This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.add_message_error_reduce_d6 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_polynomial_add_message_error_reduce_d6_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *self, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *message, libcrux_ml_kem_polynomial_PolynomialRingElement_1d result) { return libcrux_ml_kem_polynomial_add_message_error_reduce_ea(self, message, result); } /** Compute InverseNTT(tᵀ ◦ r̂) + e₂ + message */ /** A monomorphic instance of libcrux_ml_kem.matrix.compute_ring_element_v with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_matrix_compute_ring_element_v_1b( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *t_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *r_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *error_2, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *message) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d result = libcrux_ml_kem_polynomial_ZERO_d6_ea(); for (size_t i = (size_t)0U; i < (size_t)3U; i++) { size_t i0 = i; libcrux_ml_kem_polynomial_PolynomialRingElement_1d product = libcrux_ml_kem_polynomial_ntt_multiply_d6_ea(&t_as_ntt[i0], &r_as_ntt[i0]); libcrux_ml_kem_polynomial_add_to_ring_element_d6_1b(&result, &product); } libcrux_ml_kem_invert_ntt_invert_ntt_montgomery_1b(&result); return libcrux_ml_kem_polynomial_add_message_error_reduce_d6_ea( error_2, message, result); } /** A monomorphic instance of libcrux_ml_kem.vector.portable.compress.compress with const generics - COEFFICIENT_BITS= 4 */ static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_compress_compress_d1( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; int16_t uu____0 = libcrux_secrets_int_as_i16_f5( libcrux_ml_kem_vector_portable_compress_compress_ciphertext_coefficient( (uint8_t)(int32_t)4, libcrux_secrets_int_as_u16_f5(a.elements[i0]))); a.elements[i0] = uu____0; } return a; } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ /** A monomorphic instance of libcrux_ml_kem.vector.portable.compress_b8 with const generics - COEFFICIENT_BITS= 4 */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_compress_b8_d1( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { return libcrux_ml_kem_vector_portable_compress_compress_d1(a); } /** A monomorphic instance of libcrux_ml_kem.serialize.compress_then_serialize_4 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_serialize_compress_then_serialize_4_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d re, Eurydice_slice serialized) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT; i++) { size_t i0 = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient = libcrux_ml_kem_vector_portable_compress_b8_d1( libcrux_ml_kem_serialize_to_unsigned_field_modulus_ea( re.coefficients[i0])); uint8_t bytes[8U]; libcrux_ml_kem_vector_portable_serialize_4_b8(coefficient, bytes); Eurydice_slice_copy( Eurydice_slice_subslice3(serialized, (size_t)8U * i0, (size_t)8U * i0 + (size_t)8U, uint8_t *), Eurydice_array_to_slice((size_t)8U, bytes, uint8_t), uint8_t); } } /** A monomorphic instance of libcrux_ml_kem.serialize.compress_then_serialize_ring_element_v with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - COMPRESSION_FACTOR= 4 - OUT_LEN= 128 */ static KRML_MUSTINLINE void libcrux_ml_kem_serialize_compress_then_serialize_ring_element_v_6c( libcrux_ml_kem_polynomial_PolynomialRingElement_1d re, Eurydice_slice out) { libcrux_ml_kem_serialize_compress_then_serialize_4_ea(re, out); } /** A monomorphic instance of libcrux_ml_kem.ind_cpa.encrypt_c2 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - V_COMPRESSION_FACTOR= 4 - C2_LEN= 128 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_encrypt_c2_6c( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *t_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *r_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *error_2, uint8_t *message, Eurydice_slice ciphertext) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d message_as_ring_element = libcrux_ml_kem_serialize_deserialize_then_decompress_message_ea(message); libcrux_ml_kem_polynomial_PolynomialRingElement_1d v = libcrux_ml_kem_matrix_compute_ring_element_v_1b( t_as_ntt, r_as_ntt, error_2, &message_as_ring_element); libcrux_ml_kem_serialize_compress_then_serialize_ring_element_v_6c( v, ciphertext); } /** This function implements Algorithm 13 of the NIST FIPS 203 specification; this is the Kyber CPA-PKE encryption algorithm. Algorithm 13 is reproduced below: ```plaintext Input: encryption key ekₚₖₑ ∈ 𝔹^{384k+32}. Input: message m ∈ 𝔹^{32}. Input: encryption randomness r ∈ 𝔹^{32}. Output: ciphertext c ∈ 𝔹^{32(dᵤk + dᵥ)}. N ← 0 t̂ ← ByteDecode₁₂(ekₚₖₑ[0:384k]) ρ ← ekₚₖₑ[384k: 384k + 32] for (i ← 0; i < k; i++) for(j ← 0; j < k; j++) Â[i,j] ← SampleNTT(XOF(ρ, i, j)) end for end for for(i ← 0; i < k; i++) r[i] ← SamplePolyCBD_{η₁}(PRF_{η₁}(r,N)) N ← N + 1 end for for(i ← 0; i < k; i++) e₁[i] ← SamplePolyCBD_{η₂}(PRF_{η₂}(r,N)) N ← N + 1 end for e₂ ← SamplePolyCBD_{η₂}(PRF_{η₂}(r,N)) r̂ ← NTT(r) u ← NTT-¹(Âᵀ ◦ r̂) + e₁ μ ← Decompress₁(ByteDecode₁(m))) v ← NTT-¹(t̂ᵀ ◦ rˆ) + e₂ + μ c₁ ← ByteEncode_{dᵤ}(Compress_{dᵤ}(u)) c₂ ← ByteEncode_{dᵥ}(Compress_{dᵥ}(v)) return c ← (c₁ ‖ c₂) ``` The NIST FIPS 203 standard can be found at . */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.encrypt_unpacked with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - CIPHERTEXT_SIZE= 1088 - T_AS_NTT_ENCODED_SIZE= 1152 - C1_LEN= 960 - C2_LEN= 128 - U_COMPRESSION_FACTOR= 10 - V_COMPRESSION_FACTOR= 4 - BLOCK_LEN= 320 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 - ETA2= 2 - ETA2_RANDOMNESS_SIZE= 128 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_encrypt_unpacked_2a( libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 *public_key, uint8_t *message, Eurydice_slice randomness, uint8_t ret[1088U]) { uint8_t ciphertext[1088U] = {0U}; tuple_ed uu____0 = libcrux_ml_kem_ind_cpa_encrypt_c1_85( randomness, public_key->A, Eurydice_array_to_subslice3(ciphertext, (size_t)0U, (size_t)960U, uint8_t *)); libcrux_ml_kem_polynomial_PolynomialRingElement_1d r_as_ntt[3U]; memcpy( r_as_ntt, uu____0.fst, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); libcrux_ml_kem_polynomial_PolynomialRingElement_1d error_2 = uu____0.snd; libcrux_ml_kem_polynomial_PolynomialRingElement_1d *uu____1 = public_key->t_as_ntt; libcrux_ml_kem_polynomial_PolynomialRingElement_1d *uu____2 = r_as_ntt; libcrux_ml_kem_polynomial_PolynomialRingElement_1d *uu____3 = &error_2; uint8_t *uu____4 = message; libcrux_ml_kem_ind_cpa_encrypt_c2_6c( uu____1, uu____2, uu____3, uu____4, Eurydice_array_to_subslice_from((size_t)1088U, ciphertext, (size_t)960U, uint8_t, size_t, uint8_t[])); memcpy(ret, ciphertext, (size_t)1088U * sizeof(uint8_t)); } /** A monomorphic instance of libcrux_ml_kem.ind_cpa.encrypt with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - CIPHERTEXT_SIZE= 1088 - T_AS_NTT_ENCODED_SIZE= 1152 - C1_LEN= 960 - C2_LEN= 128 - U_COMPRESSION_FACTOR= 10 - V_COMPRESSION_FACTOR= 4 - BLOCK_LEN= 320 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 - ETA2= 2 - ETA2_RANDOMNESS_SIZE= 128 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_encrypt_2a( Eurydice_slice public_key, uint8_t *message, Eurydice_slice randomness, uint8_t ret[1088U]) { libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 unpacked_public_key = libcrux_ml_kem_ind_cpa_build_unpacked_public_key_3f(public_key); uint8_t ret0[1088U]; libcrux_ml_kem_ind_cpa_encrypt_unpacked_2a(&unpacked_public_key, message, randomness, ret0); memcpy(ret, ret0, (size_t)1088U * sizeof(uint8_t)); } /** This function found in impl {libcrux_ml_kem::variant::Variant for libcrux_ml_kem::variant::MlKem} */ /** A monomorphic instance of libcrux_ml_kem.variant.kdf_39 with types libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - CIPHERTEXT_SIZE= 1088 */ static KRML_MUSTINLINE void libcrux_ml_kem_variant_kdf_39_d6( Eurydice_slice shared_secret, uint8_t *_, uint8_t ret[32U]) { uint8_t out[32U] = {0U}; Eurydice_slice_copy(Eurydice_array_to_slice((size_t)32U, out, uint8_t), shared_secret, uint8_t); memcpy(ret, out, (size_t)32U * sizeof(uint8_t)); } /** This code verifies on some machines, runs out of memory on others */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.decapsulate with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]], libcrux_ml_kem_variant_MlKem with const generics - K= 3 - SECRET_KEY_SIZE= 2400 - CPA_SECRET_KEY_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 - CIPHERTEXT_SIZE= 1088 - T_AS_NTT_ENCODED_SIZE= 1152 - C1_SIZE= 960 - C2_SIZE= 128 - VECTOR_U_COMPRESSION_FACTOR= 10 - VECTOR_V_COMPRESSION_FACTOR= 4 - C1_BLOCK_SIZE= 320 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 - ETA2= 2 - ETA2_RANDOMNESS_SIZE= 128 - IMPLICIT_REJECTION_HASH_INPUT_SIZE= 1120 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_decapsulate_62( libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key, libcrux_ml_kem_mlkem768_MlKem768Ciphertext *ciphertext, uint8_t ret[32U]) { Eurydice_slice_uint8_t_x4 uu____0 = libcrux_ml_kem_types_unpack_private_key_b4( Eurydice_array_to_slice((size_t)2400U, private_key->value, uint8_t)); Eurydice_slice ind_cpa_secret_key = uu____0.fst; Eurydice_slice ind_cpa_public_key = uu____0.snd; Eurydice_slice ind_cpa_public_key_hash = uu____0.thd; Eurydice_slice implicit_rejection_value = uu____0.f3; uint8_t decrypted[32U]; libcrux_ml_kem_ind_cpa_decrypt_42(ind_cpa_secret_key, ciphertext->value, decrypted); uint8_t to_hash0[64U]; libcrux_ml_kem_utils_into_padded_array_24( Eurydice_array_to_slice((size_t)32U, decrypted, uint8_t), to_hash0); Eurydice_slice_copy( Eurydice_array_to_subslice_from( (size_t)64U, to_hash0, LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE, uint8_t, size_t, uint8_t[]), ind_cpa_public_key_hash, uint8_t); uint8_t hashed[64U]; libcrux_ml_kem_hash_functions_portable_G_4a_e0( Eurydice_array_to_slice((size_t)64U, to_hash0, uint8_t), hashed); Eurydice_slice_uint8_t_x2 uu____1 = Eurydice_slice_split_at( Eurydice_array_to_slice((size_t)64U, hashed, uint8_t), LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice shared_secret0 = uu____1.fst; Eurydice_slice pseudorandomness = uu____1.snd; uint8_t to_hash[1120U]; libcrux_ml_kem_utils_into_padded_array_15(implicit_rejection_value, to_hash); Eurydice_slice uu____2 = Eurydice_array_to_subslice_from( (size_t)1120U, to_hash, LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE, uint8_t, size_t, uint8_t[]); Eurydice_slice_copy(uu____2, libcrux_ml_kem_types_as_ref_d3_80(ciphertext), uint8_t); uint8_t implicit_rejection_shared_secret0[32U]; libcrux_ml_kem_hash_functions_portable_PRF_4a_41( Eurydice_array_to_slice((size_t)1120U, to_hash, uint8_t), implicit_rejection_shared_secret0); uint8_t expected_ciphertext[1088U]; libcrux_ml_kem_ind_cpa_encrypt_2a(ind_cpa_public_key, decrypted, pseudorandomness, expected_ciphertext); uint8_t implicit_rejection_shared_secret[32U]; libcrux_ml_kem_variant_kdf_39_d6( Eurydice_array_to_slice((size_t)32U, implicit_rejection_shared_secret0, uint8_t), libcrux_ml_kem_types_as_slice_a9_80(ciphertext), implicit_rejection_shared_secret); uint8_t shared_secret[32U]; libcrux_ml_kem_variant_kdf_39_d6( shared_secret0, libcrux_ml_kem_types_as_slice_a9_80(ciphertext), shared_secret); uint8_t ret0[32U]; libcrux_ml_kem_constant_time_ops_compare_ciphertexts_select_shared_secret_in_constant_time( libcrux_ml_kem_types_as_ref_d3_80(ciphertext), Eurydice_array_to_slice((size_t)1088U, expected_ciphertext, uint8_t), Eurydice_array_to_slice((size_t)32U, shared_secret, uint8_t), Eurydice_array_to_slice((size_t)32U, implicit_rejection_shared_secret, uint8_t), ret0); memcpy(ret, ret0, (size_t)32U * sizeof(uint8_t)); } /** Portable decapsulate */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.instantiations.portable.decapsulate with const generics - K= 3 - SECRET_KEY_SIZE= 2400 - CPA_SECRET_KEY_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 - CIPHERTEXT_SIZE= 1088 - T_AS_NTT_ENCODED_SIZE= 1152 - C1_SIZE= 960 - C2_SIZE= 128 - VECTOR_U_COMPRESSION_FACTOR= 10 - VECTOR_V_COMPRESSION_FACTOR= 4 - C1_BLOCK_SIZE= 320 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 - ETA2= 2 - ETA2_RANDOMNESS_SIZE= 128 - IMPLICIT_REJECTION_HASH_INPUT_SIZE= 1120 */ static inline void libcrux_ml_kem_ind_cca_instantiations_portable_decapsulate_35( libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key, libcrux_ml_kem_mlkem768_MlKem768Ciphertext *ciphertext, uint8_t ret[32U]) { libcrux_ml_kem_ind_cca_decapsulate_62(private_key, ciphertext, ret); } /** Decapsulate ML-KEM 768 Generates an [`MlKemSharedSecret`]. The input is a reference to an [`MlKem768PrivateKey`] and an [`MlKem768Ciphertext`]. */ static inline void libcrux_ml_kem_mlkem768_portable_decapsulate( libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key, libcrux_ml_kem_mlkem768_MlKem768Ciphertext *ciphertext, uint8_t ret[32U]) { libcrux_ml_kem_ind_cca_instantiations_portable_decapsulate_35( private_key, ciphertext, ret); } /** This function found in impl {libcrux_ml_kem::variant::Variant for libcrux_ml_kem::variant::MlKem} */ /** A monomorphic instance of libcrux_ml_kem.variant.entropy_preprocess_39 with types libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_variant_entropy_preprocess_39_9c( Eurydice_slice randomness, uint8_t ret[32U]) { uint8_t out[32U] = {0U}; Eurydice_slice_copy(Eurydice_array_to_slice((size_t)32U, out, uint8_t), randomness, uint8_t); memcpy(ret, out, (size_t)32U * sizeof(uint8_t)); } /** This function found in impl {libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash} */ /** A monomorphic instance of libcrux_ml_kem.hash_functions.portable.H_4a with const generics - K= 3 */ static inline void libcrux_ml_kem_hash_functions_portable_H_4a_e0( Eurydice_slice input, uint8_t ret[32U]) { libcrux_ml_kem_hash_functions_portable_H(input, ret); } /** A monomorphic instance of libcrux_ml_kem.ind_cca.encapsulate with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]], libcrux_ml_kem_variant_MlKem with const generics - K= 3 - CIPHERTEXT_SIZE= 1088 - PUBLIC_KEY_SIZE= 1184 - T_AS_NTT_ENCODED_SIZE= 1152 - C1_SIZE= 960 - C2_SIZE= 128 - VECTOR_U_COMPRESSION_FACTOR= 10 - VECTOR_V_COMPRESSION_FACTOR= 4 - C1_BLOCK_SIZE= 320 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 - ETA2= 2 - ETA2_RANDOMNESS_SIZE= 128 */ static KRML_MUSTINLINE tuple_c2 libcrux_ml_kem_ind_cca_encapsulate_ca( libcrux_ml_kem_types_MlKemPublicKey_30 *public_key, uint8_t *randomness) { uint8_t randomness0[32U]; libcrux_ml_kem_variant_entropy_preprocess_39_9c( Eurydice_array_to_slice((size_t)32U, randomness, uint8_t), randomness0); uint8_t to_hash[64U]; libcrux_ml_kem_utils_into_padded_array_24( Eurydice_array_to_slice((size_t)32U, randomness0, uint8_t), to_hash); Eurydice_slice uu____0 = Eurydice_array_to_subslice_from( (size_t)64U, to_hash, LIBCRUX_ML_KEM_CONSTANTS_H_DIGEST_SIZE, uint8_t, size_t, uint8_t[]); uint8_t ret0[32U]; libcrux_ml_kem_hash_functions_portable_H_4a_e0( Eurydice_array_to_slice((size_t)1184U, libcrux_ml_kem_types_as_slice_e6_d0(public_key), uint8_t), ret0); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)32U, ret0, uint8_t), uint8_t); uint8_t hashed[64U]; libcrux_ml_kem_hash_functions_portable_G_4a_e0( Eurydice_array_to_slice((size_t)64U, to_hash, uint8_t), hashed); Eurydice_slice_uint8_t_x2 uu____1 = Eurydice_slice_split_at( Eurydice_array_to_slice((size_t)64U, hashed, uint8_t), LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice shared_secret = uu____1.fst; Eurydice_slice pseudorandomness = uu____1.snd; uint8_t ciphertext[1088U]; libcrux_ml_kem_ind_cpa_encrypt_2a( Eurydice_array_to_slice((size_t)1184U, libcrux_ml_kem_types_as_slice_e6_d0(public_key), uint8_t), randomness0, pseudorandomness, ciphertext); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_ciphertext[1088U]; memcpy(copy_of_ciphertext, ciphertext, (size_t)1088U * sizeof(uint8_t)); tuple_c2 lit; lit.fst = libcrux_ml_kem_types_from_e0_80(copy_of_ciphertext); uint8_t ret[32U]; libcrux_ml_kem_variant_kdf_39_d6(shared_secret, ciphertext, ret); memcpy(lit.snd, ret, (size_t)32U * sizeof(uint8_t)); return lit; } /** A monomorphic instance of libcrux_ml_kem.ind_cca.instantiations.portable.encapsulate with const generics - K= 3 - CIPHERTEXT_SIZE= 1088 - PUBLIC_KEY_SIZE= 1184 - T_AS_NTT_ENCODED_SIZE= 1152 - C1_SIZE= 960 - C2_SIZE= 128 - VECTOR_U_COMPRESSION_FACTOR= 10 - VECTOR_V_COMPRESSION_FACTOR= 4 - C1_BLOCK_SIZE= 320 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 - ETA2= 2 - ETA2_RANDOMNESS_SIZE= 128 */ static inline tuple_c2 libcrux_ml_kem_ind_cca_instantiations_portable_encapsulate_cd( libcrux_ml_kem_types_MlKemPublicKey_30 *public_key, uint8_t *randomness) { return libcrux_ml_kem_ind_cca_encapsulate_ca(public_key, randomness); } /** Encapsulate ML-KEM 768 Generates an ([`MlKem768Ciphertext`], [`MlKemSharedSecret`]) tuple. The input is a reference to an [`MlKem768PublicKey`] and [`SHARED_SECRET_SIZE`] bytes of `randomness`. */ static inline tuple_c2 libcrux_ml_kem_mlkem768_portable_encapsulate( libcrux_ml_kem_types_MlKemPublicKey_30 *public_key, uint8_t randomness[32U]) { return libcrux_ml_kem_ind_cca_instantiations_portable_encapsulate_cd( public_key, randomness); } /** This function found in impl {core::default::Default for libcrux_ml_kem::ind_cpa::unpacked::IndCpaPrivateKeyUnpacked[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.unpacked.default_70 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static inline libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_a0 libcrux_ml_kem_ind_cpa_unpacked_default_70_1b(void) { libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_a0 lit; libcrux_ml_kem_polynomial_PolynomialRingElement_1d repeat_expression[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { repeat_expression[i] = libcrux_ml_kem_polynomial_ZERO_d6_ea(); } memcpy( lit.secret_as_ntt, repeat_expression, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); return lit; } /** This function found in impl {libcrux_ml_kem::variant::Variant for libcrux_ml_kem::variant::MlKem} */ /** A monomorphic instance of libcrux_ml_kem.variant.cpa_keygen_seed_39 with types libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_variant_cpa_keygen_seed_39_9c( Eurydice_slice key_generation_seed, uint8_t ret[64U]) { uint8_t seed[33U] = {0U}; Eurydice_slice_copy( Eurydice_array_to_subslice3( seed, (size_t)0U, LIBCRUX_ML_KEM_CONSTANTS_CPA_PKE_KEY_GENERATION_SEED_SIZE, uint8_t *), key_generation_seed, uint8_t); seed[LIBCRUX_ML_KEM_CONSTANTS_CPA_PKE_KEY_GENERATION_SEED_SIZE] = (uint8_t)(size_t)3U; uint8_t ret0[64U]; libcrux_ml_kem_hash_functions_portable_G_4a_e0( Eurydice_array_to_slice((size_t)33U, seed, uint8_t), ret0); memcpy(ret, ret0, (size_t)64U * sizeof(uint8_t)); } /** This function found in impl {core::ops::function::FnMut<(usize), libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@3]> for libcrux_ml_kem::ind_cpa::generate_keypair_unpacked::closure[TraitClause@@0, TraitClause@@1, TraitClause@@2, TraitClause@@3, TraitClause@@4, TraitClause@@5]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.generate_keypair_unpacked.call_mut_73 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]], libcrux_ml_kem_variant_MlKem with const generics - K= 3 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 */ static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_ind_cpa_generate_keypair_unpacked_call_mut_73_1c( void **_, size_t tupled_args) { return libcrux_ml_kem_polynomial_ZERO_d6_ea(); } /** A monomorphic instance of libcrux_ml_kem.polynomial.to_standard_domain with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_polynomial_to_standard_domain_ea( libcrux_ml_kem_vector_portable_vector_type_PortableVector vector) { return libcrux_ml_kem_vector_portable_montgomery_multiply_by_constant_b8( vector, LIBCRUX_ML_KEM_VECTOR_TRAITS_MONTGOMERY_R_SQUARED_MOD_FIELD_MODULUS); } /** A monomorphic instance of libcrux_ml_kem.polynomial.add_standard_error_reduce with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_polynomial_add_standard_error_reduce_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *myself, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *error) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT; i++) { size_t j = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient_normal_form = libcrux_ml_kem_polynomial_to_standard_domain_ea( myself->coefficients[j]); libcrux_ml_kem_vector_portable_vector_type_PortableVector sum = libcrux_ml_kem_vector_portable_add_b8(coefficient_normal_form, &error->coefficients[j]); libcrux_ml_kem_vector_portable_vector_type_PortableVector red = libcrux_ml_kem_vector_portable_barrett_reduce_b8(sum); myself->coefficients[j] = red; } } /** This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.add_standard_error_reduce_d6 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_polynomial_add_standard_error_reduce_d6_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *self, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *error) { libcrux_ml_kem_polynomial_add_standard_error_reduce_ea(self, error); } /** Compute  ◦ ŝ + ê */ /** A monomorphic instance of libcrux_ml_kem.matrix.compute_As_plus_e with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_matrix_compute_As_plus_e_1b( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *t_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_1d (*matrix_A)[3U], libcrux_ml_kem_polynomial_PolynomialRingElement_1d *s_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *error_as_ntt) { for (size_t i = (size_t)0U; i < Eurydice_slice_len( Eurydice_array_to_slice( (size_t)3U, matrix_A, libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U]), libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U]); i++) { size_t i0 = i; libcrux_ml_kem_polynomial_PolynomialRingElement_1d *row = matrix_A[i0]; libcrux_ml_kem_polynomial_PolynomialRingElement_1d uu____0 = libcrux_ml_kem_polynomial_ZERO_d6_ea(); t_as_ntt[i0] = uu____0; for (size_t i1 = (size_t)0U; i1 < Eurydice_slice_len( Eurydice_array_to_slice( (size_t)3U, row, libcrux_ml_kem_polynomial_PolynomialRingElement_1d), libcrux_ml_kem_polynomial_PolynomialRingElement_1d); i1++) { size_t j = i1; libcrux_ml_kem_polynomial_PolynomialRingElement_1d *matrix_element = &row[j]; libcrux_ml_kem_polynomial_PolynomialRingElement_1d product = libcrux_ml_kem_polynomial_ntt_multiply_d6_ea(matrix_element, &s_as_ntt[j]); libcrux_ml_kem_polynomial_add_to_ring_element_d6_1b(&t_as_ntt[i0], &product); } libcrux_ml_kem_polynomial_add_standard_error_reduce_d6_ea( &t_as_ntt[i0], &error_as_ntt[i0]); } } /** This function implements most of Algorithm 12 of the NIST FIPS 203 specification; this is the Kyber CPA-PKE key generation algorithm. We say "most of" since Algorithm 12 samples the required randomness within the function itself, whereas this implementation expects it to be provided through the `key_generation_seed` parameter. Algorithm 12 is reproduced below: ```plaintext Output: encryption key ekₚₖₑ ∈ 𝔹^{384k+32}. Output: decryption key dkₚₖₑ ∈ 𝔹^{384k}. d ←$ B (ρ,σ) ← G(d) N ← 0 for (i ← 0; i < k; i++) for(j ← 0; j < k; j++) Â[i,j] ← SampleNTT(XOF(ρ, i, j)) end for end for for(i ← 0; i < k; i++) s[i] ← SamplePolyCBD_{η₁}(PRF_{η₁}(σ,N)) N ← N + 1 end for for(i ← 0; i < k; i++) e[i] ← SamplePolyCBD_{η₂}(PRF_{η₂}(σ,N)) N ← N + 1 end for ŝ ← NTT(s) ê ← NTT(e) t̂ ← Â◦ŝ + ê ekₚₖₑ ← ByteEncode₁₂(t̂) ‖ ρ dkₚₖₑ ← ByteEncode₁₂(ŝ) ``` The NIST FIPS 203 standard can be found at . */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.generate_keypair_unpacked with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]], libcrux_ml_kem_variant_MlKem with const generics - K= 3 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_generate_keypair_unpacked_1c( Eurydice_slice key_generation_seed, libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_a0 *private_key, libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 *public_key) { uint8_t hashed[64U]; libcrux_ml_kem_variant_cpa_keygen_seed_39_9c(key_generation_seed, hashed); Eurydice_slice_uint8_t_x2 uu____0 = Eurydice_slice_split_at( Eurydice_array_to_slice((size_t)64U, hashed, uint8_t), (size_t)32U, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice seed_for_A = uu____0.fst; Eurydice_slice seed_for_secret_and_error = uu____0.snd; libcrux_ml_kem_polynomial_PolynomialRingElement_1d(*uu____1)[3U] = public_key->A; uint8_t ret[34U]; libcrux_ml_kem_utils_into_padded_array_b6(seed_for_A, ret); libcrux_ml_kem_matrix_sample_matrix_A_2b(uu____1, ret, true); uint8_t prf_input[33U]; libcrux_ml_kem_utils_into_padded_array_c8(seed_for_secret_and_error, prf_input); uint8_t domain_separator = libcrux_ml_kem_ind_cpa_sample_vector_cbd_then_ntt_3b( private_key->secret_as_ntt, prf_input, 0U); libcrux_ml_kem_polynomial_PolynomialRingElement_1d error_as_ntt[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { /* original Rust expression is not an lvalue in C */ void *lvalue = (void *)0U; error_as_ntt[i] = libcrux_ml_kem_ind_cpa_generate_keypair_unpacked_call_mut_73_1c(&lvalue, i); } libcrux_ml_kem_ind_cpa_sample_vector_cbd_then_ntt_3b(error_as_ntt, prf_input, domain_separator); libcrux_ml_kem_matrix_compute_As_plus_e_1b( public_key->t_as_ntt, public_key->A, private_key->secret_as_ntt, error_as_ntt); uint8_t uu____2[32U]; Result_fb dst; Eurydice_slice_to_array2(&dst, seed_for_A, Eurydice_slice, uint8_t[32U], TryFromSliceError); unwrap_26_b3(dst, uu____2); memcpy(public_key->seed_for_A, uu____2, (size_t)32U * sizeof(uint8_t)); } /** A monomorphic instance of libcrux_ml_kem.serialize.serialize_uncompressed_ring_element with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_serialize_serialize_uncompressed_ring_element_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re, uint8_t ret[384U]) { uint8_t serialized[384U] = {0U}; for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT; i++) { size_t i0 = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient = libcrux_ml_kem_serialize_to_unsigned_field_modulus_ea( re->coefficients[i0]); uint8_t bytes[24U]; libcrux_ml_kem_vector_portable_serialize_12_b8(coefficient, bytes); Eurydice_slice_copy( Eurydice_array_to_subslice3(serialized, (size_t)24U * i0, (size_t)24U * i0 + (size_t)24U, uint8_t *), Eurydice_array_to_slice((size_t)24U, bytes, uint8_t), uint8_t); } memcpy(ret, serialized, (size_t)384U * sizeof(uint8_t)); } /** Call [`serialize_uncompressed_ring_element`] for each ring element. */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.serialize_vector with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_serialize_vector_1b( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *key, Eurydice_slice out) { for (size_t i = (size_t)0U; i < Eurydice_slice_len( Eurydice_array_to_slice( (size_t)3U, key, libcrux_ml_kem_polynomial_PolynomialRingElement_1d), libcrux_ml_kem_polynomial_PolynomialRingElement_1d); i++) { size_t i0 = i; libcrux_ml_kem_polynomial_PolynomialRingElement_1d re = key[i0]; Eurydice_slice uu____0 = Eurydice_slice_subslice3( out, i0 * LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT, (i0 + (size_t)1U) * LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT, uint8_t *); uint8_t ret[384U]; libcrux_ml_kem_serialize_serialize_uncompressed_ring_element_ea(&re, ret); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)384U, ret, uint8_t), uint8_t); } } /** Concatenate `t` and `ρ` into the public key. */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.serialize_public_key_mut with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - PUBLIC_KEY_SIZE= 1184 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_serialize_public_key_mut_89( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *t_as_ntt, Eurydice_slice seed_for_a, uint8_t *serialized) { libcrux_ml_kem_ind_cpa_serialize_vector_1b( t_as_ntt, Eurydice_array_to_subslice3( serialized, (size_t)0U, libcrux_ml_kem_constants_ranked_bytes_per_ring_element((size_t)3U), uint8_t *)); Eurydice_slice_copy( Eurydice_array_to_subslice_from( (size_t)1184U, serialized, libcrux_ml_kem_constants_ranked_bytes_per_ring_element((size_t)3U), uint8_t, size_t, uint8_t[]), seed_for_a, uint8_t); } /** Concatenate `t` and `ρ` into the public key. */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.serialize_public_key with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - PUBLIC_KEY_SIZE= 1184 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_serialize_public_key_89( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *t_as_ntt, Eurydice_slice seed_for_a, uint8_t ret[1184U]) { uint8_t public_key_serialized[1184U] = {0U}; libcrux_ml_kem_ind_cpa_serialize_public_key_mut_89(t_as_ntt, seed_for_a, public_key_serialized); memcpy(ret, public_key_serialized, (size_t)1184U * sizeof(uint8_t)); } /** Serialize the secret key from the unpacked key pair generation. */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.serialize_unpacked_secret_key with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - PRIVATE_KEY_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 */ static inline libcrux_ml_kem_utils_extraction_helper_Keypair768 libcrux_ml_kem_ind_cpa_serialize_unpacked_secret_key_6c( libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 *public_key, libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_a0 *private_key) { uint8_t public_key_serialized[1184U]; libcrux_ml_kem_ind_cpa_serialize_public_key_89( public_key->t_as_ntt, Eurydice_array_to_slice((size_t)32U, public_key->seed_for_A, uint8_t), public_key_serialized); uint8_t secret_key_serialized[1152U] = {0U}; libcrux_ml_kem_ind_cpa_serialize_vector_1b( private_key->secret_as_ntt, Eurydice_array_to_slice((size_t)1152U, secret_key_serialized, uint8_t)); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_secret_key_serialized[1152U]; memcpy(copy_of_secret_key_serialized, secret_key_serialized, (size_t)1152U * sizeof(uint8_t)); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_public_key_serialized[1184U]; memcpy(copy_of_public_key_serialized, public_key_serialized, (size_t)1184U * sizeof(uint8_t)); libcrux_ml_kem_utils_extraction_helper_Keypair768 lit; memcpy(lit.fst, copy_of_secret_key_serialized, (size_t)1152U * sizeof(uint8_t)); memcpy(lit.snd, copy_of_public_key_serialized, (size_t)1184U * sizeof(uint8_t)); return lit; } /** A monomorphic instance of libcrux_ml_kem.ind_cpa.generate_keypair with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]], libcrux_ml_kem_variant_MlKem with const generics - K= 3 - PRIVATE_KEY_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 */ static KRML_MUSTINLINE libcrux_ml_kem_utils_extraction_helper_Keypair768 libcrux_ml_kem_ind_cpa_generate_keypair_ea(Eurydice_slice key_generation_seed) { libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_a0 private_key = libcrux_ml_kem_ind_cpa_unpacked_default_70_1b(); libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 public_key = libcrux_ml_kem_ind_cpa_unpacked_default_8b_1b(); libcrux_ml_kem_ind_cpa_generate_keypair_unpacked_1c( key_generation_seed, &private_key, &public_key); return libcrux_ml_kem_ind_cpa_serialize_unpacked_secret_key_6c(&public_key, &private_key); } /** Serialize the secret key. */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.serialize_kem_secret_key_mut with types libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - SERIALIZED_KEY_LEN= 2400 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_serialize_kem_secret_key_mut_d6( Eurydice_slice private_key, Eurydice_slice public_key, Eurydice_slice implicit_rejection_value, uint8_t *serialized) { size_t pointer = (size_t)0U; uint8_t *uu____0 = serialized; size_t uu____1 = pointer; size_t uu____2 = pointer; Eurydice_slice_copy( Eurydice_array_to_subslice3( uu____0, uu____1, uu____2 + Eurydice_slice_len(private_key, uint8_t), uint8_t *), private_key, uint8_t); pointer = pointer + Eurydice_slice_len(private_key, uint8_t); uint8_t *uu____3 = serialized; size_t uu____4 = pointer; size_t uu____5 = pointer; Eurydice_slice_copy( Eurydice_array_to_subslice3( uu____3, uu____4, uu____5 + Eurydice_slice_len(public_key, uint8_t), uint8_t *), public_key, uint8_t); pointer = pointer + Eurydice_slice_len(public_key, uint8_t); Eurydice_slice uu____6 = Eurydice_array_to_subslice3( serialized, pointer, pointer + LIBCRUX_ML_KEM_CONSTANTS_H_DIGEST_SIZE, uint8_t *); uint8_t ret[32U]; libcrux_ml_kem_hash_functions_portable_H_4a_e0(public_key, ret); Eurydice_slice_copy( uu____6, Eurydice_array_to_slice((size_t)32U, ret, uint8_t), uint8_t); pointer = pointer + LIBCRUX_ML_KEM_CONSTANTS_H_DIGEST_SIZE; uint8_t *uu____7 = serialized; size_t uu____8 = pointer; size_t uu____9 = pointer; Eurydice_slice_copy( Eurydice_array_to_subslice3( uu____7, uu____8, uu____9 + Eurydice_slice_len(implicit_rejection_value, uint8_t), uint8_t *), implicit_rejection_value, uint8_t); } /** A monomorphic instance of libcrux_ml_kem.ind_cca.serialize_kem_secret_key with types libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - SERIALIZED_KEY_LEN= 2400 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_serialize_kem_secret_key_d6( Eurydice_slice private_key, Eurydice_slice public_key, Eurydice_slice implicit_rejection_value, uint8_t ret[2400U]) { uint8_t out[2400U] = {0U}; libcrux_ml_kem_ind_cca_serialize_kem_secret_key_mut_d6( private_key, public_key, implicit_rejection_value, out); memcpy(ret, out, (size_t)2400U * sizeof(uint8_t)); } /** Packed API Generate a key pair. Depending on the `Vector` and `Hasher` used, this requires different hardware features */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.generate_keypair with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]], libcrux_ml_kem_variant_MlKem with const generics - K= 3 - CPA_PRIVATE_KEY_SIZE= 1152 - PRIVATE_KEY_SIZE= 2400 - PUBLIC_KEY_SIZE= 1184 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 */ static KRML_MUSTINLINE libcrux_ml_kem_mlkem768_MlKem768KeyPair libcrux_ml_kem_ind_cca_generate_keypair_15(uint8_t *randomness) { Eurydice_slice ind_cpa_keypair_randomness = Eurydice_array_to_subslice3( randomness, (size_t)0U, LIBCRUX_ML_KEM_CONSTANTS_CPA_PKE_KEY_GENERATION_SEED_SIZE, uint8_t *); Eurydice_slice implicit_rejection_value = Eurydice_array_to_subslice_from( (size_t)64U, randomness, LIBCRUX_ML_KEM_CONSTANTS_CPA_PKE_KEY_GENERATION_SEED_SIZE, uint8_t, size_t, uint8_t[]); libcrux_ml_kem_utils_extraction_helper_Keypair768 uu____0 = libcrux_ml_kem_ind_cpa_generate_keypair_ea(ind_cpa_keypair_randomness); uint8_t ind_cpa_private_key[1152U]; memcpy(ind_cpa_private_key, uu____0.fst, (size_t)1152U * sizeof(uint8_t)); uint8_t public_key[1184U]; memcpy(public_key, uu____0.snd, (size_t)1184U * sizeof(uint8_t)); uint8_t secret_key_serialized[2400U]; libcrux_ml_kem_ind_cca_serialize_kem_secret_key_d6( Eurydice_array_to_slice((size_t)1152U, ind_cpa_private_key, uint8_t), Eurydice_array_to_slice((size_t)1184U, public_key, uint8_t), implicit_rejection_value, secret_key_serialized); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_secret_key_serialized[2400U]; memcpy(copy_of_secret_key_serialized, secret_key_serialized, (size_t)2400U * sizeof(uint8_t)); libcrux_ml_kem_types_MlKemPrivateKey_d9 private_key = libcrux_ml_kem_types_from_77_28(copy_of_secret_key_serialized); libcrux_ml_kem_types_MlKemPrivateKey_d9 uu____2 = private_key; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_public_key[1184U]; memcpy(copy_of_public_key, public_key, (size_t)1184U * sizeof(uint8_t)); return libcrux_ml_kem_types_from_17_74( uu____2, libcrux_ml_kem_types_from_fd_d0(copy_of_public_key)); } /** Portable generate key pair. */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.instantiations.portable.generate_keypair with const generics - K= 3 - CPA_PRIVATE_KEY_SIZE= 1152 - PRIVATE_KEY_SIZE= 2400 - PUBLIC_KEY_SIZE= 1184 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 */ static inline libcrux_ml_kem_mlkem768_MlKem768KeyPair libcrux_ml_kem_ind_cca_instantiations_portable_generate_keypair_ce( uint8_t *randomness) { return libcrux_ml_kem_ind_cca_generate_keypair_15(randomness); } /** Generate ML-KEM 768 Key Pair */ static inline libcrux_ml_kem_mlkem768_MlKem768KeyPair libcrux_ml_kem_mlkem768_portable_generate_key_pair(uint8_t randomness[64U]) { return libcrux_ml_kem_ind_cca_instantiations_portable_generate_keypair_ce( randomness); } /** Validate an ML-KEM private key. This implements the Hash check in 7.3 3. */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.validate_private_key_only with types libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - SECRET_KEY_SIZE= 2400 */ static KRML_MUSTINLINE bool libcrux_ml_kem_ind_cca_validate_private_key_only_d6( libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key) { uint8_t t[32U]; libcrux_ml_kem_hash_functions_portable_H_4a_e0( Eurydice_array_to_subslice3(private_key->value, (size_t)384U * (size_t)3U, (size_t)768U * (size_t)3U + (size_t)32U, uint8_t *), t); Eurydice_slice expected = Eurydice_array_to_subslice3( private_key->value, (size_t)768U * (size_t)3U + (size_t)32U, (size_t)768U * (size_t)3U + (size_t)64U, uint8_t *); return Eurydice_array_eq_slice((size_t)32U, t, &expected, uint8_t, bool); } /** Validate an ML-KEM private key. This implements the Hash check in 7.3 3. Note that the size checks in 7.2 1 and 2 are covered by the `SECRET_KEY_SIZE` and `CIPHERTEXT_SIZE` in the `private_key` and `ciphertext` types. */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.validate_private_key with types libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - SECRET_KEY_SIZE= 2400 - CIPHERTEXT_SIZE= 1088 */ static KRML_MUSTINLINE bool libcrux_ml_kem_ind_cca_validate_private_key_37( libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key, libcrux_ml_kem_mlkem768_MlKem768Ciphertext *_ciphertext) { return libcrux_ml_kem_ind_cca_validate_private_key_only_d6(private_key); } /** Private key validation */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.instantiations.portable.validate_private_key with const generics - K= 3 - SECRET_KEY_SIZE= 2400 - CIPHERTEXT_SIZE= 1088 */ static KRML_MUSTINLINE bool libcrux_ml_kem_ind_cca_instantiations_portable_validate_private_key_31( libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key, libcrux_ml_kem_mlkem768_MlKem768Ciphertext *ciphertext) { return libcrux_ml_kem_ind_cca_validate_private_key_37(private_key, ciphertext); } /** Validate a private key. Returns `true` if valid, and `false` otherwise. */ static inline bool libcrux_ml_kem_mlkem768_portable_validate_private_key( libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key, libcrux_ml_kem_mlkem768_MlKem768Ciphertext *ciphertext) { return libcrux_ml_kem_ind_cca_instantiations_portable_validate_private_key_31( private_key, ciphertext); } /** Private key validation */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.instantiations.portable.validate_private_key_only with const generics - K= 3 - SECRET_KEY_SIZE= 2400 */ static KRML_MUSTINLINE bool libcrux_ml_kem_ind_cca_instantiations_portable_validate_private_key_only_41( libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key) { return libcrux_ml_kem_ind_cca_validate_private_key_only_d6(private_key); } /** Validate the private key only. Returns `true` if valid, and `false` otherwise. */ static inline bool libcrux_ml_kem_mlkem768_portable_validate_private_key_only( libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key) { return libcrux_ml_kem_ind_cca_instantiations_portable_validate_private_key_only_41( private_key); } /** This function found in impl {core::ops::function::FnMut<(usize), libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]> for libcrux_ml_kem::serialize::deserialize_ring_elements_reduced_out::closure[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.serialize.deserialize_ring_elements_reduced_out.call_mut_0b with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_out_call_mut_0b_1b( void **_, size_t tupled_args) { return libcrux_ml_kem_polynomial_ZERO_d6_ea(); } /** This function deserializes ring elements and reduces the result by the field modulus. This function MUST NOT be used on secret inputs. */ /** A monomorphic instance of libcrux_ml_kem.serialize.deserialize_ring_elements_reduced_out with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_out_1b( Eurydice_slice public_key, libcrux_ml_kem_polynomial_PolynomialRingElement_1d ret[3U]) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d deserialized_pk[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { /* original Rust expression is not an lvalue in C */ void *lvalue = (void *)0U; deserialized_pk[i] = libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_out_call_mut_0b_1b( &lvalue, i); } libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_1b( public_key, deserialized_pk); memcpy( ret, deserialized_pk, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); } /** Validate an ML-KEM public key. This implements the Modulus check in 7.2 2. Note that the size check in 7.2 1 is covered by the `PUBLIC_KEY_SIZE` in the `public_key` type. */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.validate_public_key with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - PUBLIC_KEY_SIZE= 1184 */ static KRML_MUSTINLINE bool libcrux_ml_kem_ind_cca_validate_public_key_89( uint8_t *public_key) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d deserialized_pk[3U]; libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_out_1b( Eurydice_array_to_subslice_to( (size_t)1184U, public_key, libcrux_ml_kem_constants_ranked_bytes_per_ring_element((size_t)3U), uint8_t, size_t, uint8_t[]), deserialized_pk); libcrux_ml_kem_polynomial_PolynomialRingElement_1d *uu____0 = deserialized_pk; uint8_t public_key_serialized[1184U]; libcrux_ml_kem_ind_cpa_serialize_public_key_89( uu____0, Eurydice_array_to_subslice_from( (size_t)1184U, public_key, libcrux_ml_kem_constants_ranked_bytes_per_ring_element((size_t)3U), uint8_t, size_t, uint8_t[]), public_key_serialized); return Eurydice_array_eq((size_t)1184U, public_key, public_key_serialized, uint8_t); } /** Public key validation */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.instantiations.portable.validate_public_key with const generics - K= 3 - PUBLIC_KEY_SIZE= 1184 */ static KRML_MUSTINLINE bool libcrux_ml_kem_ind_cca_instantiations_portable_validate_public_key_41( uint8_t *public_key) { return libcrux_ml_kem_ind_cca_validate_public_key_89(public_key); } /** Validate a public key. Returns `true` if valid, and `false` otherwise. */ static inline bool libcrux_ml_kem_mlkem768_portable_validate_public_key( libcrux_ml_kem_types_MlKemPublicKey_30 *public_key) { return libcrux_ml_kem_ind_cca_instantiations_portable_validate_public_key_41( public_key->value); } /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.MlKemPublicKeyUnpacked with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - $3size_t */ typedef struct libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0_s { libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 ind_cpa_public_key; uint8_t public_key_hash[32U]; } libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0; typedef libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768PublicKeyUnpacked; /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.MlKemPrivateKeyUnpacked with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - $3size_t */ typedef struct libcrux_ml_kem_ind_cca_unpacked_MlKemPrivateKeyUnpacked_a0_s { libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_a0 ind_cpa_private_key; uint8_t implicit_rejection_value[32U]; } libcrux_ml_kem_ind_cca_unpacked_MlKemPrivateKeyUnpacked_a0; typedef struct libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked_s { libcrux_ml_kem_ind_cca_unpacked_MlKemPrivateKeyUnpacked_a0 private_key; libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 public_key; } libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked; /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.decapsulate with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - SECRET_KEY_SIZE= 2400 - CPA_SECRET_KEY_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 - CIPHERTEXT_SIZE= 1088 - T_AS_NTT_ENCODED_SIZE= 1152 - C1_SIZE= 960 - C2_SIZE= 128 - VECTOR_U_COMPRESSION_FACTOR= 10 - VECTOR_V_COMPRESSION_FACTOR= 4 - C1_BLOCK_SIZE= 320 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 - ETA2= 2 - ETA2_RANDOMNESS_SIZE= 128 - IMPLICIT_REJECTION_HASH_INPUT_SIZE= 1120 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_unpacked_decapsulate_51( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *key_pair, libcrux_ml_kem_mlkem768_MlKem768Ciphertext *ciphertext, uint8_t ret[32U]) { uint8_t decrypted[32U]; libcrux_ml_kem_ind_cpa_decrypt_unpacked_42( &key_pair->private_key.ind_cpa_private_key, ciphertext->value, decrypted); uint8_t to_hash0[64U]; libcrux_ml_kem_utils_into_padded_array_24( Eurydice_array_to_slice((size_t)32U, decrypted, uint8_t), to_hash0); Eurydice_slice uu____0 = Eurydice_array_to_subslice_from( (size_t)64U, to_hash0, LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE, uint8_t, size_t, uint8_t[]); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)32U, key_pair->public_key.public_key_hash, uint8_t), uint8_t); uint8_t hashed[64U]; libcrux_ml_kem_hash_functions_portable_G_4a_e0( Eurydice_array_to_slice((size_t)64U, to_hash0, uint8_t), hashed); Eurydice_slice_uint8_t_x2 uu____1 = Eurydice_slice_split_at( Eurydice_array_to_slice((size_t)64U, hashed, uint8_t), LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice shared_secret = uu____1.fst; Eurydice_slice pseudorandomness = uu____1.snd; uint8_t to_hash[1120U]; libcrux_ml_kem_utils_into_padded_array_15( Eurydice_array_to_slice( (size_t)32U, key_pair->private_key.implicit_rejection_value, uint8_t), to_hash); Eurydice_slice uu____2 = Eurydice_array_to_subslice_from( (size_t)1120U, to_hash, LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE, uint8_t, size_t, uint8_t[]); Eurydice_slice_copy(uu____2, libcrux_ml_kem_types_as_ref_d3_80(ciphertext), uint8_t); uint8_t implicit_rejection_shared_secret[32U]; libcrux_ml_kem_hash_functions_portable_PRF_4a_41( Eurydice_array_to_slice((size_t)1120U, to_hash, uint8_t), implicit_rejection_shared_secret); uint8_t expected_ciphertext[1088U]; libcrux_ml_kem_ind_cpa_encrypt_unpacked_2a( &key_pair->public_key.ind_cpa_public_key, decrypted, pseudorandomness, expected_ciphertext); uint8_t selector = libcrux_ml_kem_constant_time_ops_compare_ciphertexts_in_constant_time( libcrux_ml_kem_types_as_ref_d3_80(ciphertext), Eurydice_array_to_slice((size_t)1088U, expected_ciphertext, uint8_t)); uint8_t ret0[32U]; libcrux_ml_kem_constant_time_ops_select_shared_secret_in_constant_time( shared_secret, Eurydice_array_to_slice((size_t)32U, implicit_rejection_shared_secret, uint8_t), selector, ret0); memcpy(ret, ret0, (size_t)32U * sizeof(uint8_t)); } /** Unpacked decapsulate */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.instantiations.portable.unpacked.decapsulate with const generics - K= 3 - SECRET_KEY_SIZE= 2400 - CPA_SECRET_KEY_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 - CIPHERTEXT_SIZE= 1088 - T_AS_NTT_ENCODED_SIZE= 1152 - C1_SIZE= 960 - C2_SIZE= 128 - VECTOR_U_COMPRESSION_FACTOR= 10 - VECTOR_V_COMPRESSION_FACTOR= 4 - C1_BLOCK_SIZE= 320 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 - ETA2= 2 - ETA2_RANDOMNESS_SIZE= 128 - IMPLICIT_REJECTION_HASH_INPUT_SIZE= 1120 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_instantiations_portable_unpacked_decapsulate_35( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *key_pair, libcrux_ml_kem_mlkem768_MlKem768Ciphertext *ciphertext, uint8_t ret[32U]) { libcrux_ml_kem_ind_cca_unpacked_decapsulate_51(key_pair, ciphertext, ret); } /** Decapsulate ML-KEM 768 (unpacked) Generates an [`MlKemSharedSecret`]. The input is a reference to an unpacked key pair of type [`MlKem768KeyPairUnpacked`] and an [`MlKem768Ciphertext`]. */ static inline void libcrux_ml_kem_mlkem768_portable_unpacked_decapsulate( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *private_key, libcrux_ml_kem_mlkem768_MlKem768Ciphertext *ciphertext, uint8_t ret[32U]) { libcrux_ml_kem_ind_cca_instantiations_portable_unpacked_decapsulate_35( private_key, ciphertext, ret); } /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.encaps_prepare with types libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 */ static inline void libcrux_ml_kem_ind_cca_unpacked_encaps_prepare_9c( Eurydice_slice randomness, Eurydice_slice pk_hash, uint8_t ret[64U]) { uint8_t to_hash[64U]; libcrux_ml_kem_utils_into_padded_array_24(randomness, to_hash); Eurydice_slice_copy( Eurydice_array_to_subslice_from((size_t)64U, to_hash, LIBCRUX_ML_KEM_CONSTANTS_H_DIGEST_SIZE, uint8_t, size_t, uint8_t[]), pk_hash, uint8_t); uint8_t ret0[64U]; libcrux_ml_kem_hash_functions_portable_G_4a_e0( Eurydice_array_to_slice((size_t)64U, to_hash, uint8_t), ret0); memcpy(ret, ret0, (size_t)64U * sizeof(uint8_t)); } /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.encapsulate with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - CIPHERTEXT_SIZE= 1088 - PUBLIC_KEY_SIZE= 1184 - T_AS_NTT_ENCODED_SIZE= 1152 - C1_SIZE= 960 - C2_SIZE= 128 - VECTOR_U_COMPRESSION_FACTOR= 10 - VECTOR_V_COMPRESSION_FACTOR= 4 - VECTOR_U_BLOCK_LEN= 320 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 - ETA2= 2 - ETA2_RANDOMNESS_SIZE= 128 */ static KRML_MUSTINLINE tuple_c2 libcrux_ml_kem_ind_cca_unpacked_encapsulate_0c( libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 *public_key, uint8_t *randomness) { uint8_t hashed[64U]; libcrux_ml_kem_ind_cca_unpacked_encaps_prepare_9c( Eurydice_array_to_slice((size_t)32U, randomness, uint8_t), Eurydice_array_to_slice((size_t)32U, public_key->public_key_hash, uint8_t), hashed); Eurydice_slice_uint8_t_x2 uu____0 = Eurydice_slice_split_at( Eurydice_array_to_slice((size_t)64U, hashed, uint8_t), LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice shared_secret = uu____0.fst; Eurydice_slice pseudorandomness = uu____0.snd; uint8_t ciphertext[1088U]; libcrux_ml_kem_ind_cpa_encrypt_unpacked_2a(&public_key->ind_cpa_public_key, randomness, pseudorandomness, ciphertext); uint8_t shared_secret_array[32U] = {0U}; Eurydice_slice_copy( Eurydice_array_to_slice((size_t)32U, shared_secret_array, uint8_t), shared_secret, uint8_t); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_ciphertext[1088U]; memcpy(copy_of_ciphertext, ciphertext, (size_t)1088U * sizeof(uint8_t)); libcrux_ml_kem_mlkem768_MlKem768Ciphertext uu____2 = libcrux_ml_kem_types_from_e0_80(copy_of_ciphertext); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_shared_secret_array[32U]; memcpy(copy_of_shared_secret_array, shared_secret_array, (size_t)32U * sizeof(uint8_t)); tuple_c2 lit; lit.fst = uu____2; memcpy(lit.snd, copy_of_shared_secret_array, (size_t)32U * sizeof(uint8_t)); return lit; } /** Unpacked encapsulate */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.instantiations.portable.unpacked.encapsulate with const generics - K= 3 - CIPHERTEXT_SIZE= 1088 - PUBLIC_KEY_SIZE= 1184 - T_AS_NTT_ENCODED_SIZE= 1152 - C1_SIZE= 960 - C2_SIZE= 128 - VECTOR_U_COMPRESSION_FACTOR= 10 - VECTOR_V_COMPRESSION_FACTOR= 4 - VECTOR_U_BLOCK_LEN= 320 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 - ETA2= 2 - ETA2_RANDOMNESS_SIZE= 128 */ static KRML_MUSTINLINE tuple_c2 libcrux_ml_kem_ind_cca_instantiations_portable_unpacked_encapsulate_cd( libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 *public_key, uint8_t *randomness) { return libcrux_ml_kem_ind_cca_unpacked_encapsulate_0c(public_key, randomness); } /** Encapsulate ML-KEM 768 (unpacked) Generates an ([`MlKem768Ciphertext`], [`MlKemSharedSecret`]) tuple. The input is a reference to an unpacked public key of type [`MlKem768PublicKeyUnpacked`], the SHA3-256 hash of this public key, and [`SHARED_SECRET_SIZE`] bytes of `randomness`. */ static inline tuple_c2 libcrux_ml_kem_mlkem768_portable_unpacked_encapsulate( libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 *public_key, uint8_t randomness[32U]) { return libcrux_ml_kem_ind_cca_instantiations_portable_unpacked_encapsulate_cd( public_key, randomness); } /** This function found in impl {core::ops::function::FnMut<(usize), libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]> for libcrux_ml_kem::ind_cca::unpacked::transpose_a::closure::closure[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.transpose_a.closure.call_mut_b4 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_ind_cca_unpacked_transpose_a_closure_call_mut_b4_1b( void **_, size_t tupled_args) { return libcrux_ml_kem_polynomial_ZERO_d6_ea(); } /** This function found in impl {core::ops::function::FnMut<(usize), @@Array[TraitClause@@0, TraitClause@@1], K>> for libcrux_ml_kem::ind_cca::unpacked::transpose_a::closure[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.transpose_a.call_mut_7b with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static inline void libcrux_ml_kem_ind_cca_unpacked_transpose_a_call_mut_7b_1b( void **_, size_t tupled_args, libcrux_ml_kem_polynomial_PolynomialRingElement_1d ret[3U]) { for (size_t i = (size_t)0U; i < (size_t)3U; i++) { /* original Rust expression is not an lvalue in C */ void *lvalue = (void *)0U; ret[i] = libcrux_ml_kem_ind_cca_unpacked_transpose_a_closure_call_mut_b4_1b( &lvalue, i); } } /** This function found in impl {core::clone::Clone for libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@2]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.clone_c1 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_polynomial_clone_c1_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *self) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d lit; libcrux_ml_kem_vector_portable_vector_type_PortableVector ret[16U]; core_array__core__clone__Clone_for__Array_T__N___clone( (size_t)16U, self->coefficients, ret, libcrux_ml_kem_vector_portable_vector_type_PortableVector, void *); memcpy(lit.coefficients, ret, (size_t)16U * sizeof(libcrux_ml_kem_vector_portable_vector_type_PortableVector)); return lit; } /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.transpose_a with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static inline void libcrux_ml_kem_ind_cca_unpacked_transpose_a_1b( libcrux_ml_kem_polynomial_PolynomialRingElement_1d ind_cpa_a[3U][3U], libcrux_ml_kem_polynomial_PolynomialRingElement_1d ret[3U][3U]) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d A[3U][3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { /* original Rust expression is not an lvalue in C */ void *lvalue = (void *)0U; libcrux_ml_kem_ind_cca_unpacked_transpose_a_call_mut_7b_1b(&lvalue, i, A[i]); } for (size_t i = (size_t)0U; i < (size_t)3U; i++) { size_t i0 = i; libcrux_ml_kem_polynomial_PolynomialRingElement_1d _a_i[3U][3U]; memcpy(_a_i, A, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U])); for (size_t i1 = (size_t)0U; i1 < (size_t)3U; i1++) { size_t j = i1; libcrux_ml_kem_polynomial_PolynomialRingElement_1d uu____0 = libcrux_ml_kem_polynomial_clone_c1_ea(&ind_cpa_a[j][i0]); A[i0][j] = uu____0; } } memcpy(ret, A, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U])); } /** Generate Unpacked Keys */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.generate_keypair with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]], libcrux_ml_kem_variant_MlKem with const generics - K= 3 - CPA_PRIVATE_KEY_SIZE= 1152 - PRIVATE_KEY_SIZE= 2400 - PUBLIC_KEY_SIZE= 1184 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_unpacked_generate_keypair_15( uint8_t randomness[64U], libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *out) { Eurydice_slice ind_cpa_keypair_randomness = Eurydice_array_to_subslice3( randomness, (size_t)0U, LIBCRUX_ML_KEM_CONSTANTS_CPA_PKE_KEY_GENERATION_SEED_SIZE, uint8_t *); Eurydice_slice implicit_rejection_value = Eurydice_array_to_subslice_from( (size_t)64U, randomness, LIBCRUX_ML_KEM_CONSTANTS_CPA_PKE_KEY_GENERATION_SEED_SIZE, uint8_t, size_t, uint8_t[]); libcrux_ml_kem_ind_cpa_generate_keypair_unpacked_1c( ind_cpa_keypair_randomness, &out->private_key.ind_cpa_private_key, &out->public_key.ind_cpa_public_key); libcrux_ml_kem_polynomial_PolynomialRingElement_1d uu____0[3U][3U]; memcpy(uu____0, out->public_key.ind_cpa_public_key.A, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U])); libcrux_ml_kem_polynomial_PolynomialRingElement_1d A[3U][3U]; libcrux_ml_kem_ind_cca_unpacked_transpose_a_1b(uu____0, A); libcrux_ml_kem_polynomial_PolynomialRingElement_1d uu____1[3U][3U]; memcpy(uu____1, A, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U])); memcpy(out->public_key.ind_cpa_public_key.A, uu____1, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U])); uint8_t pk_serialized[1184U]; libcrux_ml_kem_ind_cpa_serialize_public_key_89( out->public_key.ind_cpa_public_key.t_as_ntt, Eurydice_array_to_slice( (size_t)32U, out->public_key.ind_cpa_public_key.seed_for_A, uint8_t), pk_serialized); uint8_t uu____2[32U]; libcrux_ml_kem_hash_functions_portable_H_4a_e0( Eurydice_array_to_slice((size_t)1184U, pk_serialized, uint8_t), uu____2); memcpy(out->public_key.public_key_hash, uu____2, (size_t)32U * sizeof(uint8_t)); uint8_t uu____3[32U]; Result_fb dst; Eurydice_slice_to_array2(&dst, implicit_rejection_value, Eurydice_slice, uint8_t[32U], TryFromSliceError); unwrap_26_b3(dst, uu____3); memcpy(out->private_key.implicit_rejection_value, uu____3, (size_t)32U * sizeof(uint8_t)); } /** Generate a key pair */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.instantiations.portable.unpacked.generate_keypair with const generics - K= 3 - CPA_PRIVATE_KEY_SIZE= 1152 - PRIVATE_KEY_SIZE= 2400 - PUBLIC_KEY_SIZE= 1184 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_instantiations_portable_unpacked_generate_keypair_ce( uint8_t randomness[64U], libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *out) { /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_randomness[64U]; memcpy(copy_of_randomness, randomness, (size_t)64U * sizeof(uint8_t)); libcrux_ml_kem_ind_cca_unpacked_generate_keypair_15(copy_of_randomness, out); } /** Generate ML-KEM 768 Key Pair in "unpacked" form. */ static inline void libcrux_ml_kem_mlkem768_portable_unpacked_generate_key_pair_mut( uint8_t randomness[64U], libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *key_pair) { /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_randomness[64U]; memcpy(copy_of_randomness, randomness, (size_t)64U * sizeof(uint8_t)); libcrux_ml_kem_ind_cca_instantiations_portable_unpacked_generate_keypair_ce( copy_of_randomness, key_pair); } /** This function found in impl {core::default::Default for libcrux_ml_kem::ind_cca::unpacked::MlKemPublicKeyUnpacked[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.default_30 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 libcrux_ml_kem_ind_cca_unpacked_default_30_1b(void) { return ( KRML_CLITERAL(libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0){ .ind_cpa_public_key = libcrux_ml_kem_ind_cpa_unpacked_default_8b_1b(), .public_key_hash = {0U}}); } /** This function found in impl {core::default::Default for libcrux_ml_kem::ind_cca::unpacked::MlKemKeyPairUnpacked[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.default_7b with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked libcrux_ml_kem_ind_cca_unpacked_default_7b_1b(void) { libcrux_ml_kem_ind_cca_unpacked_MlKemPrivateKeyUnpacked_a0 uu____0 = { .ind_cpa_private_key = libcrux_ml_kem_ind_cpa_unpacked_default_70_1b(), .implicit_rejection_value = {0U}}; return (KRML_CLITERAL( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked){ .private_key = uu____0, .public_key = libcrux_ml_kem_ind_cca_unpacked_default_30_1b()}); } /** Generate ML-KEM 768 Key Pair in "unpacked" form. */ static inline libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked libcrux_ml_kem_mlkem768_portable_unpacked_generate_key_pair( uint8_t randomness[64U]) { libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked key_pair = libcrux_ml_kem_ind_cca_unpacked_default_7b_1b(); uint8_t uu____0[64U]; memcpy(uu____0, randomness, (size_t)64U * sizeof(uint8_t)); libcrux_ml_kem_mlkem768_portable_unpacked_generate_key_pair_mut(uu____0, &key_pair); return key_pair; } /** Create a new, empty unpacked key. */ static inline libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked libcrux_ml_kem_mlkem768_portable_unpacked_init_key_pair(void) { return libcrux_ml_kem_ind_cca_unpacked_default_7b_1b(); } /** Create a new, empty unpacked public key. */ static inline libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 libcrux_ml_kem_mlkem768_portable_unpacked_init_public_key(void) { return libcrux_ml_kem_ind_cca_unpacked_default_30_1b(); } /** Take a serialized private key and generate an unpacked key pair from it. */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.keys_from_private_key with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - SECRET_KEY_SIZE= 2400 - CPA_SECRET_KEY_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 - T_AS_NTT_ENCODED_SIZE= 1152 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_unpacked_keys_from_private_key_42( libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key, libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *key_pair) { Eurydice_slice_uint8_t_x4 uu____0 = libcrux_ml_kem_types_unpack_private_key_b4( Eurydice_array_to_slice((size_t)2400U, private_key->value, uint8_t)); Eurydice_slice ind_cpa_secret_key = uu____0.fst; Eurydice_slice ind_cpa_public_key = uu____0.snd; Eurydice_slice ind_cpa_public_key_hash = uu____0.thd; Eurydice_slice implicit_rejection_value = uu____0.f3; libcrux_ml_kem_ind_cpa_deserialize_vector_1b( ind_cpa_secret_key, key_pair->private_key.ind_cpa_private_key.secret_as_ntt); libcrux_ml_kem_ind_cpa_build_unpacked_public_key_mut_3f( ind_cpa_public_key, &key_pair->public_key.ind_cpa_public_key); Eurydice_slice_copy( Eurydice_array_to_slice((size_t)32U, key_pair->public_key.public_key_hash, uint8_t), ind_cpa_public_key_hash, uint8_t); Eurydice_slice_copy( Eurydice_array_to_slice( (size_t)32U, key_pair->private_key.implicit_rejection_value, uint8_t), implicit_rejection_value, uint8_t); Eurydice_slice_copy( Eurydice_array_to_slice( (size_t)32U, key_pair->public_key.ind_cpa_public_key.seed_for_A, uint8_t), Eurydice_slice_subslice_from(ind_cpa_public_key, (size_t)1152U, uint8_t, size_t, uint8_t[]), uint8_t); } /** Take a serialized private key and generate an unpacked key pair from it. */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.instantiations.portable.unpacked.keypair_from_private_key with const generics - K= 3 - SECRET_KEY_SIZE= 2400 - CPA_SECRET_KEY_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 - T_AS_NTT_ENCODED_SIZE= 1152 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_instantiations_portable_unpacked_keypair_from_private_key_fd( libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key, libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *key_pair) { libcrux_ml_kem_ind_cca_unpacked_keys_from_private_key_42(private_key, key_pair); } /** Get an unpacked key from a private key. */ static inline void libcrux_ml_kem_mlkem768_portable_unpacked_key_pair_from_private_mut( libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key, libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *key_pair) { libcrux_ml_kem_ind_cca_instantiations_portable_unpacked_keypair_from_private_key_fd( private_key, key_pair); } /** This function found in impl {libcrux_ml_kem::ind_cca::unpacked::MlKemKeyPairUnpacked[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.serialized_private_key_mut_11 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - CPA_PRIVATE_KEY_SIZE= 1152 - PRIVATE_KEY_SIZE= 2400 - PUBLIC_KEY_SIZE= 1184 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_unpacked_serialized_private_key_mut_11_43( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *self, libcrux_ml_kem_types_MlKemPrivateKey_d9 *serialized) { libcrux_ml_kem_utils_extraction_helper_Keypair768 uu____0 = libcrux_ml_kem_ind_cpa_serialize_unpacked_secret_key_6c( &self->public_key.ind_cpa_public_key, &self->private_key.ind_cpa_private_key); uint8_t ind_cpa_private_key[1152U]; memcpy(ind_cpa_private_key, uu____0.fst, (size_t)1152U * sizeof(uint8_t)); uint8_t ind_cpa_public_key[1184U]; memcpy(ind_cpa_public_key, uu____0.snd, (size_t)1184U * sizeof(uint8_t)); libcrux_ml_kem_ind_cca_serialize_kem_secret_key_mut_d6( Eurydice_array_to_slice((size_t)1152U, ind_cpa_private_key, uint8_t), Eurydice_array_to_slice((size_t)1184U, ind_cpa_public_key, uint8_t), Eurydice_array_to_slice( (size_t)32U, self->private_key.implicit_rejection_value, uint8_t), serialized->value); } /** This function found in impl {libcrux_ml_kem::ind_cca::unpacked::MlKemKeyPairUnpacked[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.serialized_private_key_11 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - CPA_PRIVATE_KEY_SIZE= 1152 - PRIVATE_KEY_SIZE= 2400 - PUBLIC_KEY_SIZE= 1184 */ static KRML_MUSTINLINE libcrux_ml_kem_types_MlKemPrivateKey_d9 libcrux_ml_kem_ind_cca_unpacked_serialized_private_key_11_43( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *self) { libcrux_ml_kem_types_MlKemPrivateKey_d9 sk = libcrux_ml_kem_types_default_d3_28(); libcrux_ml_kem_ind_cca_unpacked_serialized_private_key_mut_11_43(self, &sk); return sk; } /** Get the serialized private key. */ static inline libcrux_ml_kem_types_MlKemPrivateKey_d9 libcrux_ml_kem_mlkem768_portable_unpacked_key_pair_serialized_private_key( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *key_pair) { return libcrux_ml_kem_ind_cca_unpacked_serialized_private_key_11_43(key_pair); } /** Get the serialized private key. */ static inline void libcrux_ml_kem_mlkem768_portable_unpacked_key_pair_serialized_private_key_mut( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *key_pair, libcrux_ml_kem_types_MlKemPrivateKey_d9 *serialized) { libcrux_ml_kem_ind_cca_unpacked_serialized_private_key_mut_11_43(key_pair, serialized); } /** This function found in impl {libcrux_ml_kem::ind_cca::unpacked::MlKemPublicKeyUnpacked[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.serialized_dd with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - PUBLIC_KEY_SIZE= 1184 */ static KRML_MUSTINLINE libcrux_ml_kem_types_MlKemPublicKey_30 libcrux_ml_kem_ind_cca_unpacked_serialized_dd_89( libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 *self) { uint8_t ret[1184U]; libcrux_ml_kem_ind_cpa_serialize_public_key_89( self->ind_cpa_public_key.t_as_ntt, Eurydice_array_to_slice((size_t)32U, self->ind_cpa_public_key.seed_for_A, uint8_t), ret); return libcrux_ml_kem_types_from_fd_d0(ret); } /** This function found in impl {libcrux_ml_kem::ind_cca::unpacked::MlKemKeyPairUnpacked[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.serialized_public_key_11 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - PUBLIC_KEY_SIZE= 1184 */ static KRML_MUSTINLINE libcrux_ml_kem_types_MlKemPublicKey_30 libcrux_ml_kem_ind_cca_unpacked_serialized_public_key_11_89( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *self) { return libcrux_ml_kem_ind_cca_unpacked_serialized_dd_89(&self->public_key); } /** Get the serialized public key. */ static inline libcrux_ml_kem_types_MlKemPublicKey_30 libcrux_ml_kem_mlkem768_portable_unpacked_key_pair_serialized_public_key( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *key_pair) { return libcrux_ml_kem_ind_cca_unpacked_serialized_public_key_11_89(key_pair); } /** This function found in impl {libcrux_ml_kem::ind_cca::unpacked::MlKemPublicKeyUnpacked[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.serialized_mut_dd with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - PUBLIC_KEY_SIZE= 1184 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_unpacked_serialized_mut_dd_89( libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 *self, libcrux_ml_kem_types_MlKemPublicKey_30 *serialized) { libcrux_ml_kem_ind_cpa_serialize_public_key_mut_89( self->ind_cpa_public_key.t_as_ntt, Eurydice_array_to_slice((size_t)32U, self->ind_cpa_public_key.seed_for_A, uint8_t), serialized->value); } /** This function found in impl {libcrux_ml_kem::ind_cca::unpacked::MlKemKeyPairUnpacked[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.serialized_public_key_mut_11 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - PUBLIC_KEY_SIZE= 1184 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_unpacked_serialized_public_key_mut_11_89( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *self, libcrux_ml_kem_types_MlKemPublicKey_30 *serialized) { libcrux_ml_kem_ind_cca_unpacked_serialized_mut_dd_89(&self->public_key, serialized); } /** Get the serialized public key. */ static inline void libcrux_ml_kem_mlkem768_portable_unpacked_key_pair_serialized_public_key_mut( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *key_pair, libcrux_ml_kem_types_MlKemPublicKey_30 *serialized) { libcrux_ml_kem_ind_cca_unpacked_serialized_public_key_mut_11_89(key_pair, serialized); } /** This function found in impl {core::clone::Clone for libcrux_ml_kem::ind_cpa::unpacked::IndCpaPublicKeyUnpacked[TraitClause@@0, TraitClause@@2]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.unpacked.clone_91 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static inline libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 libcrux_ml_kem_ind_cpa_unpacked_clone_91_1b( libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 *self) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d uu____0[3U]; core_array__core__clone__Clone_for__Array_T__N___clone( (size_t)3U, self->t_as_ntt, uu____0, libcrux_ml_kem_polynomial_PolynomialRingElement_1d, void *); uint8_t uu____1[32U]; core_array__core__clone__Clone_for__Array_T__N___clone( (size_t)32U, self->seed_for_A, uu____1, uint8_t, void *); libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 lit; memcpy( lit.t_as_ntt, uu____0, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); memcpy(lit.seed_for_A, uu____1, (size_t)32U * sizeof(uint8_t)); libcrux_ml_kem_polynomial_PolynomialRingElement_1d ret[3U][3U]; core_array__core__clone__Clone_for__Array_T__N___clone( (size_t)3U, self->A, ret, libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U], void *); memcpy(lit.A, ret, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U])); return lit; } /** This function found in impl {core::clone::Clone for libcrux_ml_kem::ind_cca::unpacked::MlKemPublicKeyUnpacked[TraitClause@@0, TraitClause@@2]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.clone_d7 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static inline libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 libcrux_ml_kem_ind_cca_unpacked_clone_d7_1b( libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 *self) { libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 lit; lit.ind_cpa_public_key = libcrux_ml_kem_ind_cpa_unpacked_clone_91_1b(&self->ind_cpa_public_key); uint8_t ret[32U]; core_array__core__clone__Clone_for__Array_T__N___clone( (size_t)32U, self->public_key_hash, ret, uint8_t, void *); memcpy(lit.public_key_hash, ret, (size_t)32U * sizeof(uint8_t)); return lit; } /** This function found in impl {libcrux_ml_kem::ind_cca::unpacked::MlKemKeyPairUnpacked[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.public_key_11 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 * libcrux_ml_kem_ind_cca_unpacked_public_key_11_1b( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *self) { return &self->public_key; } /** Get the unpacked public key. */ static inline void libcrux_ml_kem_mlkem768_portable_unpacked_public_key( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *key_pair, libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 *pk) { libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 uu____0 = libcrux_ml_kem_ind_cca_unpacked_clone_d7_1b( libcrux_ml_kem_ind_cca_unpacked_public_key_11_1b(key_pair)); pk[0U] = uu____0; } /** Get the serialized public key. */ static inline void libcrux_ml_kem_mlkem768_portable_unpacked_serialized_public_key( libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 *public_key, libcrux_ml_kem_types_MlKemPublicKey_30 *serialized) { libcrux_ml_kem_ind_cca_unpacked_serialized_mut_dd_89(public_key, serialized); } /** Generate an unpacked key from a serialized key. */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.unpack_public_key with types libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]], libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - T_AS_NTT_ENCODED_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_unpacked_unpack_public_key_0a( libcrux_ml_kem_types_MlKemPublicKey_30 *public_key, libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 *unpacked_public_key) { Eurydice_slice uu____0 = Eurydice_array_to_subslice_to((size_t)1184U, public_key->value, (size_t)1152U, uint8_t, size_t, uint8_t[]); libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_1b( uu____0, unpacked_public_key->ind_cpa_public_key.t_as_ntt); uint8_t uu____1[32U]; libcrux_ml_kem_utils_into_padded_array_9e( Eurydice_array_to_subslice_from((size_t)1184U, public_key->value, (size_t)1152U, uint8_t, size_t, uint8_t[]), uu____1); memcpy(unpacked_public_key->ind_cpa_public_key.seed_for_A, uu____1, (size_t)32U * sizeof(uint8_t)); libcrux_ml_kem_polynomial_PolynomialRingElement_1d(*uu____2)[3U] = unpacked_public_key->ind_cpa_public_key.A; uint8_t ret[34U]; libcrux_ml_kem_utils_into_padded_array_b6( Eurydice_array_to_subslice_from((size_t)1184U, public_key->value, (size_t)1152U, uint8_t, size_t, uint8_t[]), ret); libcrux_ml_kem_matrix_sample_matrix_A_2b(uu____2, ret, false); uint8_t uu____3[32U]; libcrux_ml_kem_hash_functions_portable_H_4a_e0( Eurydice_array_to_slice((size_t)1184U, libcrux_ml_kem_types_as_slice_e6_d0(public_key), uint8_t), uu____3); memcpy(unpacked_public_key->public_key_hash, uu____3, (size_t)32U * sizeof(uint8_t)); } /** Get the unpacked public key. */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.instantiations.portable.unpacked.unpack_public_key with const generics - K= 3 - T_AS_NTT_ENCODED_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_instantiations_portable_unpacked_unpack_public_key_31( libcrux_ml_kem_types_MlKemPublicKey_30 *public_key, libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 *unpacked_public_key) { libcrux_ml_kem_ind_cca_unpacked_unpack_public_key_0a(public_key, unpacked_public_key); } /** Get the unpacked public key. */ static inline void libcrux_ml_kem_mlkem768_portable_unpacked_unpacked_public_key( libcrux_ml_kem_types_MlKemPublicKey_30 *public_key, libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 *unpacked_public_key) { libcrux_ml_kem_ind_cca_instantiations_portable_unpacked_unpack_public_key_31( public_key, unpacked_public_key); } #if defined(__cplusplus) } #endif #define libcrux_mlkem768_portable_H_DEFINED #endif /* libcrux_mlkem768_portable_H */ /* rename some types to be a bit more ergonomic */ #define libcrux_mlkem768_keypair libcrux_ml_kem_mlkem768_MlKem768KeyPair_s #define libcrux_mlkem768_pk libcrux_ml_kem_types_MlKemPublicKey_30_s #define libcrux_mlkem768_sk libcrux_ml_kem_types_MlKemPrivateKey_d9_s #define libcrux_mlkem768_ciphertext libcrux_ml_kem_mlkem768_MlKem768Ciphertext_s #define libcrux_mlkem768_enc_result tuple_c2_s /* defines for PRNG inputs */ #define LIBCRUX_ML_KEM_KEY_PAIR_PRNG_LEN 64U #define LIBCRUX_ML_KEM_ENC_PRNG_LEN 32 @ 1.6 log @Add missing NetBSD CVSID's @ text @d1 1 a1 1 /* $NetBSD$ */ @ 1.5 log @put back removed files @ text @d1 1 @ 1.4 log @Merge conflicts between 10.3 and 10.5 @ text @@ 1.3 log @Merge changes between OpenSSH-10.2 and 10.3 @ text @@ 1.2 log @openssh: Fix mlkem768x25519-sha256 KEX algorithm for big-endian machines Tested for macppc. This KEX algorithm has been added to OpenSSH 9.9, and no release branches are affected. Cherry-picked from upstream: (1/2) https://github.com/openbsd/src/commit/66207d7b19f fix ML-KEM768x25519 KEX on big-endian systems; spotted by jsg@@ feedback/ok deraadt@@ (2/2) https://github.com/openbsd/src/commit/c42fee07eda explicitly include endian.h @ text @d1 1 a1 1 /* $OpenBSD: libcrux_mlkem768_sha3.h,v 1.2 2024/10/27 02:06:01 djm Exp $ */ d3 1 a3 1 /* Extracted from libcrux revision 84c5d87b3092c59294345aa269ceefe0eb97cc35 */ d37 61 a97 7 /* from libcrux/libcrux-ml-kem/cg/eurydice_glue.h */ /* * SPDX-FileCopyrightText: 2024 Eurydice Contributors * SPDX-FileCopyrightText: 2024 Cryspen Sarl * * SPDX-License-Identifier: MIT or Apache-2.0 */ d99 1 d102 8 d111 3 a113 1 extern "C" { d117 11 d129 6 a134 1 // SLICES, ARRAYS, ETC. a135 7 // The MSVC C++ compiler does not support compound literals. // This CLITERAL is used to turn `(type){...}` into `type{...}` when using a C++ // compiler. #if defined(__cplusplus) #define CLITERAL(type) type #else #define CLITERAL(type) (type) d138 15 d157 2 a158 3 // performing pointer // arithmetic on it (remember that C desugars pointer arithmetic based on the // type of the address) d160 1 a160 2 // need to multiply it // by sizeof t, where t is the type of the elements. d162 3 a164 3 // Empty slices have `len == 0` and `ptr` always needs to be valid pointer that // is not NULL (otherwise the construction in EURYDICE_SLICE computes `NULL + // start`). d170 13 d188 6 a193 2 (CLITERAL(Eurydice_slice){.ptr = (void *)(x + start), .len = end - start}) #define EURYDICE_SLICE_LEN(s, _) s.len d200 4 a203 1 #define Eurydice_slice_subslice(s, r, t, _) \ d205 1 d209 8 a216 2 EURYDICE_SLICE((t *)s.ptr, start, end) #define Eurydice_slice_subslice_to(s, subslice_end_pos, t, _) \ d218 2 a219 1 #define Eurydice_slice_subslice_from(s, subslice_start_pos, t, _) \ d221 1 d225 1 a225 1 #define Eurydice_array_to_subslice(_arraylen, x, r, t, _) \ d227 1 d230 12 a241 2 EURYDICE_SLICE((t *)x, start, end) #define Eurydice_array_to_subslice_to(_size, x, r, t, _range_t) \ d243 1 a243 1 #define Eurydice_array_to_subslice_from(size, x, r, t, _range_t) \ d245 2 a246 1 #define Eurydice_slice_len(s, t) EURYDICE_SLICE_LEN(s, t) a248 2 #define core_array___Array_T__N__23__as_slice(len_, ptr_, t, _ret_t) \ ((Eurydice_slice){.ptr = ptr_, .len = len_}) d250 5 a254 2 #define core_array___core__clone__Clone_for__Array_T__N___20__clone( \ len, src, dst, elem_type, _ret_t) \ d257 7 a264 2 #define Eurydice_array_eq(sz, a1, a2, t, _) \ (memcmp(a1, a2, sz * sizeof(t)) == 0) d272 19 a290 9 #define Eurydice_slice_split_at(slice, mid, element_type, ret_t) \ (CLITERAL(ret_t){ \ .fst = EURYDICE_SLICE((element_type *)slice.ptr, 0, mid), \ .snd = EURYDICE_SLICE((element_type *)slice.ptr, mid, slice.len)}) #define Eurydice_slice_split_at_mut(slice, mid, element_type, ret_t) \ (CLITERAL(ret_t){ \ .fst = {.ptr = slice.ptr, .len = mid}, \ .snd = {.ptr = (char *)slice.ptr + mid * sizeof(element_type), \ .len = slice.len - mid}}) d295 1 a295 1 #define Eurydice_slice_to_array2(dst, src, _, t_arr) \ d305 31 d338 31 a368 3 static inline void core_num__u64_9__to_le_bytes(uint64_t v, uint8_t buf[8]) { v = htole64(v); memcpy(buf, &v, sizeof(v)); d370 14 a383 4 static inline uint64_t core_num__u64_9__from_le_bytes(uint8_t buf[8]) { uint64_t v; memcpy(&v, buf, sizeof(v)); return le64toh(v); d386 6 a391 4 static inline uint32_t core_num__u32_8__from_le_bytes(uint8_t buf[4]) { uint32_t v; memcpy(&v, buf, sizeof(v)); return le32toh(v); d394 1 a394 1 static inline uint32_t core_num__u8_6__count_ones(uint8_t x0) { d402 8 d411 1 a411 1 static inline uint16_t core_num__u16_7__wrapping_add(uint16_t x, uint16_t y) { d414 1 a414 1 static inline uint8_t core_num__u8_6__wrapping_sub(uint8_t x, uint8_t y) { d417 40 d460 6 a465 4 #define Eurydice_range_iter_next(iter_ptr, t, ret_t) \ (((iter_ptr)->start == (iter_ptr)->end) \ ? (CLITERAL(ret_t){.tag = None}) \ : (CLITERAL(ret_t){.tag = Some, .f0 = (iter_ptr)->start++})) d467 1 a467 1 #define core_iter_range___core__iter__traits__iterator__Iterator_for_core__ops__range__Range_A___6__next \ d471 2 a472 2 #define Eurydice_into_iter(x, t, _ret_t) (x) #define core_iter_traits_collect___core__iter__traits__collect__IntoIterator_for_I__1__into_iter \ d475 82 a556 1 #if defined(__cplusplus) a557 1 #endif d559 7 a565 1 /* from libcrux/libcrux-ml-kem/cg/libcrux_core.h */ d567 1 a567 1 * SPDX-FileCopyrightText: 2024 Cryspen Sarl d572 5 a576 5 * Charon: 6b5e110342a771a3e1c739b10294b1778e4be8b4 * Eurydice: 31be7d65ca5d6acdacfb33652e478d24dd85c1cb * Karamel: 3205d3365ea2790b02368f79fcee38e38d0b5908 * F*: a32b316e521fa4f239b610ec8f1d15e78d62cbe8-dirty * Libcrux: 4ad532b206174114dd4140b718e7794a28fc59ee d579 3 a581 2 #ifndef __libcrux_core_H #define __libcrux_core_H a586 1 d592 1 a592 1 typedef struct core_ops_range_Range_b3_s { d595 1 a595 15 } core_ops_range_Range_b3; #define Ok 0 #define Err 1 typedef uint8_t Result_86_tags; #define None 0 #define Some 1 typedef uint8_t Option_ef_tags; /** A monomorphic instance of core.option.Option with types size_t d597 1 a597 7 */ typedef struct Option_b3_s { Option_ef_tags tag; size_t f0; } Option_b3; static inline uint16_t core_num__u16_7__wrapping_add(uint16_t x0, uint16_t x1); d599 1 a599 1 #define CORE_NUM__U32_8__BITS (32U) d601 1 a601 1 static inline uint64_t core_num__u64_9__from_le_bytes(uint8_t x0[8U]); d603 1 a603 1 static inline void core_num__u64_9__to_le_bytes(uint64_t x0, uint8_t x1[8U]); d605 1 a605 1 static inline uint32_t core_num__u8_6__count_ones(uint8_t x0); d607 1 a607 1 static inline uint8_t core_num__u8_6__wrapping_sub(uint8_t x0, uint8_t x1); d623 2 a626 5 typedef struct libcrux_ml_kem_utils_extraction_helper_Keypair768_s { uint8_t fst[1152U]; uint8_t snd[1184U]; } libcrux_ml_kem_utils_extraction_helper_Keypair768; d628 1 a628 2 A monomorphic instance of core.result.Result with types uint8_t[24size_t], core_array_TryFromSliceError d630 2 d633 4 a636 7 typedef struct Result_6f_s { Result_86_tags tag; union { uint8_t case_Ok[24U]; TryFromSliceError case_Err; } val; } Result_6f; d639 1 a639 1 This function found in impl {core::result::Result} d642 2 a643 2 A monomorphic instance of core.result.unwrap_41 with types uint8_t[24size_t], core_array_TryFromSliceError d646 3 a648 10 static inline void unwrap_41_1c(Result_6f self, uint8_t ret[24U]) { if (self.tag == Ok) { uint8_t f0[24U]; memcpy(f0, self.val.case_Ok, (size_t)24U * sizeof(uint8_t)); memcpy(ret, f0, (size_t)24U * sizeof(uint8_t)); } else { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "unwrap not Ok"); KRML_HOST_EXIT(255U); } d652 1 a652 14 A monomorphic instance of core.result.Result with types uint8_t[20size_t], core_array_TryFromSliceError */ typedef struct Result_7a_s { Result_86_tags tag; union { uint8_t case_Ok[20U]; TryFromSliceError case_Err; } val; } Result_7a; /** This function found in impl {core::result::Result} d655 2 a656 2 A monomorphic instance of core.result.unwrap_41 with types uint8_t[20size_t], core_array_TryFromSliceError d659 3 a661 10 static inline void unwrap_41_34(Result_7a self, uint8_t ret[20U]) { if (self.tag == Ok) { uint8_t f0[20U]; memcpy(f0, self.val.case_Ok, (size_t)20U * sizeof(uint8_t)); memcpy(ret, f0, (size_t)20U * sizeof(uint8_t)); } else { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "unwrap not Ok"); KRML_HOST_EXIT(255U); } d665 1 a665 3 A monomorphic instance of core.result.Result with types uint8_t[10size_t], core_array_TryFromSliceError d667 4 a670 7 typedef struct Result_cd_s { Result_86_tags tag; union { uint8_t case_Ok[10U]; TryFromSliceError case_Err; } val; } Result_cd; d673 1 a673 1 This function found in impl {core::result::Result} d676 2 a677 2 A monomorphic instance of core.result.unwrap_41 with types uint8_t[10size_t], core_array_TryFromSliceError d680 3 a682 10 static inline void unwrap_41_e8(Result_cd self, uint8_t ret[10U]) { if (self.tag == Ok) { uint8_t f0[10U]; memcpy(f0, self.val.case_Ok, (size_t)10U * sizeof(uint8_t)); memcpy(ret, f0, (size_t)10U * sizeof(uint8_t)); } else { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "unwrap not Ok"); KRML_HOST_EXIT(255U); } a684 9 typedef struct Eurydice_slice_uint8_t_4size_t__x2_s { Eurydice_slice fst[4U]; Eurydice_slice snd[4U]; } Eurydice_slice_uint8_t_4size_t__x2; typedef struct libcrux_ml_kem_mlkem768_MlKem768Ciphertext_s { uint8_t value[1088U]; } libcrux_ml_kem_mlkem768_MlKem768Ciphertext; d686 1 a686 1 A reference to the raw byte slice. d689 3 a691 1 This function found in impl {libcrux_ml_kem::types::MlKemCiphertext#6} d693 3 a695 8 /** A monomorphic instance of libcrux_ml_kem.types.as_slice_d4 with const generics - SIZE= 1088 */ static inline uint8_t *libcrux_ml_kem_types_as_slice_d4_1d( libcrux_ml_kem_mlkem768_MlKem768Ciphertext *self) { return self->value; d699 1 a699 3 A monomorphic instance of libcrux_ml_kem.types.MlKemPublicKey with const generics - $1184size_t d701 4 a704 3 typedef struct libcrux_ml_kem_types_MlKemPublicKey_15_s { uint8_t value[1184U]; } libcrux_ml_kem_types_MlKemPublicKey_15; d707 1 a707 2 This function found in impl {(core::convert::From<@@Array> for libcrux_ml_kem::types::MlKemPublicKey)#14} d710 3 a712 3 A monomorphic instance of libcrux_ml_kem.types.from_b6 with const generics - SIZE= 1184 d714 3 a716 8 static inline libcrux_ml_kem_types_MlKemPublicKey_15 libcrux_ml_kem_types_from_b6_da(uint8_t value[1184U]) { /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_value[1184U]; memcpy(copy_of_value, value, (size_t)1184U * sizeof(uint8_t)); libcrux_ml_kem_types_MlKemPublicKey_15 lit; memcpy(lit.value, copy_of_value, (size_t)1184U * sizeof(uint8_t)); return lit; d720 1 a720 3 A monomorphic instance of libcrux_ml_kem.types.MlKemPrivateKey with const generics - $2400size_t d722 4 a725 8 typedef struct libcrux_ml_kem_types_MlKemPrivateKey_55_s { uint8_t value[2400U]; } libcrux_ml_kem_types_MlKemPrivateKey_55; typedef struct libcrux_ml_kem_mlkem768_MlKem768KeyPair_s { libcrux_ml_kem_types_MlKemPrivateKey_55 sk; libcrux_ml_kem_types_MlKemPublicKey_15 pk; } libcrux_ml_kem_mlkem768_MlKem768KeyPair; d728 1 a728 1 Create a new [`MlKemKeyPair`] from the secret and public key. d731 3 a733 2 This function found in impl {libcrux_ml_kem::types::MlKemKeyPair} d735 5 d741 1 a741 4 A monomorphic instance of libcrux_ml_kem.types.from_17 with const generics - PRIVATE_KEY_SIZE= 2400 - PUBLIC_KEY_SIZE= 1184 d743 3 a745 5 static inline libcrux_ml_kem_mlkem768_MlKem768KeyPair libcrux_ml_kem_types_from_17_35(libcrux_ml_kem_types_MlKemPrivateKey_55 sk, libcrux_ml_kem_types_MlKemPublicKey_15 pk) { return ( CLITERAL(libcrux_ml_kem_mlkem768_MlKem768KeyPair){.sk = sk, .pk = pk}); d749 1 a749 2 This function found in impl {(core::convert::From<@@Array> for libcrux_ml_kem::types::MlKemPrivateKey)#8} d752 3 a754 3 A monomorphic instance of libcrux_ml_kem.types.from_05 with const generics - SIZE= 2400 d756 3 a758 8 static inline libcrux_ml_kem_types_MlKemPrivateKey_55 libcrux_ml_kem_types_from_05_f2(uint8_t value[2400U]) { /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_value[2400U]; memcpy(copy_of_value, value, (size_t)2400U * sizeof(uint8_t)); libcrux_ml_kem_types_MlKemPrivateKey_55 lit; memcpy(lit.value, copy_of_value, (size_t)2400U * sizeof(uint8_t)); return lit; d762 1 a762 3 A monomorphic instance of core.result.Result with types uint8_t[32size_t], core_array_TryFromSliceError d764 4 a767 7 typedef struct Result_00_s { Result_86_tags tag; union { uint8_t case_Ok[32U]; TryFromSliceError case_Err; } val; } Result_00; d770 1 a770 1 This function found in impl {core::result::Result} d773 2 a774 2 A monomorphic instance of core.result.unwrap_41 with types uint8_t[32size_t], core_array_TryFromSliceError d777 318 a1094 1 static inline void unwrap_41_83(Result_00 self, uint8_t ret[32U]) { d1106 4 d1116 1 a1116 1 typedef struct tuple_3c_s { d1119 1 a1119 1 } tuple_3c; d1122 2 a1123 2 This function found in impl {(core::convert::From<@@Array> for libcrux_ml_kem::types::MlKemCiphertext)#2} d1126 1 a1126 1 A monomorphic instance of libcrux_ml_kem.types.from_01 d1131 1 a1131 1 libcrux_ml_kem_types_from_01_9f(uint8_t value[1088U]) { d1141 6 a1146 1 A reference to the raw byte slice. d1148 5 d1154 1 a1154 1 This function found in impl {libcrux_ml_kem::types::MlKemPublicKey#18} d1157 1 a1157 1 A monomorphic instance of libcrux_ml_kem.types.as_slice_cb d1159 1 a1159 1 - SIZE= 1184 d1161 2 a1162 2 static inline uint8_t *libcrux_ml_kem_types_as_slice_cb_50( libcrux_ml_kem_types_MlKemPublicKey_15 *self) { d1167 15 d1189 1 a1189 1 static KRML_MUSTINLINE void libcrux_ml_kem_utils_into_padded_array_ea2( d1194 2 a1195 2 Eurydice_array_to_subslice2(uu____0, (size_t)0U, Eurydice_slice_len(slice, uint8_t), uint8_t), d1208 1 a1208 1 static KRML_MUSTINLINE void libcrux_ml_kem_utils_into_padded_array_ea1( d1213 2 a1214 2 Eurydice_array_to_subslice2(uu____0, (size_t)0U, Eurydice_slice_len(slice, uint8_t), uint8_t), d1220 2 a1221 2 This function found in impl {(core::convert::AsRef<@@Slice> for libcrux_ml_kem::types::MlKemCiphertext)#1} d1224 1 a1224 1 A monomorphic instance of libcrux_ml_kem.types.as_ref_00 d1228 1 a1228 1 static inline Eurydice_slice libcrux_ml_kem_types_as_ref_00_24( d1241 1 a1241 1 static KRML_MUSTINLINE void libcrux_ml_kem_utils_into_padded_array_ea0( d1246 2 a1247 2 Eurydice_array_to_subslice2(uu____0, (size_t)0U, Eurydice_slice_len(slice, uint8_t), uint8_t), d1260 1 a1260 1 static KRML_MUSTINLINE void libcrux_ml_kem_utils_into_padded_array_ea( d1265 2 a1266 2 Eurydice_array_to_subslice2(uu____0, (size_t)0U, Eurydice_slice_len(slice, uint8_t), uint8_t), d1271 142 d1418 2 a1419 2 typedef struct Result_c0_s { Result_86_tags tag; d1424 1 a1424 1 } Result_c0; d1427 2 a1428 1 This function found in impl {core::result::Result} d1431 1 a1431 1 A monomorphic instance of core.result.unwrap_41 d1435 1 a1435 1 static inline void unwrap_41_f9(Result_c0 self, int16_t ret[16U]) { d1452 2 a1453 2 typedef struct Result_56_s { Result_86_tags tag; d1458 1 a1458 1 } Result_56; d1461 2 a1462 1 This function found in impl {core::result::Result} d1465 1 a1465 1 A monomorphic instance of core.result.unwrap_41 d1469 1 a1469 1 static inline void unwrap_41_ac(Result_56 self, uint8_t ret[8U]) { a1480 10 typedef struct Eurydice_slice_uint8_t_x2_s { Eurydice_slice fst; Eurydice_slice snd; } Eurydice_slice_uint8_t_x2; typedef struct Eurydice_slice_uint8_t_1size_t__x2_s { Eurydice_slice fst[1U]; Eurydice_slice snd[1U]; } Eurydice_slice_uint8_t_1size_t__x2; d1485 2 a1486 2 #define __libcrux_core_H_DEFINED #endif d1488 1 a1488 1 /* from libcrux/libcrux-ml-kem/cg/libcrux_ct_ops.h */ d1490 1 a1490 1 * SPDX-FileCopyrightText: 2024 Cryspen Sarl d1495 5 a1499 5 * Charon: 6b5e110342a771a3e1c739b10294b1778e4be8b4 * Eurydice: 31be7d65ca5d6acdacfb33652e478d24dd85c1cb * Karamel: 3205d3365ea2790b02368f79fcee38e38d0b5908 * F*: a32b316e521fa4f239b610ec8f1d15e78d62cbe8-dirty * Libcrux: 4ad532b206174114dd4140b718e7794a28fc59ee d1502 3 a1504 2 #ifndef __libcrux_ct_ops_H #define __libcrux_ct_ops_H d1514 2 a1515 1 static inline uint8_t libcrux_ml_kem_constant_time_ops_inz(uint8_t value) { d1517 3 a1519 6 uint16_t result = (((uint32_t)value0 | (uint32_t)core_num__u16_7__wrapping_add(~value0, 1U)) & 0xFFFFU) >> 8U & 1U; return (uint8_t)result; d1531 1 a1531 1 static inline uint8_t libcrux_ml_kem_constant_time_ops_compare( d1536 4 a1539 3 r = (uint32_t)r | ((uint32_t)Eurydice_slice_index(lhs, i0, uint8_t, uint8_t *) ^ (uint32_t)Eurydice_slice_index(rhs, i0, uint8_t, uint8_t *)); d1554 1 a1554 1 static inline void libcrux_ml_kem_constant_time_ops_select_ct( d1557 1 a1557 1 uint8_t mask = core_num__u8_6__wrapping_sub( d1563 6 a1568 4 out[i0] = ((uint32_t)Eurydice_slice_index(lhs, i0, uint8_t, uint8_t *) & (uint32_t)mask) | ((uint32_t)Eurydice_slice_index(rhs, i0, uint8_t, uint8_t *) & (uint32_t)~mask); d1580 1 a1580 1 static inline void d1597 2 a1598 2 #define __libcrux_ct_ops_H_DEFINED #endif d1600 1 a1600 1 /* from libcrux/libcrux-ml-kem/cg/libcrux_sha3_portable.h */ d1602 1 a1602 1 * SPDX-FileCopyrightText: 2024 Cryspen Sarl d1607 5 a1611 5 * Charon: 6b5e110342a771a3e1c739b10294b1778e4be8b4 * Eurydice: 31be7d65ca5d6acdacfb33652e478d24dd85c1cb * Karamel: 3205d3365ea2790b02368f79fcee38e38d0b5908 * F*: a32b316e521fa4f239b610ec8f1d15e78d62cbe8-dirty * Libcrux: 4ad532b206174114dd4140b718e7794a28fc59ee d1614 3 a1616 2 #ifndef __libcrux_sha3_portable_H #define __libcrux_sha3_portable_H a1622 26 static const uint64_t libcrux_sha3_generic_keccak_ROUNDCONSTANTS[24U] = { 1ULL, 32898ULL, 9223372036854808714ULL, 9223372039002292224ULL, 32907ULL, 2147483649ULL, 9223372039002292353ULL, 9223372036854808585ULL, 138ULL, 136ULL, 2147516425ULL, 2147483658ULL, 2147516555ULL, 9223372036854775947ULL, 9223372036854808713ULL, 9223372036854808579ULL, 9223372036854808578ULL, 9223372036854775936ULL, 32778ULL, 9223372039002259466ULL, 9223372039002292353ULL, 9223372036854808704ULL, 2147483649ULL, 9223372039002292232ULL}; d1624 1 a1624 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d1626 1 a1626 1 static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_zero_5a(void) { d1630 1 a1630 1 static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak__veor5q_u64( d1632 1 a1632 4 uint64_t ab = a ^ b; uint64_t cd = c ^ d; uint64_t abcd = ab ^ cd; return abcd ^ e; d1636 1 a1636 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d1638 1 a1638 1 static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_xor5_5a( d1640 1 a1640 1 return libcrux_sha3_portable_keccak__veor5q_u64(a, b, c, d, e); d1644 1 a1644 1 A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left d1650 2 a1651 2 libcrux_sha3_portable_keccak_rotate_left_cb(uint64_t x) { return x << (uint32_t)(int32_t)1 | x >> (uint32_t)(int32_t)63; d1655 1 a1655 1 libcrux_sha3_portable_keccak__vrax1q_u64(uint64_t a, uint64_t b) { d1657 1 a1657 1 return uu____0 ^ libcrux_sha3_portable_keccak_rotate_left_cb(b); d1661 1 a1661 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d1664 2 a1665 2 libcrux_sha3_portable_keccak_rotate_left1_and_xor_5a(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vrax1q_u64(a, b); d1669 1 a1669 1 libcrux_sha3_portable_keccak__vbcaxq_u64(uint64_t a, uint64_t b, uint64_t c) { d1674 1 a1674 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d1676 3 a1678 3 static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_and_not_xor_5a( uint64_t a, uint64_t b, uint64_t c) { return libcrux_sha3_portable_keccak__vbcaxq_u64(a, b, c); d1682 1 a1682 1 libcrux_sha3_portable_keccak__veorq_n_u64(uint64_t a, uint64_t c) { d1687 1 a1687 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d1690 2 a1691 2 libcrux_sha3_portable_keccak_xor_constant_5a(uint64_t a, uint64_t c) { return libcrux_sha3_portable_keccak__veorq_n_u64(a, c); d1695 1 a1695 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d1697 2 a1698 2 static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_xor_5a(uint64_t a, uint64_t b) { d1702 31 a1732 4 static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_slice_1( Eurydice_slice a[1U], size_t start, size_t len, Eurydice_slice ret[1U]) { ret[0U] = Eurydice_slice_subslice2(a[0U], start, start + len, uint8_t); } d1735 4 a1738 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d1740 3 a1742 22 static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_slice_n_5a( Eurydice_slice a[1U], size_t start, size_t len, Eurydice_slice ret[1U]) { /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_a[1U]; memcpy(copy_of_a, a, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice ret0[1U]; libcrux_sha3_portable_keccak_slice_1(copy_of_a, start, len, ret0); memcpy(ret, ret0, (size_t)1U * sizeof(Eurydice_slice)); } static KRML_MUSTINLINE Eurydice_slice_uint8_t_1size_t__x2 libcrux_sha3_portable_keccak_split_at_mut_1(Eurydice_slice out[1U], size_t mid) { Eurydice_slice_uint8_t_x2 uu____0 = Eurydice_slice_split_at_mut( out[0U], mid, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice out00 = uu____0.fst; Eurydice_slice out01 = uu____0.snd; Eurydice_slice_uint8_t_1size_t__x2 lit; lit.fst[0U] = out00; lit.snd[0U] = out01; return lit; } d1745 8 a1752 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d1754 9 a1762 4 static KRML_MUSTINLINE Eurydice_slice_uint8_t_1size_t__x2 libcrux_sha3_portable_keccak_split_at_mut_n_5a(Eurydice_slice a[1U], size_t mid) { return libcrux_sha3_portable_keccak_split_at_mut_1(a, mid); d1766 1 a1766 1 A monomorphic instance of libcrux_sha3.generic_keccak.KeccakState d1769 1 a1769 1 - $1size_t d1771 5 a1775 3 typedef struct libcrux_sha3_generic_keccak_KeccakState_48_s { uint64_t st[5U][5U]; } libcrux_sha3_generic_keccak_KeccakState_48; d1778 1 a1778 8 Create a new Shake128 x4 state. */ /** This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0]#1} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.new_1e d1783 4 a1786 29 static KRML_MUSTINLINE libcrux_sha3_generic_keccak_KeccakState_48 libcrux_sha3_generic_keccak_new_1e_f4(void) { libcrux_sha3_generic_keccak_KeccakState_48 lit; lit.st[0U][0U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[0U][1U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[0U][2U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[0U][3U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[0U][4U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[1U][0U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[1U][1U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[1U][2U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[1U][3U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[1U][4U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[2U][0U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[2U][1U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[2U][2U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[2U][3U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[2U][4U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[3U][0U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[3U][1U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[3U][2U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[3U][3U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[3U][4U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[4U][0U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[4U][1U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[4U][2U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[4U][3U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[4U][4U] = libcrux_sha3_portable_keccak_zero_5a(); return lit; d1790 1 a1790 1 A monomorphic instance of libcrux_sha3.portable_keccak.load_block d1794 3 a1796 2 static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_2c( uint64_t (*s)[5U], Eurydice_slice blocks[1U]) { d1799 1 d1801 1 a1801 1 Result_56 dst; d1804 13 a1816 8 Eurydice_slice_subslice2(blocks[0U], (size_t)8U * i0, (size_t)8U * i0 + (size_t)8U, uint8_t), Eurydice_slice, uint8_t[8U]); unwrap_41_ac(dst, uu____0); size_t uu____1 = i0 / (size_t)5U; size_t uu____2 = i0 % (size_t)5U; s[uu____1][uu____2] = s[uu____1][uu____2] ^ core_num__u64_9__from_le_bytes(uu____0); d1821 4 a1824 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d1827 1 a1827 1 A monomorphic instance of libcrux_sha3.portable_keccak.load_block_5a d1831 149 a1979 7 static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_5a_b8( uint64_t (*a)[5U], Eurydice_slice b[1U]) { uint64_t(*uu____0)[5U] = a; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_b[1U]; memcpy(copy_of_b, b, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_portable_keccak_load_block_2c(uu____0, copy_of_b); d1983 1 a1983 1 A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left d1989 2 a1990 2 libcrux_sha3_portable_keccak_rotate_left_cb0(uint64_t x) { return x << (uint32_t)(int32_t)36 | x >> (uint32_t)(int32_t)28; d1994 1 a1994 1 A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 d2000 2 a2001 3 libcrux_sha3_portable_keccak__vxarq_u64_42(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb0(ab); d2005 1 a2005 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d2008 1 a2008 1 A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a d2014 2 a2015 2 libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_42(a, b); d2019 1 a2019 1 A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left d2025 2 a2026 2 libcrux_sha3_portable_keccak_rotate_left_cb1(uint64_t x) { return x << (uint32_t)(int32_t)3 | x >> (uint32_t)(int32_t)61; d2030 1 a2030 1 A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 d2036 2 a2037 3 libcrux_sha3_portable_keccak__vxarq_u64_420(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb1(ab); d2041 1 a2041 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d2044 1 a2044 1 A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a d2050 2 a2051 2 libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb0(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_420(a, b); d2055 1 a2055 1 A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left d2061 2 a2062 2 libcrux_sha3_portable_keccak_rotate_left_cb2(uint64_t x) { return x << (uint32_t)(int32_t)41 | x >> (uint32_t)(int32_t)23; d2066 1 a2066 1 A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 d2072 2 a2073 3 libcrux_sha3_portable_keccak__vxarq_u64_421(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb2(ab); d2077 1 a2077 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d2080 1 a2080 1 A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a d2086 2 a2087 2 libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb1(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_421(a, b); d2091 1 a2091 1 A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left d2097 2 a2098 2 libcrux_sha3_portable_keccak_rotate_left_cb3(uint64_t x) { return x << (uint32_t)(int32_t)18 | x >> (uint32_t)(int32_t)46; d2102 1 a2102 1 A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 d2108 2 a2109 3 libcrux_sha3_portable_keccak__vxarq_u64_422(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb3(ab); d2113 1 a2113 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d2116 1 a2116 1 A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a d2122 2 a2123 2 libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb2(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_422(a, b); d2127 1 a2127 1 A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 d2133 2 a2134 3 libcrux_sha3_portable_keccak__vxarq_u64_423(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb(ab); d2138 1 a2138 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d2141 1 a2141 1 A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a d2147 2 a2148 2 libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb3(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_423(a, b); d2152 1 a2152 1 A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left d2158 2 a2159 2 libcrux_sha3_portable_keccak_rotate_left_cb4(uint64_t x) { return x << (uint32_t)(int32_t)44 | x >> (uint32_t)(int32_t)20; d2163 1 a2163 1 A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 d2169 2 a2170 3 libcrux_sha3_portable_keccak__vxarq_u64_424(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb4(ab); d2174 1 a2174 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d2177 1 a2177 1 A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a d2183 2 a2184 2 libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb4(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_424(a, b); d2188 1 a2188 1 A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left d2194 2 a2195 2 libcrux_sha3_portable_keccak_rotate_left_cb5(uint64_t x) { return x << (uint32_t)(int32_t)10 | x >> (uint32_t)(int32_t)54; d2199 1 a2199 1 A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 d2205 2 a2206 3 libcrux_sha3_portable_keccak__vxarq_u64_425(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb5(ab); d2210 1 a2210 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d2213 1 a2213 1 A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a d2219 2 a2220 2 libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb5(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_425(a, b); d2224 1 a2224 1 A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left d2230 2 a2231 2 libcrux_sha3_portable_keccak_rotate_left_cb6(uint64_t x) { return x << (uint32_t)(int32_t)45 | x >> (uint32_t)(int32_t)19; d2235 1 a2235 1 A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 d2241 2 a2242 3 libcrux_sha3_portable_keccak__vxarq_u64_426(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb6(ab); d2246 1 a2246 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d2249 1 a2249 1 A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a d2255 2 a2256 2 libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb6(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_426(a, b); d2260 1 a2260 1 A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left d2266 2 a2267 2 libcrux_sha3_portable_keccak_rotate_left_cb7(uint64_t x) { return x << (uint32_t)(int32_t)2 | x >> (uint32_t)(int32_t)62; d2271 1 a2271 1 A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 d2277 2 a2278 3 libcrux_sha3_portable_keccak__vxarq_u64_427(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb7(ab); d2282 1 a2282 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d2285 1 a2285 1 A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a d2291 2 a2292 2 libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb7(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_427(a, b); d2296 1 a2296 1 A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left d2302 2 a2303 2 libcrux_sha3_portable_keccak_rotate_left_cb8(uint64_t x) { return x << (uint32_t)(int32_t)62 | x >> (uint32_t)(int32_t)2; d2307 1 a2307 1 A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 d2313 2 a2314 3 libcrux_sha3_portable_keccak__vxarq_u64_428(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb8(ab); d2318 1 a2318 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d2321 1 a2321 1 A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a d2327 2 a2328 2 libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb8(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_428(a, b); d2332 1 a2332 1 A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left d2338 2 a2339 2 libcrux_sha3_portable_keccak_rotate_left_cb9(uint64_t x) { return x << (uint32_t)(int32_t)6 | x >> (uint32_t)(int32_t)58; d2343 1 a2343 1 A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 d2349 2 a2350 3 libcrux_sha3_portable_keccak__vxarq_u64_429(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb9(ab); d2354 1 a2354 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d2357 1 a2357 1 A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a d2363 2 a2364 2 libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb9(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_429(a, b); d2368 1 a2368 1 A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left d2374 2 a2375 2 libcrux_sha3_portable_keccak_rotate_left_cb10(uint64_t x) { return x << (uint32_t)(int32_t)43 | x >> (uint32_t)(int32_t)21; d2379 1 a2379 1 A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 d2385 2 a2386 3 libcrux_sha3_portable_keccak__vxarq_u64_4210(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb10(ab); d2390 1 a2390 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d2393 1 a2393 1 A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a d2399 2 a2400 2 libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb10(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_4210(a, b); d2404 1 a2404 1 A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left d2410 2 a2411 2 libcrux_sha3_portable_keccak_rotate_left_cb11(uint64_t x) { return x << (uint32_t)(int32_t)15 | x >> (uint32_t)(int32_t)49; d2415 1 a2415 1 A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 d2421 2 a2422 3 libcrux_sha3_portable_keccak__vxarq_u64_4211(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb11(ab); d2426 1 a2426 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d2429 1 a2429 1 A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a d2435 2 a2436 2 libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb11(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_4211(a, b); d2440 1 a2440 1 A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left d2446 2 a2447 2 libcrux_sha3_portable_keccak_rotate_left_cb12(uint64_t x) { return x << (uint32_t)(int32_t)61 | x >> (uint32_t)(int32_t)3; d2451 1 a2451 1 A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 d2457 2 a2458 3 libcrux_sha3_portable_keccak__vxarq_u64_4212(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb12(ab); d2462 1 a2462 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d2465 1 a2465 1 A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a d2471 2 a2472 2 libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb12(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_4212(a, b); d2476 1 a2476 1 A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left d2482 2 a2483 2 libcrux_sha3_portable_keccak_rotate_left_cb13(uint64_t x) { return x << (uint32_t)(int32_t)28 | x >> (uint32_t)(int32_t)36; d2487 1 a2487 1 A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 d2493 2 a2494 3 libcrux_sha3_portable_keccak__vxarq_u64_4213(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb13(ab); d2498 1 a2498 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d2501 1 a2501 1 A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a d2507 2 a2508 2 libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb13(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_4213(a, b); d2512 1 a2512 1 A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left d2518 2 a2519 2 libcrux_sha3_portable_keccak_rotate_left_cb14(uint64_t x) { return x << (uint32_t)(int32_t)55 | x >> (uint32_t)(int32_t)9; d2523 1 a2523 1 A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 d2529 2 a2530 3 libcrux_sha3_portable_keccak__vxarq_u64_4214(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb14(ab); d2534 1 a2534 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d2537 1 a2537 1 A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a d2543 2 a2544 2 libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb14(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_4214(a, b); d2548 1 a2548 1 A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left d2554 2 a2555 2 libcrux_sha3_portable_keccak_rotate_left_cb15(uint64_t x) { return x << (uint32_t)(int32_t)25 | x >> (uint32_t)(int32_t)39; d2559 1 a2559 1 A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 d2565 2 a2566 3 libcrux_sha3_portable_keccak__vxarq_u64_4215(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb15(ab); d2570 1 a2570 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d2573 1 a2573 1 A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a d2579 2 a2580 2 libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb15(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_4215(a, b); d2584 1 a2584 1 A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left d2590 2 a2591 2 libcrux_sha3_portable_keccak_rotate_left_cb16(uint64_t x) { return x << (uint32_t)(int32_t)21 | x >> (uint32_t)(int32_t)43; d2595 1 a2595 1 A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 d2601 2 a2602 3 libcrux_sha3_portable_keccak__vxarq_u64_4216(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb16(ab); d2606 1 a2606 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d2609 1 a2609 1 A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a d2615 2 a2616 2 libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb16(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_4216(a, b); d2620 1 a2620 1 A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left d2626 2 a2627 2 libcrux_sha3_portable_keccak_rotate_left_cb17(uint64_t x) { return x << (uint32_t)(int32_t)56 | x >> (uint32_t)(int32_t)8; d2631 1 a2631 1 A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 d2637 2 a2638 3 libcrux_sha3_portable_keccak__vxarq_u64_4217(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb17(ab); d2642 1 a2642 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d2645 1 a2645 1 A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a d2651 2 a2652 2 libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb17(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_4217(a, b); d2656 1 a2656 1 A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left d2662 2 a2663 2 libcrux_sha3_portable_keccak_rotate_left_cb18(uint64_t x) { return x << (uint32_t)(int32_t)27 | x >> (uint32_t)(int32_t)37; d2667 1 a2667 1 A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 d2673 2 a2674 3 libcrux_sha3_portable_keccak__vxarq_u64_4218(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb18(ab); d2678 1 a2678 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d2681 1 a2681 1 A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a d2687 2 a2688 2 libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb18(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_4218(a, b); d2692 1 a2692 1 A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left d2698 2 a2699 2 libcrux_sha3_portable_keccak_rotate_left_cb19(uint64_t x) { return x << (uint32_t)(int32_t)20 | x >> (uint32_t)(int32_t)44; d2703 1 a2703 1 A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 d2709 2 a2710 3 libcrux_sha3_portable_keccak__vxarq_u64_4219(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb19(ab); d2714 1 a2714 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d2717 1 a2717 1 A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a d2723 2 a2724 2 libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb19(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_4219(a, b); d2728 1 a2728 1 A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left d2734 2 a2735 2 libcrux_sha3_portable_keccak_rotate_left_cb20(uint64_t x) { return x << (uint32_t)(int32_t)39 | x >> (uint32_t)(int32_t)25; d2739 1 a2739 1 A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 d2745 2 a2746 3 libcrux_sha3_portable_keccak__vxarq_u64_4220(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb20(ab); d2750 1 a2750 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d2753 1 a2753 1 A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a d2759 2 a2760 2 libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb20(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_4220(a, b); d2764 1 a2764 1 A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left d2770 2 a2771 2 libcrux_sha3_portable_keccak_rotate_left_cb21(uint64_t x) { return x << (uint32_t)(int32_t)8 | x >> (uint32_t)(int32_t)56; d2775 1 a2775 1 A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 d2781 2 a2782 3 libcrux_sha3_portable_keccak__vxarq_u64_4221(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb21(ab); d2786 1 a2786 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d2789 1 a2789 1 A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a d2795 2 a2796 2 libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb21(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_4221(a, b); d2800 1 a2800 1 A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left d2806 2 a2807 2 libcrux_sha3_portable_keccak_rotate_left_cb22(uint64_t x) { return x << (uint32_t)(int32_t)14 | x >> (uint32_t)(int32_t)50; d2811 1 a2811 1 A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 d2817 2 a2818 3 libcrux_sha3_portable_keccak__vxarq_u64_4222(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb22(ab); d2822 1 a2822 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d2825 1 a2825 1 A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a d2831 2 a2832 2 libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb22(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_4222(a, b); d2836 5 a2840 1 A monomorphic instance of libcrux_sha3.generic_keccak.theta_rho d2845 201 a3045 84 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_theta_rho_16( libcrux_sha3_generic_keccak_KeccakState_48 *s) { uint64_t c[5U] = { libcrux_sha3_portable_keccak_xor5_5a(s->st[0U][0U], s->st[1U][0U], s->st[2U][0U], s->st[3U][0U], s->st[4U][0U]), libcrux_sha3_portable_keccak_xor5_5a(s->st[0U][1U], s->st[1U][1U], s->st[2U][1U], s->st[3U][1U], s->st[4U][1U]), libcrux_sha3_portable_keccak_xor5_5a(s->st[0U][2U], s->st[1U][2U], s->st[2U][2U], s->st[3U][2U], s->st[4U][2U]), libcrux_sha3_portable_keccak_xor5_5a(s->st[0U][3U], s->st[1U][3U], s->st[2U][3U], s->st[3U][3U], s->st[4U][3U]), libcrux_sha3_portable_keccak_xor5_5a(s->st[0U][4U], s->st[1U][4U], s->st[2U][4U], s->st[3U][4U], s->st[4U][4U])}; uint64_t uu____0 = libcrux_sha3_portable_keccak_rotate_left1_and_xor_5a( c[((size_t)0U + (size_t)4U) % (size_t)5U], c[((size_t)0U + (size_t)1U) % (size_t)5U]); uint64_t uu____1 = libcrux_sha3_portable_keccak_rotate_left1_and_xor_5a( c[((size_t)1U + (size_t)4U) % (size_t)5U], c[((size_t)1U + (size_t)1U) % (size_t)5U]); uint64_t uu____2 = libcrux_sha3_portable_keccak_rotate_left1_and_xor_5a( c[((size_t)2U + (size_t)4U) % (size_t)5U], c[((size_t)2U + (size_t)1U) % (size_t)5U]); uint64_t uu____3 = libcrux_sha3_portable_keccak_rotate_left1_and_xor_5a( c[((size_t)3U + (size_t)4U) % (size_t)5U], c[((size_t)3U + (size_t)1U) % (size_t)5U]); uint64_t t[5U] = {uu____0, uu____1, uu____2, uu____3, libcrux_sha3_portable_keccak_rotate_left1_and_xor_5a( c[((size_t)4U + (size_t)4U) % (size_t)5U], c[((size_t)4U + (size_t)1U) % (size_t)5U])}; s->st[0U][0U] = libcrux_sha3_portable_keccak_xor_5a(s->st[0U][0U], t[0U]); s->st[1U][0U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb(s->st[1U][0U], t[0U]); s->st[2U][0U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb0(s->st[2U][0U], t[0U]); s->st[3U][0U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb1(s->st[3U][0U], t[0U]); s->st[4U][0U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb2(s->st[4U][0U], t[0U]); s->st[0U][1U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb3(s->st[0U][1U], t[1U]); s->st[1U][1U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb4(s->st[1U][1U], t[1U]); s->st[2U][1U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb5(s->st[2U][1U], t[1U]); s->st[3U][1U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb6(s->st[3U][1U], t[1U]); s->st[4U][1U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb7(s->st[4U][1U], t[1U]); s->st[0U][2U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb8(s->st[0U][2U], t[2U]); s->st[1U][2U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb9(s->st[1U][2U], t[2U]); s->st[2U][2U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb10(s->st[2U][2U], t[2U]); s->st[3U][2U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb11(s->st[3U][2U], t[2U]); s->st[4U][2U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb12(s->st[4U][2U], t[2U]); s->st[0U][3U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb13(s->st[0U][3U], t[3U]); s->st[1U][3U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb14(s->st[1U][3U], t[3U]); s->st[2U][3U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb15(s->st[2U][3U], t[3U]); s->st[3U][3U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb16(s->st[3U][3U], t[3U]); s->st[4U][3U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb17(s->st[4U][3U], t[3U]); s->st[0U][4U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb18(s->st[0U][4U], t[4U]); s->st[1U][4U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb19(s->st[1U][4U], t[4U]); s->st[2U][4U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb20(s->st[2U][4U], t[4U]); s->st[3U][4U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb21(s->st[3U][4U], t[4U]); uint64_t uu____27 = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb22(s->st[4U][4U], t[4U]); s->st[4U][4U] = uu____27; d3049 5 a3053 1 A monomorphic instance of libcrux_sha3.generic_keccak.pi d3058 123 a3180 28 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_pi_1d( libcrux_sha3_generic_keccak_KeccakState_48 *s) { uint64_t old[5U][5U]; memcpy(old, s->st, (size_t)5U * sizeof(uint64_t[5U])); s->st[0U][1U] = old[1U][1U]; s->st[0U][2U] = old[2U][2U]; s->st[0U][3U] = old[3U][3U]; s->st[0U][4U] = old[4U][4U]; s->st[1U][0U] = old[0U][3U]; s->st[1U][1U] = old[1U][4U]; s->st[1U][2U] = old[2U][0U]; s->st[1U][3U] = old[3U][1U]; s->st[1U][4U] = old[4U][2U]; s->st[2U][0U] = old[0U][1U]; s->st[2U][1U] = old[1U][2U]; s->st[2U][2U] = old[2U][3U]; s->st[2U][3U] = old[3U][4U]; s->st[2U][4U] = old[4U][0U]; s->st[3U][0U] = old[0U][4U]; s->st[3U][1U] = old[1U][0U]; s->st[3U][2U] = old[2U][1U]; s->st[3U][3U] = old[3U][2U]; s->st[3U][4U] = old[4U][3U]; s->st[4U][0U] = old[0U][2U]; s->st[4U][1U] = old[1U][3U]; s->st[4U][2U] = old[2U][4U]; s->st[4U][3U] = old[3U][0U]; s->st[4U][4U] = old[4U][1U]; d3184 5 a3188 1 A monomorphic instance of libcrux_sha3.generic_keccak.chi d3193 3 a3195 4 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_chi_12( libcrux_sha3_generic_keccak_KeccakState_48 *s) { uint64_t old[5U][5U]; memcpy(old, s->st, (size_t)5U * sizeof(uint64_t[5U])); d3200 13 a3212 3 s->st[i1][j] = libcrux_sha3_portable_keccak_and_not_xor_5a( s->st[i1][j], old[i1][(j + (size_t)2U) % (size_t)5U], old[i1][(j + (size_t)1U) % (size_t)5U]); d3218 5 a3222 1 A monomorphic instance of libcrux_sha3.generic_keccak.iota d3227 9 a3235 4 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_iota_62( libcrux_sha3_generic_keccak_KeccakState_48 *s, size_t i) { s->st[0U][0U] = libcrux_sha3_portable_keccak_xor_constant_5a( s->st[0U][0U], libcrux_sha3_generic_keccak_ROUNDCONSTANTS[i]); d3239 5 a3243 1 A monomorphic instance of libcrux_sha3.generic_keccak.keccakf1600 d3248 2 a3249 2 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_keccakf1600_21( libcrux_sha3_generic_keccak_KeccakState_48 *s) { d3252 9 a3260 4 libcrux_sha3_generic_keccak_theta_rho_16(s); libcrux_sha3_generic_keccak_pi_1d(s); libcrux_sha3_generic_keccak_chi_12(s); libcrux_sha3_generic_keccak_iota_62(s, i0); d3265 5 a3269 1 A monomorphic instance of libcrux_sha3.generic_keccak.absorb_block d3275 5 a3279 7 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_block_df( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice blocks[1U]) { uint64_t(*uu____0)[5U] = s->st; Eurydice_slice uu____1[1U]; memcpy(uu____1, blocks, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_portable_keccak_load_block_5a_b8(uu____0, uu____1); libcrux_sha3_generic_keccak_keccakf1600_21(s); d3283 1 a3283 1 A monomorphic instance of libcrux_sha3.portable_keccak.load_block_full d3286 1 d3288 11 a3298 5 static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_full_df( uint64_t (*s)[5U], uint8_t blocks[1U][200U]) { Eurydice_slice buf[1U] = { Eurydice_array_to_slice((size_t)200U, blocks[0U], uint8_t)}; libcrux_sha3_portable_keccak_load_block_2c(s, buf); d3302 4 a3305 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d3308 1 a3308 1 A monomorphic instance of libcrux_sha3.portable_keccak.load_block_full_5a d3311 1 d3313 4 a3316 7 static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_full_5a_d2( uint64_t (*a)[5U], uint8_t b[1U][200U]) { uint64_t(*uu____0)[5U] = a; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_b[1U][200U]; memcpy(copy_of_b, b, (size_t)1U * sizeof(uint8_t[200U])); libcrux_sha3_portable_keccak_load_block_full_df(uu____0, copy_of_b); d3320 5 a3324 1 A monomorphic instance of libcrux_sha3.generic_keccak.absorb_final d3331 5 a3335 21 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_final_c7( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice last[1U]) { size_t last_len = Eurydice_slice_len(last[0U], uint8_t); uint8_t blocks[1U][200U] = {{0U}}; for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; if (last_len > (size_t)0U) { Eurydice_slice uu____0 = Eurydice_array_to_subslice2( blocks[i0], (size_t)0U, last_len, uint8_t); Eurydice_slice_copy(uu____0, last[i0], uint8_t); } blocks[i0][last_len] = 6U; size_t uu____1 = i0; size_t uu____2 = (size_t)72U - (size_t)1U; blocks[uu____1][uu____2] = (uint32_t)blocks[uu____1][uu____2] | 128U; } uint64_t(*uu____3)[5U] = s->st; uint8_t uu____4[1U][200U]; memcpy(uu____4, blocks, (size_t)1U * sizeof(uint8_t[200U])); libcrux_sha3_portable_keccak_load_block_full_5a_d2(uu____3, uu____4); libcrux_sha3_generic_keccak_keccakf1600_21(s); d3339 1 a3339 1 A monomorphic instance of libcrux_sha3.portable_keccak.store_block d3343 8 a3350 6 static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_58( uint64_t (*s)[5U], Eurydice_slice out[1U]) { for (size_t i = (size_t)0U; i < (size_t)72U / (size_t)8U; i++) { size_t i0 = i; Eurydice_slice uu____0 = Eurydice_slice_subslice2( out[0U], (size_t)8U * i0, (size_t)8U * i0 + (size_t)8U, uint8_t); d3352 3 a3354 1 core_num__u64_9__to_le_bytes(s[i0 / (size_t)5U][i0 % (size_t)5U], ret); d3358 14 d3375 7 a3381 1 A monomorphic instance of libcrux_sha3.portable_keccak.store_block_full d3385 4 a3388 10 static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_full_2d( uint64_t (*s)[5U], uint8_t ret[1U][200U]) { uint8_t out[200U] = {0U}; Eurydice_slice buf[1U] = { Eurydice_array_to_slice((size_t)200U, out, uint8_t)}; libcrux_sha3_portable_keccak_store_block_58(s, buf); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_out[200U]; memcpy(copy_of_out, out, (size_t)200U * sizeof(uint8_t)); memcpy(ret[0U], copy_of_out, (size_t)200U * sizeof(uint8_t)); d3392 4 a3395 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d3397 33 d3431 1 a3431 3 A monomorphic instance of libcrux_sha3.portable_keccak.store_block_full_5a with const generics - RATE= 72 d3433 3 a3435 3 static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_full_5a_29( uint64_t (*a)[5U], uint8_t ret[1U][200U]) { libcrux_sha3_portable_keccak_store_block_full_2d(a, ret); d3439 1 a3439 2 A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_first_and_last with types uint64_t d3441 1 a3441 2 - N= 1 - RATE= 72 d3443 17 a3459 6 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_first_and_last_c5( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out[1U]) { uint8_t b[1U][200U]; libcrux_sha3_portable_keccak_store_block_full_5a_29(s->st, b); for (size_t i = (size_t)0U; i < (size_t)1U; i++) { d3461 5 a3465 10 Eurydice_slice uu____0 = out[i0]; uint8_t *uu____1 = b[i0]; core_ops_range_Range_b3 lit; lit.start = (size_t)0U; lit.end = Eurydice_slice_len(out[i0], uint8_t); Eurydice_slice_copy( uu____0, Eurydice_array_to_subslice((size_t)200U, uu____1, lit, uint8_t, core_ops_range_Range_b3), uint8_t); d3470 4 a3473 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d3476 1 a3476 1 A monomorphic instance of libcrux_sha3.portable_keccak.store_block_5a d3478 1 a3478 1 - RATE= 72 d3480 4 a3483 3 static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_5a_59( uint64_t (*a)[5U], Eurydice_slice b[1U]) { libcrux_sha3_portable_keccak_store_block_58(a, b); d3487 5 a3491 1 A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_first_block d3495 1 a3495 1 - RATE= 72 d3497 5 a3501 3 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_first_block_84( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out[1U]) { libcrux_sha3_portable_keccak_store_block_5a_59(s->st, out); d3505 1 a3505 2 A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_next_block with types uint64_t d3507 2 a3508 2 - N= 1 - RATE= 72 d3510 12 a3521 118 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_next_block_fc( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out[1U]) { libcrux_sha3_generic_keccak_keccakf1600_21(s); libcrux_sha3_portable_keccak_store_block_5a_59(s->st, out); } /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_last with types uint64_t with const generics - N= 1 - RATE= 72 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_last_cf( libcrux_sha3_generic_keccak_KeccakState_48 s, Eurydice_slice out[1U]) { libcrux_sha3_generic_keccak_keccakf1600_21(&s); uint8_t b[1U][200U]; libcrux_sha3_portable_keccak_store_block_full_5a_29(s.st, b); for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; Eurydice_slice uu____0 = out[i0]; uint8_t *uu____1 = b[i0]; core_ops_range_Range_b3 lit; lit.start = (size_t)0U; lit.end = Eurydice_slice_len(out[i0], uint8_t); Eurydice_slice_copy( uu____0, Eurydice_array_to_subslice((size_t)200U, uu____1, lit, uint8_t, core_ops_range_Range_b3), uint8_t); } } /** A monomorphic instance of libcrux_sha3.generic_keccak.keccak with types uint64_t with const generics - N= 1 - RATE= 72 - DELIM= 6 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_keccak_e9( Eurydice_slice data[1U], Eurydice_slice out[1U]) { libcrux_sha3_generic_keccak_KeccakState_48 s = libcrux_sha3_generic_keccak_new_1e_f4(); for (size_t i = (size_t)0U; i < Eurydice_slice_len(data[0U], uint8_t) / (size_t)72U; i++) { size_t i0 = i; libcrux_sha3_generic_keccak_KeccakState_48 *uu____0 = &s; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice ret[1U]; libcrux_sha3_portable_keccak_slice_n_5a(copy_of_data, i0 * (size_t)72U, (size_t)72U, ret); libcrux_sha3_generic_keccak_absorb_block_df(uu____0, ret); } size_t rem = Eurydice_slice_len(data[0U], uint8_t) % (size_t)72U; libcrux_sha3_generic_keccak_KeccakState_48 *uu____2 = &s; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice ret[1U]; libcrux_sha3_portable_keccak_slice_n_5a( copy_of_data, Eurydice_slice_len(data[0U], uint8_t) - rem, rem, ret); libcrux_sha3_generic_keccak_absorb_final_c7(uu____2, ret); size_t outlen = Eurydice_slice_len(out[0U], uint8_t); size_t blocks = outlen / (size_t)72U; size_t last = outlen - outlen % (size_t)72U; if (blocks == (size_t)0U) { libcrux_sha3_generic_keccak_squeeze_first_and_last_c5(&s, out); } else { Eurydice_slice_uint8_t_1size_t__x2 uu____4 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(out, (size_t)72U); Eurydice_slice o0[1U]; memcpy(o0, uu____4.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice o1[1U]; memcpy(o1, uu____4.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_first_block_84(&s, o0); core_ops_range_Range_b3 iter = core_iter_traits_collect___core__iter__traits__collect__IntoIterator_for_I__1__into_iter( (CLITERAL(core_ops_range_Range_b3){.start = (size_t)1U, .end = blocks}), core_ops_range_Range_b3, core_ops_range_Range_b3); while (true) { if (core_iter_range___core__iter__traits__iterator__Iterator_for_core__ops__range__Range_A___6__next( &iter, size_t, Option_b3) .tag == None) { break; } else { Eurydice_slice_uint8_t_1size_t__x2 uu____5 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(o1, (size_t)72U); Eurydice_slice o[1U]; memcpy(o, uu____5.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice orest[1U]; memcpy(orest, uu____5.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_next_block_fc(&s, o); memcpy(o1, orest, (size_t)1U * sizeof(Eurydice_slice)); } } if (last < outlen) { libcrux_sha3_generic_keccak_squeeze_last_cf(s, o1); } } } /** A monomorphic instance of libcrux_sha3.portable.keccakx1 with const generics - RATE= 72 - DELIM= 6 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccakx1_ce( Eurydice_slice data[1U], Eurydice_slice out[1U]) { /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_keccak_e9(copy_of_data, out); d3525 4 a3528 1 A portable SHA3 512 implementation. a3529 7 static KRML_MUSTINLINE void libcrux_sha3_portable_sha512(Eurydice_slice digest, Eurydice_slice data) { Eurydice_slice buf0[1U] = {data}; Eurydice_slice buf[1U] = {digest}; libcrux_sha3_portable_keccakx1_ce(buf0, buf); } d3531 1 a3531 1 A monomorphic instance of libcrux_sha3.portable_keccak.load_block d3534 1 d3536 4 a3539 17 static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_2c0( uint64_t (*s)[5U], Eurydice_slice blocks[1U]) { for (size_t i = (size_t)0U; i < (size_t)136U / (size_t)8U; i++) { size_t i0 = i; uint8_t uu____0[8U]; Result_56 dst; Eurydice_slice_to_array2( &dst, Eurydice_slice_subslice2(blocks[0U], (size_t)8U * i0, (size_t)8U * i0 + (size_t)8U, uint8_t), Eurydice_slice, uint8_t[8U]); unwrap_41_ac(dst, uu____0); size_t uu____1 = i0 / (size_t)5U; size_t uu____2 = i0 % (size_t)5U; s[uu____1][uu____2] = s[uu____1][uu____2] ^ core_num__u64_9__from_le_bytes(uu____0); } d3543 2 a3544 48 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.load_block_5a with const generics - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_5a_b80( uint64_t (*a)[5U], Eurydice_slice b[1U]) { uint64_t(*uu____0)[5U] = a; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_b[1U]; memcpy(copy_of_b, b, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_portable_keccak_load_block_2c0(uu____0, copy_of_b); } /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_block with types uint64_t with const generics - N= 1 - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_block_df0( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice blocks[1U]) { uint64_t(*uu____0)[5U] = s->st; Eurydice_slice uu____1[1U]; memcpy(uu____1, blocks, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_portable_keccak_load_block_5a_b80(uu____0, uu____1); libcrux_sha3_generic_keccak_keccakf1600_21(s); } /** A monomorphic instance of libcrux_sha3.portable_keccak.load_block_full with const generics - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_full_df0( uint64_t (*s)[5U], uint8_t blocks[1U][200U]) { Eurydice_slice buf[1U] = { Eurydice_array_to_slice((size_t)200U, blocks[0U], uint8_t)}; libcrux_sha3_portable_keccak_load_block_2c0(s, buf); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d3547 1 a3547 15 A monomorphic instance of libcrux_sha3.portable_keccak.load_block_full_5a with const generics - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_full_5a_d20( uint64_t (*a)[5U], uint8_t b[1U][200U]) { uint64_t(*uu____0)[5U] = a; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_b[1U][200U]; memcpy(copy_of_b, b, (size_t)1U * sizeof(uint8_t[200U])); libcrux_sha3_portable_keccak_load_block_full_df0(uu____0, copy_of_b); } /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_final d3554 5 a3558 21 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_final_c70( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice last[1U]) { size_t last_len = Eurydice_slice_len(last[0U], uint8_t); uint8_t blocks[1U][200U] = {{0U}}; for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; if (last_len > (size_t)0U) { Eurydice_slice uu____0 = Eurydice_array_to_subslice2( blocks[i0], (size_t)0U, last_len, uint8_t); Eurydice_slice_copy(uu____0, last[i0], uint8_t); } blocks[i0][last_len] = 6U; size_t uu____1 = i0; size_t uu____2 = (size_t)136U - (size_t)1U; blocks[uu____1][uu____2] = (uint32_t)blocks[uu____1][uu____2] | 128U; } uint64_t(*uu____3)[5U] = s->st; uint8_t uu____4[1U][200U]; memcpy(uu____4, blocks, (size_t)1U * sizeof(uint8_t[200U])); libcrux_sha3_portable_keccak_load_block_full_5a_d20(uu____3, uu____4); libcrux_sha3_generic_keccak_keccakf1600_21(s); d3562 1 a3562 1 A monomorphic instance of libcrux_sha3.portable_keccak.store_block d3566 8 a3573 6 static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_580( uint64_t (*s)[5U], Eurydice_slice out[1U]) { for (size_t i = (size_t)0U; i < (size_t)136U / (size_t)8U; i++) { size_t i0 = i; Eurydice_slice uu____0 = Eurydice_slice_subslice2( out[0U], (size_t)8U * i0, (size_t)8U * i0 + (size_t)8U, uint8_t); d3575 3 a3577 1 core_num__u64_9__to_le_bytes(s[i0 / (size_t)5U][i0 % (size_t)5U], ret); d3581 9 a3589 53 } /** A monomorphic instance of libcrux_sha3.portable_keccak.store_block_full with const generics - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_full_2d0( uint64_t (*s)[5U], uint8_t ret[1U][200U]) { uint8_t out[200U] = {0U}; Eurydice_slice buf[1U] = { Eurydice_array_to_slice((size_t)200U, out, uint8_t)}; libcrux_sha3_portable_keccak_store_block_580(s, buf); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_out[200U]; memcpy(copy_of_out, out, (size_t)200U * sizeof(uint8_t)); memcpy(ret[0U], copy_of_out, (size_t)200U * sizeof(uint8_t)); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.store_block_full_5a with const generics - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_full_5a_290(uint64_t (*a)[5U], uint8_t ret[1U][200U]) { libcrux_sha3_portable_keccak_store_block_full_2d0(a, ret); } /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_first_and_last with types uint64_t with const generics - N= 1 - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_first_and_last_c50( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out[1U]) { uint8_t b[1U][200U]; libcrux_sha3_portable_keccak_store_block_full_5a_290(s->st, b); for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; Eurydice_slice uu____0 = out[i0]; uint8_t *uu____1 = b[i0]; core_ops_range_Range_b3 lit; lit.start = (size_t)0U; lit.end = Eurydice_slice_len(out[i0], uint8_t); d3591 2 a3592 3 uu____0, Eurydice_array_to_subslice((size_t)200U, uu____1, lit, uint8_t, core_ops_range_Range_b3), d3598 4 a3601 31 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.store_block_5a with const generics - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_5a_590( uint64_t (*a)[5U], Eurydice_slice b[1U]) { libcrux_sha3_portable_keccak_store_block_580(a, b); } /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_first_block with types uint64_t with const generics - N= 1 - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_first_block_840( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out[1U]) { libcrux_sha3_portable_keccak_store_block_5a_590(s->st, out); } /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_next_block with types uint64_t with const generics - N= 1 - RATE= 136 a3602 6 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_next_block_fc0( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out[1U]) { libcrux_sha3_generic_keccak_keccakf1600_21(s); libcrux_sha3_portable_keccak_store_block_5a_590(s->st, out); } d3604 1 a3604 2 A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_last with types uint64_t a3605 1 - N= 1 d3608 4 a3611 18 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_last_cf0( libcrux_sha3_generic_keccak_KeccakState_48 s, Eurydice_slice out[1U]) { libcrux_sha3_generic_keccak_keccakf1600_21(&s); uint8_t b[1U][200U]; libcrux_sha3_portable_keccak_store_block_full_5a_290(s.st, b); for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; Eurydice_slice uu____0 = out[i0]; uint8_t *uu____1 = b[i0]; core_ops_range_Range_b3 lit; lit.start = (size_t)0U; lit.end = Eurydice_slice_len(out[i0], uint8_t); Eurydice_slice_copy( uu____0, Eurydice_array_to_subslice((size_t)200U, uu____1, lit, uint8_t, core_ops_range_Range_b3), uint8_t); } d3615 1 a3615 2 A monomorphic instance of libcrux_sha3.generic_keccak.keccak with types uint64_t a3616 1 - N= 1 d3620 6 a3625 6 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_keccak_e90( Eurydice_slice data[1U], Eurydice_slice out[1U]) { libcrux_sha3_generic_keccak_KeccakState_48 s = libcrux_sha3_generic_keccak_new_1e_f4(); for (size_t i = (size_t)0U; i < Eurydice_slice_len(data[0U], uint8_t) / (size_t)136U; i++) { d3627 2 a3628 8 libcrux_sha3_generic_keccak_KeccakState_48 *uu____0 = &s; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice ret[1U]; libcrux_sha3_portable_keccak_slice_n_5a(copy_of_data, i0 * (size_t)136U, (size_t)136U, ret); libcrux_sha3_generic_keccak_absorb_block_df0(uu____0, ret); d3630 4 a3633 10 size_t rem = Eurydice_slice_len(data[0U], uint8_t) % (size_t)136U; libcrux_sha3_generic_keccak_KeccakState_48 *uu____2 = &s; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice ret[1U]; libcrux_sha3_portable_keccak_slice_n_5a( copy_of_data, Eurydice_slice_len(data[0U], uint8_t) - rem, rem, ret); libcrux_sha3_generic_keccak_absorb_final_c70(uu____2, ret); size_t outlen = Eurydice_slice_len(out[0U], uint8_t); d3637 1 a3637 1 libcrux_sha3_generic_keccak_squeeze_first_and_last_c50(&s, out); d3639 6 a3644 27 Eurydice_slice_uint8_t_1size_t__x2 uu____4 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(out, (size_t)136U); Eurydice_slice o0[1U]; memcpy(o0, uu____4.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice o1[1U]; memcpy(o1, uu____4.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_first_block_840(&s, o0); core_ops_range_Range_b3 iter = core_iter_traits_collect___core__iter__traits__collect__IntoIterator_for_I__1__into_iter( (CLITERAL(core_ops_range_Range_b3){.start = (size_t)1U, .end = blocks}), core_ops_range_Range_b3, core_ops_range_Range_b3); while (true) { if (core_iter_range___core__iter__traits__iterator__Iterator_for_core__ops__range__Range_A___6__next( &iter, size_t, Option_b3) .tag == None) { break; } else { Eurydice_slice_uint8_t_1size_t__x2 uu____5 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(o1, (size_t)136U); Eurydice_slice o[1U]; memcpy(o, uu____5.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice orest[1U]; memcpy(orest, uu____5.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_next_block_fc0(&s, o); memcpy(o1, orest, (size_t)1U * sizeof(Eurydice_slice)); } d3647 2 a3648 1 libcrux_sha3_generic_keccak_squeeze_last_cf0(s, o1); d3654 9 a3662 1 A monomorphic instance of libcrux_sha3.portable.keccakx1 d3665 1 a3665 1 - DELIM= 6 d3667 12 a3678 6 static KRML_MUSTINLINE void libcrux_sha3_portable_keccakx1_ce0( Eurydice_slice data[1U], Eurydice_slice out[1U]) { /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_keccak_e90(copy_of_data, out); d3682 10 a3691 1 A portable SHA3 256 implementation. d3693 4 a3696 5 static KRML_MUSTINLINE void libcrux_sha3_portable_sha256(Eurydice_slice digest, Eurydice_slice data) { Eurydice_slice buf0[1U] = {data}; Eurydice_slice buf[1U] = {digest}; libcrux_sha3_portable_keccakx1_ce0(buf0, buf); d3700 5 a3704 1 A monomorphic instance of libcrux_sha3.generic_keccak.absorb_final d3711 5 a3715 21 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_final_c71( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice last[1U]) { size_t last_len = Eurydice_slice_len(last[0U], uint8_t); uint8_t blocks[1U][200U] = {{0U}}; for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; if (last_len > (size_t)0U) { Eurydice_slice uu____0 = Eurydice_array_to_subslice2( blocks[i0], (size_t)0U, last_len, uint8_t); Eurydice_slice_copy(uu____0, last[i0], uint8_t); } blocks[i0][last_len] = 31U; size_t uu____1 = i0; size_t uu____2 = (size_t)136U - (size_t)1U; blocks[uu____1][uu____2] = (uint32_t)blocks[uu____1][uu____2] | 128U; } uint64_t(*uu____3)[5U] = s->st; uint8_t uu____4[1U][200U]; memcpy(uu____4, blocks, (size_t)1U * sizeof(uint8_t[200U])); libcrux_sha3_portable_keccak_load_block_full_5a_d20(uu____3, uu____4); libcrux_sha3_generic_keccak_keccakf1600_21(s); d3719 1 a3719 2 A monomorphic instance of libcrux_sha3.generic_keccak.keccak with types uint64_t a3720 1 - N= 1 d3724 6 a3729 6 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_keccak_e91( Eurydice_slice data[1U], Eurydice_slice out[1U]) { libcrux_sha3_generic_keccak_KeccakState_48 s = libcrux_sha3_generic_keccak_new_1e_f4(); for (size_t i = (size_t)0U; i < Eurydice_slice_len(data[0U], uint8_t) / (size_t)136U; i++) { d3731 2 a3732 8 libcrux_sha3_generic_keccak_KeccakState_48 *uu____0 = &s; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice ret[1U]; libcrux_sha3_portable_keccak_slice_n_5a(copy_of_data, i0 * (size_t)136U, (size_t)136U, ret); libcrux_sha3_generic_keccak_absorb_block_df0(uu____0, ret); d3734 4 a3737 10 size_t rem = Eurydice_slice_len(data[0U], uint8_t) % (size_t)136U; libcrux_sha3_generic_keccak_KeccakState_48 *uu____2 = &s; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice ret[1U]; libcrux_sha3_portable_keccak_slice_n_5a( copy_of_data, Eurydice_slice_len(data[0U], uint8_t) - rem, rem, ret); libcrux_sha3_generic_keccak_absorb_final_c71(uu____2, ret); size_t outlen = Eurydice_slice_len(out[0U], uint8_t); d3741 1 a3741 1 libcrux_sha3_generic_keccak_squeeze_first_and_last_c50(&s, out); d3743 6 a3748 27 Eurydice_slice_uint8_t_1size_t__x2 uu____4 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(out, (size_t)136U); Eurydice_slice o0[1U]; memcpy(o0, uu____4.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice o1[1U]; memcpy(o1, uu____4.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_first_block_840(&s, o0); core_ops_range_Range_b3 iter = core_iter_traits_collect___core__iter__traits__collect__IntoIterator_for_I__1__into_iter( (CLITERAL(core_ops_range_Range_b3){.start = (size_t)1U, .end = blocks}), core_ops_range_Range_b3, core_ops_range_Range_b3); while (true) { if (core_iter_range___core__iter__traits__iterator__Iterator_for_core__ops__range__Range_A___6__next( &iter, size_t, Option_b3) .tag == None) { break; } else { Eurydice_slice_uint8_t_1size_t__x2 uu____5 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(o1, (size_t)136U); Eurydice_slice o[1U]; memcpy(o, uu____5.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice orest[1U]; memcpy(orest, uu____5.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_next_block_fc0(&s, o); memcpy(o1, orest, (size_t)1U * sizeof(Eurydice_slice)); } d3751 2 a3752 1 libcrux_sha3_generic_keccak_squeeze_last_cf0(s, o1); a3757 14 A monomorphic instance of libcrux_sha3.portable.keccakx1 with const generics - RATE= 136 - DELIM= 31 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccakx1_ce1( Eurydice_slice data[1U], Eurydice_slice out[1U]) { /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_keccak_e91(copy_of_data, out); } /** d3762 1 a3762 3 Eurydice_slice buf0[1U] = {data}; Eurydice_slice buf[1U] = {digest}; libcrux_sha3_portable_keccakx1_ce1(buf0, buf); d3765 1 a3765 1 typedef libcrux_sha3_generic_keccak_KeccakState_48 d3771 1 a3771 1 static KRML_MUSTINLINE libcrux_sha3_generic_keccak_KeccakState_48 d3773 1 a3773 1 return libcrux_sha3_generic_keccak_new_1e_f4(); d3777 1 a3777 1 A monomorphic instance of libcrux_sha3.portable_keccak.load_block d3781 3 a3783 2 static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_2c1( uint64_t (*s)[5U], Eurydice_slice blocks[1U]) { d3786 1 d3788 1 a3788 1 Result_56 dst; d3791 13 a3803 8 Eurydice_slice_subslice2(blocks[0U], (size_t)8U * i0, (size_t)8U * i0 + (size_t)8U, uint8_t), Eurydice_slice, uint8_t[8U]); unwrap_41_ac(dst, uu____0); size_t uu____1 = i0 / (size_t)5U; size_t uu____2 = i0 % (size_t)5U; s[uu____1][uu____2] = s[uu____1][uu____2] ^ core_num__u64_9__from_le_bytes(uu____0); d3808 1 a3808 1 A monomorphic instance of libcrux_sha3.portable_keccak.load_block_full d3811 1 d3813 12 a3824 5 static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_full_df1( uint64_t (*s)[5U], uint8_t blocks[1U][200U]) { Eurydice_slice buf[1U] = { Eurydice_array_to_slice((size_t)200U, blocks[0U], uint8_t)}; libcrux_sha3_portable_keccak_load_block_2c1(s, buf); d3828 4 a3831 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d3834 1 a3834 1 A monomorphic instance of libcrux_sha3.portable_keccak.load_block_full_5a d3837 1 d3839 4 a3842 7 static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_full_5a_d21( uint64_t (*a)[5U], uint8_t b[1U][200U]) { uint64_t(*uu____0)[5U] = a; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_b[1U][200U]; memcpy(copy_of_b, b, (size_t)1U * sizeof(uint8_t[200U])); libcrux_sha3_portable_keccak_load_block_full_df1(uu____0, copy_of_b); d3846 5 a3850 1 A monomorphic instance of libcrux_sha3.generic_keccak.absorb_final d3857 5 a3861 21 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_final_c72( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice last[1U]) { size_t last_len = Eurydice_slice_len(last[0U], uint8_t); uint8_t blocks[1U][200U] = {{0U}}; for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; if (last_len > (size_t)0U) { Eurydice_slice uu____0 = Eurydice_array_to_subslice2( blocks[i0], (size_t)0U, last_len, uint8_t); Eurydice_slice_copy(uu____0, last[i0], uint8_t); } blocks[i0][last_len] = 31U; size_t uu____1 = i0; size_t uu____2 = (size_t)168U - (size_t)1U; blocks[uu____1][uu____2] = (uint32_t)blocks[uu____1][uu____2] | 128U; } uint64_t(*uu____3)[5U] = s->st; uint8_t uu____4[1U][200U]; memcpy(uu____4, blocks, (size_t)1U * sizeof(uint8_t[200U])); libcrux_sha3_portable_keccak_load_block_full_5a_d21(uu____3, uu____4); libcrux_sha3_generic_keccak_keccakf1600_21(s); d3869 5 a3873 3 libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice data0) { Eurydice_slice buf[1U] = {data0}; libcrux_sha3_generic_keccak_absorb_final_c72(s, buf); d3877 1 a3877 1 A monomorphic instance of libcrux_sha3.portable_keccak.store_block d3881 8 a3888 6 static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_581( uint64_t (*s)[5U], Eurydice_slice out[1U]) { for (size_t i = (size_t)0U; i < (size_t)168U / (size_t)8U; i++) { size_t i0 = i; Eurydice_slice uu____0 = Eurydice_slice_subslice2( out[0U], (size_t)8U * i0, (size_t)8U * i0 + (size_t)8U, uint8_t); d3890 3 a3892 1 core_num__u64_9__to_le_bytes(s[i0 / (size_t)5U][i0 % (size_t)5U], ret); d3896 14 d3913 4 a3916 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d3919 1 a3919 1 A monomorphic instance of libcrux_sha3.portable_keccak.store_block_5a d3923 4 a3926 3 static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_5a_591( uint64_t (*a)[5U], Eurydice_slice b[1U]) { libcrux_sha3_portable_keccak_store_block_581(a, b); d3930 9 a3938 4 A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_next_block with types uint64_t with const generics - N= 1 d3941 10 a3950 4 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_next_block_fc1( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out[1U]) { libcrux_sha3_generic_keccak_keccakf1600_21(s); libcrux_sha3_portable_keccak_store_block_5a_591(s->st, out); d3954 1 a3954 1 Squeeze another block d3957 4 a3960 4 libcrux_sha3_portable_incremental_shake128_squeeze_next_block( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out0) { Eurydice_slice buf[1U] = {out0}; libcrux_sha3_generic_keccak_squeeze_next_block_fc1(s, buf); d3964 4 a3967 5 A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_first_block with types uint64_t with const generics - N= 1 - RATE= 168 a3968 5 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_first_block_841( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out[1U]) { libcrux_sha3_portable_keccak_store_block_5a_591(s->st, out); } d3970 2 a3971 4 A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_first_three_blocks with types uint64_t with const generics - N= 1 d3975 5 a3979 17 libcrux_sha3_generic_keccak_squeeze_first_three_blocks_cc( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out[1U]) { Eurydice_slice_uint8_t_1size_t__x2 uu____0 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(out, (size_t)168U); Eurydice_slice o0[1U]; memcpy(o0, uu____0.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice o10[1U]; memcpy(o10, uu____0.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_first_block_841(s, o0); Eurydice_slice_uint8_t_1size_t__x2 uu____1 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(o10, (size_t)168U); Eurydice_slice o1[1U]; memcpy(o1, uu____1.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice o2[1U]; memcpy(o2, uu____1.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_next_block_fc1(s, o1); libcrux_sha3_generic_keccak_squeeze_next_block_fc1(s, o2); d3983 1 a3983 1 Squeeze three blocks d3986 4 a3989 4 libcrux_sha3_portable_incremental_shake128_squeeze_first_three_blocks( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out0) { Eurydice_slice buf[1U] = {out0}; libcrux_sha3_generic_keccak_squeeze_first_three_blocks_cc(s, buf); d3992 4 a3995 4 #define libcrux_sha3_Sha224 0 #define libcrux_sha3_Sha256 1 #define libcrux_sha3_Sha384 2 #define libcrux_sha3_Sha512 3 d3999 8 a4010 1 size_t uu____0; d4012 1 a4012 2 case libcrux_sha3_Sha224: { uu____0 = (size_t)28U; d4015 2 a4016 3 case libcrux_sha3_Sha256: { uu____0 = (size_t)32U; break; d4018 2 a4019 3 case libcrux_sha3_Sha384: { uu____0 = (size_t)48U; break; d4021 2 a4022 3 case libcrux_sha3_Sha512: { uu____0 = (size_t)64U; break; d4030 1 a4030 1 return uu____0; d4034 1 a4034 1 A monomorphic instance of libcrux_sha3.portable_keccak.load_block d4038 3 a4040 2 static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_2c2( uint64_t (*s)[5U], Eurydice_slice blocks[1U]) { d4043 1 d4045 1 a4045 1 Result_56 dst; d4048 13 a4060 8 Eurydice_slice_subslice2(blocks[0U], (size_t)8U * i0, (size_t)8U * i0 + (size_t)8U, uint8_t), Eurydice_slice, uint8_t[8U]); unwrap_41_ac(dst, uu____0); size_t uu____1 = i0 / (size_t)5U; size_t uu____2 = i0 % (size_t)5U; s[uu____1][uu____2] = s[uu____1][uu____2] ^ core_num__u64_9__from_le_bytes(uu____0); d4065 4 a4068 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d4071 1 a4071 1 A monomorphic instance of libcrux_sha3.portable_keccak.load_block_5a d4075 4 a4078 7 static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_5a_b81( uint64_t (*a)[5U], Eurydice_slice b[1U]) { uint64_t(*uu____0)[5U] = a; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_b[1U]; memcpy(copy_of_b, b, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_portable_keccak_load_block_2c2(uu____0, copy_of_b); d4082 5 a4086 1 A monomorphic instance of libcrux_sha3.generic_keccak.absorb_block d4092 5 a4096 7 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_block_df1( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice blocks[1U]) { uint64_t(*uu____0)[5U] = s->st; Eurydice_slice uu____1[1U]; memcpy(uu____1, blocks, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_portable_keccak_load_block_5a_b81(uu____0, uu____1); libcrux_sha3_generic_keccak_keccakf1600_21(s); d4100 1 a4100 1 A monomorphic instance of libcrux_sha3.portable_keccak.load_block_full d4103 1 d4105 12 a4116 5 static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_full_df2( uint64_t (*s)[5U], uint8_t blocks[1U][200U]) { Eurydice_slice buf[1U] = { Eurydice_array_to_slice((size_t)200U, blocks[0U], uint8_t)}; libcrux_sha3_portable_keccak_load_block_2c2(s, buf); d4120 4 a4123 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d4126 1 a4126 1 A monomorphic instance of libcrux_sha3.portable_keccak.load_block_full_5a d4129 1 d4131 4 a4134 7 static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_full_5a_d22( uint64_t (*a)[5U], uint8_t b[1U][200U]) { uint64_t(*uu____0)[5U] = a; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_b[1U][200U]; memcpy(copy_of_b, b, (size_t)1U * sizeof(uint8_t[200U])); libcrux_sha3_portable_keccak_load_block_full_df2(uu____0, copy_of_b); d4138 5 a4142 1 A monomorphic instance of libcrux_sha3.generic_keccak.absorb_final d4149 5 a4153 21 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_final_c73( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice last[1U]) { size_t last_len = Eurydice_slice_len(last[0U], uint8_t); uint8_t blocks[1U][200U] = {{0U}}; for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; if (last_len > (size_t)0U) { Eurydice_slice uu____0 = Eurydice_array_to_subslice2( blocks[i0], (size_t)0U, last_len, uint8_t); Eurydice_slice_copy(uu____0, last[i0], uint8_t); } blocks[i0][last_len] = 6U; size_t uu____1 = i0; size_t uu____2 = (size_t)144U - (size_t)1U; blocks[uu____1][uu____2] = (uint32_t)blocks[uu____1][uu____2] | 128U; } uint64_t(*uu____3)[5U] = s->st; uint8_t uu____4[1U][200U]; memcpy(uu____4, blocks, (size_t)1U * sizeof(uint8_t[200U])); libcrux_sha3_portable_keccak_load_block_full_5a_d22(uu____3, uu____4); libcrux_sha3_generic_keccak_keccakf1600_21(s); d4157 1 a4157 1 A monomorphic instance of libcrux_sha3.portable_keccak.store_block d4161 8 a4168 6 static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_582( uint64_t (*s)[5U], Eurydice_slice out[1U]) { for (size_t i = (size_t)0U; i < (size_t)144U / (size_t)8U; i++) { size_t i0 = i; Eurydice_slice uu____0 = Eurydice_slice_subslice2( out[0U], (size_t)8U * i0, (size_t)8U * i0 + (size_t)8U, uint8_t); d4170 3 a4172 1 core_num__u64_9__to_le_bytes(s[i0 / (size_t)5U][i0 % (size_t)5U], ret); d4176 9 a4184 53 } /** A monomorphic instance of libcrux_sha3.portable_keccak.store_block_full with const generics - RATE= 144 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_full_2d1( uint64_t (*s)[5U], uint8_t ret[1U][200U]) { uint8_t out[200U] = {0U}; Eurydice_slice buf[1U] = { Eurydice_array_to_slice((size_t)200U, out, uint8_t)}; libcrux_sha3_portable_keccak_store_block_582(s, buf); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_out[200U]; memcpy(copy_of_out, out, (size_t)200U * sizeof(uint8_t)); memcpy(ret[0U], copy_of_out, (size_t)200U * sizeof(uint8_t)); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.store_block_full_5a with const generics - RATE= 144 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_full_5a_291(uint64_t (*a)[5U], uint8_t ret[1U][200U]) { libcrux_sha3_portable_keccak_store_block_full_2d1(a, ret); } /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_first_and_last with types uint64_t with const generics - N= 1 - RATE= 144 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_first_and_last_c51( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out[1U]) { uint8_t b[1U][200U]; libcrux_sha3_portable_keccak_store_block_full_5a_291(s->st, b); for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; Eurydice_slice uu____0 = out[i0]; uint8_t *uu____1 = b[i0]; core_ops_range_Range_b3 lit; lit.start = (size_t)0U; lit.end = Eurydice_slice_len(out[i0], uint8_t); d4186 2 a4187 3 uu____0, Eurydice_array_to_subslice((size_t)200U, uu____1, lit, uint8_t, core_ops_range_Range_b3), d4193 4 a4196 31 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.store_block_5a with const generics - RATE= 144 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_5a_592( uint64_t (*a)[5U], Eurydice_slice b[1U]) { libcrux_sha3_portable_keccak_store_block_582(a, b); } /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_first_block with types uint64_t with const generics - N= 1 - RATE= 144 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_first_block_842( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out[1U]) { libcrux_sha3_portable_keccak_store_block_5a_592(s->st, out); } /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_next_block with types uint64_t with const generics - N= 1 - RATE= 144 a4197 6 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_next_block_fc2( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out[1U]) { libcrux_sha3_generic_keccak_keccakf1600_21(s); libcrux_sha3_portable_keccak_store_block_5a_592(s->st, out); } d4199 1 a4199 2 A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_last with types uint64_t a4200 1 - N= 1 d4203 4 a4206 18 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_last_cf1( libcrux_sha3_generic_keccak_KeccakState_48 s, Eurydice_slice out[1U]) { libcrux_sha3_generic_keccak_keccakf1600_21(&s); uint8_t b[1U][200U]; libcrux_sha3_portable_keccak_store_block_full_5a_291(s.st, b); for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; Eurydice_slice uu____0 = out[i0]; uint8_t *uu____1 = b[i0]; core_ops_range_Range_b3 lit; lit.start = (size_t)0U; lit.end = Eurydice_slice_len(out[i0], uint8_t); Eurydice_slice_copy( uu____0, Eurydice_array_to_subslice((size_t)200U, uu____1, lit, uint8_t, core_ops_range_Range_b3), uint8_t); } d4210 1 a4210 2 A monomorphic instance of libcrux_sha3.generic_keccak.keccak with types uint64_t a4211 1 - N= 1 d4215 6 a4220 6 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_keccak_e92( Eurydice_slice data[1U], Eurydice_slice out[1U]) { libcrux_sha3_generic_keccak_KeccakState_48 s = libcrux_sha3_generic_keccak_new_1e_f4(); for (size_t i = (size_t)0U; i < Eurydice_slice_len(data[0U], uint8_t) / (size_t)144U; i++) { d4222 2 a4223 8 libcrux_sha3_generic_keccak_KeccakState_48 *uu____0 = &s; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice ret[1U]; libcrux_sha3_portable_keccak_slice_n_5a(copy_of_data, i0 * (size_t)144U, (size_t)144U, ret); libcrux_sha3_generic_keccak_absorb_block_df1(uu____0, ret); d4225 4 a4228 10 size_t rem = Eurydice_slice_len(data[0U], uint8_t) % (size_t)144U; libcrux_sha3_generic_keccak_KeccakState_48 *uu____2 = &s; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice ret[1U]; libcrux_sha3_portable_keccak_slice_n_5a( copy_of_data, Eurydice_slice_len(data[0U], uint8_t) - rem, rem, ret); libcrux_sha3_generic_keccak_absorb_final_c73(uu____2, ret); size_t outlen = Eurydice_slice_len(out[0U], uint8_t); d4232 1 a4232 1 libcrux_sha3_generic_keccak_squeeze_first_and_last_c51(&s, out); d4234 6 a4239 27 Eurydice_slice_uint8_t_1size_t__x2 uu____4 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(out, (size_t)144U); Eurydice_slice o0[1U]; memcpy(o0, uu____4.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice o1[1U]; memcpy(o1, uu____4.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_first_block_842(&s, o0); core_ops_range_Range_b3 iter = core_iter_traits_collect___core__iter__traits__collect__IntoIterator_for_I__1__into_iter( (CLITERAL(core_ops_range_Range_b3){.start = (size_t)1U, .end = blocks}), core_ops_range_Range_b3, core_ops_range_Range_b3); while (true) { if (core_iter_range___core__iter__traits__iterator__Iterator_for_core__ops__range__Range_A___6__next( &iter, size_t, Option_b3) .tag == None) { break; } else { Eurydice_slice_uint8_t_1size_t__x2 uu____5 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(o1, (size_t)144U); Eurydice_slice o[1U]; memcpy(o, uu____5.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice orest[1U]; memcpy(orest, uu____5.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_next_block_fc2(&s, o); memcpy(o1, orest, (size_t)1U * sizeof(Eurydice_slice)); } d4242 2 a4243 1 libcrux_sha3_generic_keccak_squeeze_last_cf1(s, o1); a4248 14 A monomorphic instance of libcrux_sha3.portable.keccakx1 with const generics - RATE= 144 - DELIM= 6 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccakx1_ce2( Eurydice_slice data[1U], Eurydice_slice out[1U]) { /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_keccak_e92(copy_of_data, out); } /** d4253 1 a4253 3 Eurydice_slice buf0[1U] = {data}; Eurydice_slice buf[1U] = {digest}; libcrux_sha3_portable_keccakx1_ce2(buf0, buf); d4257 1 a4257 1 A monomorphic instance of libcrux_sha3.portable_keccak.load_block d4261 3 a4263 2 static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_2c3( uint64_t (*s)[5U], Eurydice_slice blocks[1U]) { d4266 1 d4268 1 a4268 1 Result_56 dst; d4271 13 a4283 8 Eurydice_slice_subslice2(blocks[0U], (size_t)8U * i0, (size_t)8U * i0 + (size_t)8U, uint8_t), Eurydice_slice, uint8_t[8U]); unwrap_41_ac(dst, uu____0); size_t uu____1 = i0 / (size_t)5U; size_t uu____2 = i0 % (size_t)5U; s[uu____1][uu____2] = s[uu____1][uu____2] ^ core_num__u64_9__from_le_bytes(uu____0); d4288 4 a4291 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d4294 1 a4294 1 A monomorphic instance of libcrux_sha3.portable_keccak.load_block_5a d4298 4 a4301 7 static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_5a_b82( uint64_t (*a)[5U], Eurydice_slice b[1U]) { uint64_t(*uu____0)[5U] = a; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_b[1U]; memcpy(copy_of_b, b, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_portable_keccak_load_block_2c3(uu____0, copy_of_b); d4305 5 a4309 1 A monomorphic instance of libcrux_sha3.generic_keccak.absorb_block d4315 5 a4319 7 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_block_df2( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice blocks[1U]) { uint64_t(*uu____0)[5U] = s->st; Eurydice_slice uu____1[1U]; memcpy(uu____1, blocks, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_portable_keccak_load_block_5a_b82(uu____0, uu____1); libcrux_sha3_generic_keccak_keccakf1600_21(s); d4323 1 a4323 1 A monomorphic instance of libcrux_sha3.portable_keccak.load_block_full d4326 1 d4328 12 a4339 5 static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_full_df3( uint64_t (*s)[5U], uint8_t blocks[1U][200U]) { Eurydice_slice buf[1U] = { Eurydice_array_to_slice((size_t)200U, blocks[0U], uint8_t)}; libcrux_sha3_portable_keccak_load_block_2c3(s, buf); d4343 4 a4346 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d4349 1 a4349 1 A monomorphic instance of libcrux_sha3.portable_keccak.load_block_full_5a d4352 1 d4354 4 a4357 7 static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_full_5a_d23( uint64_t (*a)[5U], uint8_t b[1U][200U]) { uint64_t(*uu____0)[5U] = a; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_b[1U][200U]; memcpy(copy_of_b, b, (size_t)1U * sizeof(uint8_t[200U])); libcrux_sha3_portable_keccak_load_block_full_df3(uu____0, copy_of_b); d4361 5 a4365 1 A monomorphic instance of libcrux_sha3.generic_keccak.absorb_final d4372 5 a4376 21 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_final_c74( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice last[1U]) { size_t last_len = Eurydice_slice_len(last[0U], uint8_t); uint8_t blocks[1U][200U] = {{0U}}; for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; if (last_len > (size_t)0U) { Eurydice_slice uu____0 = Eurydice_array_to_subslice2( blocks[i0], (size_t)0U, last_len, uint8_t); Eurydice_slice_copy(uu____0, last[i0], uint8_t); } blocks[i0][last_len] = 6U; size_t uu____1 = i0; size_t uu____2 = (size_t)104U - (size_t)1U; blocks[uu____1][uu____2] = (uint32_t)blocks[uu____1][uu____2] | 128U; } uint64_t(*uu____3)[5U] = s->st; uint8_t uu____4[1U][200U]; memcpy(uu____4, blocks, (size_t)1U * sizeof(uint8_t[200U])); libcrux_sha3_portable_keccak_load_block_full_5a_d23(uu____3, uu____4); libcrux_sha3_generic_keccak_keccakf1600_21(s); d4380 1 a4380 1 A monomorphic instance of libcrux_sha3.portable_keccak.store_block d4384 8 a4391 6 static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_583( uint64_t (*s)[5U], Eurydice_slice out[1U]) { for (size_t i = (size_t)0U; i < (size_t)104U / (size_t)8U; i++) { size_t i0 = i; Eurydice_slice uu____0 = Eurydice_slice_subslice2( out[0U], (size_t)8U * i0, (size_t)8U * i0 + (size_t)8U, uint8_t); d4393 3 a4395 1 core_num__u64_9__to_le_bytes(s[i0 / (size_t)5U][i0 % (size_t)5U], ret); d4399 9 a4407 53 } /** A monomorphic instance of libcrux_sha3.portable_keccak.store_block_full with const generics - RATE= 104 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_full_2d2( uint64_t (*s)[5U], uint8_t ret[1U][200U]) { uint8_t out[200U] = {0U}; Eurydice_slice buf[1U] = { Eurydice_array_to_slice((size_t)200U, out, uint8_t)}; libcrux_sha3_portable_keccak_store_block_583(s, buf); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_out[200U]; memcpy(copy_of_out, out, (size_t)200U * sizeof(uint8_t)); memcpy(ret[0U], copy_of_out, (size_t)200U * sizeof(uint8_t)); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.store_block_full_5a with const generics - RATE= 104 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_full_5a_292(uint64_t (*a)[5U], uint8_t ret[1U][200U]) { libcrux_sha3_portable_keccak_store_block_full_2d2(a, ret); } /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_first_and_last with types uint64_t with const generics - N= 1 - RATE= 104 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_first_and_last_c52( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out[1U]) { uint8_t b[1U][200U]; libcrux_sha3_portable_keccak_store_block_full_5a_292(s->st, b); for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; Eurydice_slice uu____0 = out[i0]; uint8_t *uu____1 = b[i0]; core_ops_range_Range_b3 lit; lit.start = (size_t)0U; lit.end = Eurydice_slice_len(out[i0], uint8_t); d4409 2 a4410 3 uu____0, Eurydice_array_to_subslice((size_t)200U, uu____1, lit, uint8_t, core_ops_range_Range_b3), d4416 4 a4419 31 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.store_block_5a with const generics - RATE= 104 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_5a_593( uint64_t (*a)[5U], Eurydice_slice b[1U]) { libcrux_sha3_portable_keccak_store_block_583(a, b); } /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_first_block with types uint64_t with const generics - N= 1 - RATE= 104 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_first_block_843( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out[1U]) { libcrux_sha3_portable_keccak_store_block_5a_593(s->st, out); } /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_next_block with types uint64_t with const generics - N= 1 - RATE= 104 a4420 6 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_next_block_fc3( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out[1U]) { libcrux_sha3_generic_keccak_keccakf1600_21(s); libcrux_sha3_portable_keccak_store_block_5a_593(s->st, out); } d4422 1 a4422 2 A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_last with types uint64_t a4423 1 - N= 1 d4426 4 a4429 18 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_last_cf2( libcrux_sha3_generic_keccak_KeccakState_48 s, Eurydice_slice out[1U]) { libcrux_sha3_generic_keccak_keccakf1600_21(&s); uint8_t b[1U][200U]; libcrux_sha3_portable_keccak_store_block_full_5a_292(s.st, b); for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; Eurydice_slice uu____0 = out[i0]; uint8_t *uu____1 = b[i0]; core_ops_range_Range_b3 lit; lit.start = (size_t)0U; lit.end = Eurydice_slice_len(out[i0], uint8_t); Eurydice_slice_copy( uu____0, Eurydice_array_to_subslice((size_t)200U, uu____1, lit, uint8_t, core_ops_range_Range_b3), uint8_t); } d4433 1 a4433 2 A monomorphic instance of libcrux_sha3.generic_keccak.keccak with types uint64_t a4434 1 - N= 1 d4438 6 a4443 6 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_keccak_e93( Eurydice_slice data[1U], Eurydice_slice out[1U]) { libcrux_sha3_generic_keccak_KeccakState_48 s = libcrux_sha3_generic_keccak_new_1e_f4(); for (size_t i = (size_t)0U; i < Eurydice_slice_len(data[0U], uint8_t) / (size_t)104U; i++) { d4445 2 a4446 8 libcrux_sha3_generic_keccak_KeccakState_48 *uu____0 = &s; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice ret[1U]; libcrux_sha3_portable_keccak_slice_n_5a(copy_of_data, i0 * (size_t)104U, (size_t)104U, ret); libcrux_sha3_generic_keccak_absorb_block_df2(uu____0, ret); d4448 4 a4451 10 size_t rem = Eurydice_slice_len(data[0U], uint8_t) % (size_t)104U; libcrux_sha3_generic_keccak_KeccakState_48 *uu____2 = &s; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice ret[1U]; libcrux_sha3_portable_keccak_slice_n_5a( copy_of_data, Eurydice_slice_len(data[0U], uint8_t) - rem, rem, ret); libcrux_sha3_generic_keccak_absorb_final_c74(uu____2, ret); size_t outlen = Eurydice_slice_len(out[0U], uint8_t); d4455 1 a4455 1 libcrux_sha3_generic_keccak_squeeze_first_and_last_c52(&s, out); d4457 6 a4462 27 Eurydice_slice_uint8_t_1size_t__x2 uu____4 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(out, (size_t)104U); Eurydice_slice o0[1U]; memcpy(o0, uu____4.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice o1[1U]; memcpy(o1, uu____4.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_first_block_843(&s, o0); core_ops_range_Range_b3 iter = core_iter_traits_collect___core__iter__traits__collect__IntoIterator_for_I__1__into_iter( (CLITERAL(core_ops_range_Range_b3){.start = (size_t)1U, .end = blocks}), core_ops_range_Range_b3, core_ops_range_Range_b3); while (true) { if (core_iter_range___core__iter__traits__iterator__Iterator_for_core__ops__range__Range_A___6__next( &iter, size_t, Option_b3) .tag == None) { break; } else { Eurydice_slice_uint8_t_1size_t__x2 uu____5 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(o1, (size_t)104U); Eurydice_slice o[1U]; memcpy(o, uu____5.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice orest[1U]; memcpy(orest, uu____5.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_next_block_fc3(&s, o); memcpy(o1, orest, (size_t)1U * sizeof(Eurydice_slice)); } d4465 2 a4466 1 libcrux_sha3_generic_keccak_squeeze_last_cf2(s, o1); a4471 14 A monomorphic instance of libcrux_sha3.portable.keccakx1 with const generics - RATE= 104 - DELIM= 6 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccakx1_ce3( Eurydice_slice data[1U], Eurydice_slice out[1U]) { /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_keccak_e93(copy_of_data, out); } /** d4476 1 a4476 3 Eurydice_slice buf0[1U] = {data}; Eurydice_slice buf[1U] = {digest}; libcrux_sha3_portable_keccakx1_ce3(buf0, buf); d4485 2 a4486 2 static KRML_MUSTINLINE void libcrux_sha3_sha224_ema(Eurydice_slice digest, Eurydice_slice payload) { d4493 1 a4493 2 static KRML_MUSTINLINE void libcrux_sha3_sha224(Eurydice_slice data, uint8_t ret[28U]) { d4503 2 a4504 2 static KRML_MUSTINLINE void libcrux_sha3_sha256_ema(Eurydice_slice digest, Eurydice_slice payload) { d4511 1 a4511 2 static KRML_MUSTINLINE void libcrux_sha3_sha256(Eurydice_slice data, uint8_t ret[32U]) { d4521 2 a4522 2 static KRML_MUSTINLINE void libcrux_sha3_sha384_ema(Eurydice_slice digest, Eurydice_slice payload) { d4529 1 a4529 2 static KRML_MUSTINLINE void libcrux_sha3_sha384(Eurydice_slice data, uint8_t ret[48U]) { d4539 2 a4540 2 static KRML_MUSTINLINE void libcrux_sha3_sha512_ema(Eurydice_slice digest, Eurydice_slice payload) { d4547 1 a4547 2 static KRML_MUSTINLINE void libcrux_sha3_sha512(Eurydice_slice data, uint8_t ret[64U]) { d4555 4 a4558 2 This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} d4561 1 a4561 1 A monomorphic instance of libcrux_sha3.portable_keccak.load_block_5a d4565 4 a4568 7 static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_5a_b83( uint64_t (*a)[5U], Eurydice_slice b[1U]) { uint64_t(*uu____0)[5U] = a; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_b[1U]; memcpy(copy_of_b, b, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_portable_keccak_load_block_2c1(uu____0, copy_of_b); d4572 2 a4573 53 A monomorphic instance of libcrux_sha3.generic_keccak.absorb_block with types uint64_t with const generics - N= 1 - RATE= 168 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_block_df3( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice blocks[1U]) { uint64_t(*uu____0)[5U] = s->st; Eurydice_slice uu____1[1U]; memcpy(uu____1, blocks, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_portable_keccak_load_block_5a_b83(uu____0, uu____1); libcrux_sha3_generic_keccak_keccakf1600_21(s); } /** A monomorphic instance of libcrux_sha3.portable_keccak.store_block_full with const generics - RATE= 168 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_full_2d3( uint64_t (*s)[5U], uint8_t ret[1U][200U]) { uint8_t out[200U] = {0U}; Eurydice_slice buf[1U] = { Eurydice_array_to_slice((size_t)200U, out, uint8_t)}; libcrux_sha3_portable_keccak_store_block_581(s, buf); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_out[200U]; memcpy(copy_of_out, out, (size_t)200U * sizeof(uint8_t)); memcpy(ret[0U], copy_of_out, (size_t)200U * sizeof(uint8_t)); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.store_block_full_5a with const generics - RATE= 168 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_full_5a_293(uint64_t (*a)[5U], uint8_t ret[1U][200U]) { libcrux_sha3_portable_keccak_store_block_full_2d3(a, ret); } /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_first_and_last with types uint64_t with const generics - N= 1 - RATE= 168 a4574 20 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_first_and_last_c53( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out[1U]) { uint8_t b[1U][200U]; libcrux_sha3_portable_keccak_store_block_full_5a_293(s->st, b); for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; Eurydice_slice uu____0 = out[i0]; uint8_t *uu____1 = b[i0]; core_ops_range_Range_b3 lit; lit.start = (size_t)0U; lit.end = Eurydice_slice_len(out[i0], uint8_t); Eurydice_slice_copy( uu____0, Eurydice_array_to_subslice((size_t)200U, uu____1, lit, uint8_t, core_ops_range_Range_b3), uint8_t); } } d4576 1 a4576 1 A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_last d4582 5 a4586 18 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_last_cf3( libcrux_sha3_generic_keccak_KeccakState_48 s, Eurydice_slice out[1U]) { libcrux_sha3_generic_keccak_keccakf1600_21(&s); uint8_t b[1U][200U]; libcrux_sha3_portable_keccak_store_block_full_5a_293(s.st, b); for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; Eurydice_slice uu____0 = out[i0]; uint8_t *uu____1 = b[i0]; core_ops_range_Range_b3 lit; lit.start = (size_t)0U; lit.end = Eurydice_slice_len(out[i0], uint8_t); Eurydice_slice_copy( uu____0, Eurydice_array_to_subslice((size_t)200U, uu____1, lit, uint8_t, core_ops_range_Range_b3), uint8_t); } d4590 1 a4590 2 A monomorphic instance of libcrux_sha3.generic_keccak.keccak with types uint64_t a4591 1 - N= 1 d4595 6 a4600 6 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_keccak_e94( Eurydice_slice data[1U], Eurydice_slice out[1U]) { libcrux_sha3_generic_keccak_KeccakState_48 s = libcrux_sha3_generic_keccak_new_1e_f4(); for (size_t i = (size_t)0U; i < Eurydice_slice_len(data[0U], uint8_t) / (size_t)168U; i++) { d4602 2 a4603 8 libcrux_sha3_generic_keccak_KeccakState_48 *uu____0 = &s; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice ret[1U]; libcrux_sha3_portable_keccak_slice_n_5a(copy_of_data, i0 * (size_t)168U, (size_t)168U, ret); libcrux_sha3_generic_keccak_absorb_block_df3(uu____0, ret); d4605 4 a4608 10 size_t rem = Eurydice_slice_len(data[0U], uint8_t) % (size_t)168U; libcrux_sha3_generic_keccak_KeccakState_48 *uu____2 = &s; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice ret[1U]; libcrux_sha3_portable_keccak_slice_n_5a( copy_of_data, Eurydice_slice_len(data[0U], uint8_t) - rem, rem, ret); libcrux_sha3_generic_keccak_absorb_final_c72(uu____2, ret); size_t outlen = Eurydice_slice_len(out[0U], uint8_t); d4612 1 a4612 1 libcrux_sha3_generic_keccak_squeeze_first_and_last_c53(&s, out); d4614 6 a4619 27 Eurydice_slice_uint8_t_1size_t__x2 uu____4 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(out, (size_t)168U); Eurydice_slice o0[1U]; memcpy(o0, uu____4.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice o1[1U]; memcpy(o1, uu____4.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_first_block_841(&s, o0); core_ops_range_Range_b3 iter = core_iter_traits_collect___core__iter__traits__collect__IntoIterator_for_I__1__into_iter( (CLITERAL(core_ops_range_Range_b3){.start = (size_t)1U, .end = blocks}), core_ops_range_Range_b3, core_ops_range_Range_b3); while (true) { if (core_iter_range___core__iter__traits__iterator__Iterator_for_core__ops__range__Range_A___6__next( &iter, size_t, Option_b3) .tag == None) { break; } else { Eurydice_slice_uint8_t_1size_t__x2 uu____5 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(o1, (size_t)168U); Eurydice_slice o[1U]; memcpy(o, uu____5.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice orest[1U]; memcpy(orest, uu____5.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_next_block_fc1(&s, o); memcpy(o1, orest, (size_t)1U * sizeof(Eurydice_slice)); } d4622 2 a4623 1 libcrux_sha3_generic_keccak_squeeze_last_cf3(s, o1); a4628 14 A monomorphic instance of libcrux_sha3.portable.keccakx1 with const generics - RATE= 168 - DELIM= 31 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccakx1_ce4( Eurydice_slice data[1U], Eurydice_slice out[1U]) { /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_keccak_e94(copy_of_data, out); } /** d4633 1 a4633 3 Eurydice_slice buf0[1U] = {data}; Eurydice_slice buf[1U] = {digest}; libcrux_sha3_portable_keccakx1_ce4(buf0, buf); d4641 2 a4642 2 static KRML_MUSTINLINE void libcrux_sha3_shake128_ema(Eurydice_slice out, Eurydice_slice data) { d4651 2 a4652 2 static KRML_MUSTINLINE void libcrux_sha3_shake256_ema(Eurydice_slice out, Eurydice_slice data) { a4655 14 static const size_t libcrux_sha3_generic_keccak__PI[24U] = { (size_t)6U, (size_t)12U, (size_t)18U, (size_t)24U, (size_t)3U, (size_t)9U, (size_t)10U, (size_t)16U, (size_t)22U, (size_t)1U, (size_t)7U, (size_t)13U, (size_t)19U, (size_t)20U, (size_t)4U, (size_t)5U, (size_t)11U, (size_t)17U, (size_t)23U, (size_t)2U, (size_t)8U, (size_t)14U, (size_t)15U, (size_t)21U}; static const size_t libcrux_sha3_generic_keccak__ROTC[24U] = { (size_t)1U, (size_t)62U, (size_t)28U, (size_t)27U, (size_t)36U, (size_t)44U, (size_t)6U, (size_t)55U, (size_t)20U, (size_t)3U, (size_t)10U, (size_t)43U, (size_t)25U, (size_t)39U, (size_t)41U, (size_t)45U, (size_t)15U, (size_t)21U, (size_t)8U, (size_t)18U, (size_t)2U, (size_t)61U, (size_t)56U, (size_t)14U}; d4657 10 a4666 1 A portable SHA3 224 implementation. d4668 16 a4683 5 static KRML_MUSTINLINE void libcrux_sha3_neon_sha224(Eurydice_slice digest, Eurydice_slice data) { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "panic!"); KRML_HOST_EXIT(255U); d4687 1 a4687 1 A portable SHA3 256 implementation. d4689 4 a4692 5 static KRML_MUSTINLINE void libcrux_sha3_neon_sha256(Eurydice_slice digest, Eurydice_slice data) { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "panic!"); KRML_HOST_EXIT(255U); d4696 1 a4696 49 A portable SHA3 384 implementation. */ static KRML_MUSTINLINE void libcrux_sha3_neon_sha384(Eurydice_slice digest, Eurydice_slice data) { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "panic!"); KRML_HOST_EXIT(255U); } /** A portable SHA3 512 implementation. */ static KRML_MUSTINLINE void libcrux_sha3_neon_sha512(Eurydice_slice digest, Eurydice_slice data) { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "panic!"); KRML_HOST_EXIT(255U); } /** Run SHAKE256 on both inputs in parallel. Writes the two results into `out0` and `out1` */ static KRML_MUSTINLINE void libcrux_sha3_neon_x2_shake256(Eurydice_slice input0, Eurydice_slice input1, Eurydice_slice out0, Eurydice_slice out1) { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "panic!"); KRML_HOST_EXIT(255U); } typedef struct libcrux_sha3_neon_x2_incremental_KeccakState_s { libcrux_sha3_generic_keccak_KeccakState_48 state[2U]; } libcrux_sha3_neon_x2_incremental_KeccakState; /** Initialise the `KeccakState2`. */ static KRML_MUSTINLINE libcrux_sha3_neon_x2_incremental_KeccakState libcrux_sha3_neon_x2_incremental_shake128_init(void) { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "panic!"); KRML_HOST_EXIT(255U); } /** Shake128 absorb `data0` and `data1` in the [`KeccakState`] `s`. d4699 6 a4704 6 libcrux_sha3_neon_x2_incremental_shake128_absorb_final( libcrux_sha3_neon_x2_incremental_KeccakState *s, Eurydice_slice data0, Eurydice_slice data1) { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "panic!"); KRML_HOST_EXIT(255U); d4708 1 a4708 2 Squeeze 2 times the first three blocks in parallel in the [`KeccakState`] and return the output in `out0` and `out1`. d4710 3 a4712 7 static KRML_MUSTINLINE void libcrux_sha3_neon_x2_incremental_shake128_squeeze_first_three_blocks( libcrux_sha3_neon_x2_incremental_KeccakState *s, Eurydice_slice out0, Eurydice_slice out1) { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "panic!"); KRML_HOST_EXIT(255U); d4716 4 a4719 2 Squeeze 2 times the next block in parallel in the [`KeccakState`] and return the output in `out0` and `out1`. a4720 9 static KRML_MUSTINLINE void libcrux_sha3_neon_x2_incremental_shake128_squeeze_next_block( libcrux_sha3_neon_x2_incremental_KeccakState *s, Eurydice_slice out0, Eurydice_slice out1) { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "panic!"); KRML_HOST_EXIT(255U); } d4722 3 a4724 5 A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_first_five_blocks with types uint64_t with const generics - N= 1 - RATE= 168 d4727 3 a4729 31 libcrux_sha3_generic_keccak_squeeze_first_five_blocks_4f( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out[1U]) { Eurydice_slice_uint8_t_1size_t__x2 uu____0 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(out, (size_t)168U); Eurydice_slice o0[1U]; memcpy(o0, uu____0.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice o10[1U]; memcpy(o10, uu____0.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_first_block_841(s, o0); Eurydice_slice_uint8_t_1size_t__x2 uu____1 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(o10, (size_t)168U); Eurydice_slice o1[1U]; memcpy(o1, uu____1.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice o20[1U]; memcpy(o20, uu____1.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_next_block_fc1(s, o1); Eurydice_slice_uint8_t_1size_t__x2 uu____2 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(o20, (size_t)168U); Eurydice_slice o2[1U]; memcpy(o2, uu____2.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice o30[1U]; memcpy(o30, uu____2.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_next_block_fc1(s, o2); Eurydice_slice_uint8_t_1size_t__x2 uu____3 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(o30, (size_t)168U); Eurydice_slice o3[1U]; memcpy(o3, uu____3.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice o4[1U]; memcpy(o4, uu____3.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_next_block_fc1(s, o3); libcrux_sha3_generic_keccak_squeeze_next_block_fc1(s, o4); d4733 1 a4733 1 Squeeze five blocks d4736 3 a4738 4 libcrux_sha3_portable_incremental_shake128_squeeze_first_five_blocks( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out0) { Eurydice_slice buf[1U] = {out0}; libcrux_sha3_generic_keccak_squeeze_first_five_blocks_4f(s, buf); d4742 4 a4745 1 Absorb some data for SHAKE-256 for the last time a4746 7 static KRML_MUSTINLINE void libcrux_sha3_portable_incremental_shake256_absorb_final( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice data) { Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_final_c71(s, buf); } d4748 3 a4750 9 Create a new SHAKE-256 state object. */ static KRML_MUSTINLINE libcrux_sha3_generic_keccak_KeccakState_48 libcrux_sha3_portable_incremental_shake256_init(void) { return libcrux_sha3_generic_keccak_new_1e_f4(); } /** Squeeze the first SHAKE-256 block d4753 5 a4757 4 libcrux_sha3_portable_incremental_shake256_squeeze_first_block( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out) { Eurydice_slice buf[1U] = {out}; libcrux_sha3_generic_keccak_squeeze_first_block_840(s, buf); d4765 3 a4767 3 libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out) { Eurydice_slice buf[1U] = {out}; libcrux_sha3_generic_keccak_squeeze_next_block_fc0(s, buf); d4771 1 a4771 1 A monomorphic instance of libcrux_sha3.generic_keccak.KeccakXofState d4777 2 a4778 2 typedef struct libcrux_sha3_generic_keccak_KeccakXofState_4f_s { libcrux_sha3_generic_keccak_KeccakState_48 inner; d4782 1 a4782 1 } libcrux_sha3_generic_keccak_KeccakXofState_4f; d4784 2 a4785 2 typedef libcrux_sha3_generic_keccak_KeccakXofState_4f libcrux_sha3_portable_incremental_Shake256Absorb; d4788 3 a4790 7 Consume the internal buffer and the required amount of the input to pad to `RATE`. Returns the `consumed` bytes from `inputs` if there's enough buffered content to consume, and `0` otherwise. If `consumed > 0` is returned, `self.buf` contains a full block to be loaded. d4793 1 a4793 5 This function found in impl {libcrux_sha3::generic_keccak::KeccakXofState[TraitClause@@0]#2} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.fill_buffer_9d d4799 3 a4801 3 static inline size_t libcrux_sha3_generic_keccak_fill_buffer_9d_b0( libcrux_sha3_generic_keccak_KeccakXofState_4f *self, Eurydice_slice inputs[1U]) { d4810 2 a4811 1 (size_t)136U, self->buf[i0], self->buf_len, uint8_t, size_t); d4814 2 a4815 1 Eurydice_slice_subslice_to(inputs[i0], consumed, uint8_t, size_t), d4825 3 a4827 2 This function found in impl {libcrux_sha3::generic_keccak::KeccakXofState[TraitClause@@0]#2} d4830 1 a4830 1 A monomorphic instance of libcrux_sha3.generic_keccak.absorb_full_9d d4836 3 a4838 7 static inline size_t libcrux_sha3_generic_keccak_absorb_full_9d_f8( libcrux_sha3_generic_keccak_KeccakXofState_4f *self, Eurydice_slice inputs[1U]) { libcrux_sha3_generic_keccak_KeccakXofState_4f *uu____0 = self; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_inputs0[1U]; memcpy(copy_of_inputs0, inputs, (size_t)1U * sizeof(Eurydice_slice)); d4840 1 a4840 1 libcrux_sha3_generic_keccak_fill_buffer_9d_b0(uu____0, copy_of_inputs0); d4845 2 a4846 2 borrowed[i] = core_array___Array_T__N__23__as_slice( (size_t)136U, buf, uint8_t, Eurydice_slice); d4853 3 a4855 5 uint64_t(*uu____2)[5U] = self->inner.st; Eurydice_slice uu____3[1U]; memcpy(uu____3, borrowed, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_portable_keccak_load_block_5a_b80(uu____2, uu____3); libcrux_sha3_generic_keccak_keccakf1600_21(&self->inner); d4864 3 a4866 9 uint64_t(*uu____4)[5U] = self->inner.st; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_inputs[1U]; memcpy(copy_of_inputs, inputs, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice ret[1U]; libcrux_sha3_portable_keccak_slice_n_5a( copy_of_inputs, input_consumed + i0 * (size_t)136U, (size_t)136U, ret); libcrux_sha3_portable_keccak_load_block_5a_b80(uu____4, ret); libcrux_sha3_generic_keccak_keccakf1600_21(&self->inner); d4872 3 a4874 14 Absorb This function takes any number of bytes to absorb and buffers if it's not enough. The function assumes that all input slices in `blocks` have the same length. Only a multiple of `RATE` blocks are absorbed. For the remaining bytes [`absorb_final`] needs to be called. This works best with relatively small `inputs`. */ /** This function found in impl {libcrux_sha3::generic_keccak::KeccakXofState[TraitClause@@0]#2} d4877 1 a4877 1 A monomorphic instance of libcrux_sha3.generic_keccak.absorb_9d d4883 3 a4885 7 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_9d_7b( libcrux_sha3_generic_keccak_KeccakXofState_4f *self, Eurydice_slice inputs[1U]) { libcrux_sha3_generic_keccak_KeccakXofState_4f *uu____0 = self; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_inputs[1U]; memcpy(copy_of_inputs, inputs, (size_t)1U * sizeof(Eurydice_slice)); d4887 1 a4887 1 libcrux_sha3_generic_keccak_absorb_full_9d_f8(uu____0, copy_of_inputs); d4892 7 a4898 8 Eurydice_slice uu____2 = Eurydice_array_to_subslice2( self->buf[i0], self->buf_len, self->buf_len + input_remainder_len, uint8_t); Eurydice_slice_copy( uu____2, Eurydice_slice_subslice_from( inputs[i0], input_len - input_remainder_len, uint8_t, size_t), uint8_t); d4908 2 a4909 3 This function found in impl {(libcrux_sha3::portable::incremental::XofAbsorb<136: usize> for libcrux_sha3::portable::incremental::Shake256Absorb)#2} d4911 3 a4913 2 static inline void libcrux_sha3_portable_incremental_absorb_7d( libcrux_sha3_generic_keccak_KeccakXofState_4f *self, Eurydice_slice input) { d4915 1 a4915 1 libcrux_sha3_generic_keccak_absorb_9d_7b(self, buf); a4917 3 typedef libcrux_sha3_generic_keccak_KeccakXofState_4f libcrux_sha3_portable_incremental_Shake256Squeeze; d4919 3 a4921 8 Absorb a final block. The `inputs` block may be empty. Everything in the `inputs` block beyond `RATE` bytes is ignored. */ /** This function found in impl {libcrux_sha3::generic_keccak::KeccakXofState[TraitClause@@0]#2} d4924 1 a4924 1 A monomorphic instance of libcrux_sha3.generic_keccak.absorb_final_9d d4931 10 a4940 11 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_final_9d_25( libcrux_sha3_generic_keccak_KeccakXofState_4f *self, Eurydice_slice inputs[1U]) { libcrux_sha3_generic_keccak_KeccakXofState_4f *uu____0 = self; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_inputs[1U]; memcpy(copy_of_inputs, inputs, (size_t)1U * sizeof(Eurydice_slice)); size_t input_remainder_len = libcrux_sha3_generic_keccak_absorb_full_9d_f8(uu____0, copy_of_inputs); size_t input_len = Eurydice_slice_len(inputs[0U], uint8_t); uint8_t blocks[1U][200U] = {{0U}}; d4943 6 a4948 28 if (self->buf_len > (size_t)0U) { Eurydice_slice uu____2 = Eurydice_array_to_subslice2( blocks[i0], (size_t)0U, self->buf_len, uint8_t); Eurydice_slice_copy(uu____2, Eurydice_array_to_subslice2(self->buf[i0], (size_t)0U, self->buf_len, uint8_t), uint8_t); } if (input_remainder_len > (size_t)0U) { Eurydice_slice uu____3 = Eurydice_array_to_subslice2( blocks[i0], self->buf_len, self->buf_len + input_remainder_len, uint8_t); Eurydice_slice_copy( uu____3, Eurydice_slice_subslice_from( inputs[i0], input_len - input_remainder_len, uint8_t, size_t), uint8_t); } blocks[i0][self->buf_len + input_remainder_len] = 31U; size_t uu____4 = i0; size_t uu____5 = (size_t)136U - (size_t)1U; blocks[uu____4][uu____5] = (uint32_t)blocks[uu____4][uu____5] | 128U; } uint64_t(*uu____6)[5U] = self->inner.st; uint8_t uu____7[1U][200U]; memcpy(uu____7, blocks, (size_t)1U * sizeof(uint8_t[200U])); libcrux_sha3_portable_keccak_load_block_full_5a_d20(uu____6, uu____7); libcrux_sha3_generic_keccak_keccakf1600_21(&self->inner); d4955 2 a4956 3 This function found in impl {(libcrux_sha3::portable::incremental::XofAbsorb<136: usize> for libcrux_sha3::portable::incremental::Shake256Absorb)#2} d4958 3 a4960 3 static inline libcrux_sha3_generic_keccak_KeccakXofState_4f libcrux_sha3_portable_incremental_absorb_final_7d( libcrux_sha3_generic_keccak_KeccakXofState_4f self, Eurydice_slice input) { d4962 1 a4962 2 libcrux_sha3_generic_keccak_absorb_final_9d_25(&self, buf); return self; d4966 3 a4968 5 An all zero block */ /** This function found in impl {libcrux_sha3::generic_keccak::KeccakXofState[TraitClause@@0]#2} d4971 1 a4971 1 A monomorphic instance of libcrux_sha3.generic_keccak.zero_block_9d d4977 1 a4977 1 static inline void libcrux_sha3_generic_keccak_zero_block_9d_e6( d4979 1 a4979 136 ret[0U] = 0U; ret[1U] = 0U; ret[2U] = 0U; ret[3U] = 0U; ret[4U] = 0U; ret[5U] = 0U; ret[6U] = 0U; ret[7U] = 0U; ret[8U] = 0U; ret[9U] = 0U; ret[10U] = 0U; ret[11U] = 0U; ret[12U] = 0U; ret[13U] = 0U; ret[14U] = 0U; ret[15U] = 0U; ret[16U] = 0U; ret[17U] = 0U; ret[18U] = 0U; ret[19U] = 0U; ret[20U] = 0U; ret[21U] = 0U; ret[22U] = 0U; ret[23U] = 0U; ret[24U] = 0U; ret[25U] = 0U; ret[26U] = 0U; ret[27U] = 0U; ret[28U] = 0U; ret[29U] = 0U; ret[30U] = 0U; ret[31U] = 0U; ret[32U] = 0U; ret[33U] = 0U; ret[34U] = 0U; ret[35U] = 0U; ret[36U] = 0U; ret[37U] = 0U; ret[38U] = 0U; ret[39U] = 0U; ret[40U] = 0U; ret[41U] = 0U; ret[42U] = 0U; ret[43U] = 0U; ret[44U] = 0U; ret[45U] = 0U; ret[46U] = 0U; ret[47U] = 0U; ret[48U] = 0U; ret[49U] = 0U; ret[50U] = 0U; ret[51U] = 0U; ret[52U] = 0U; ret[53U] = 0U; ret[54U] = 0U; ret[55U] = 0U; ret[56U] = 0U; ret[57U] = 0U; ret[58U] = 0U; ret[59U] = 0U; ret[60U] = 0U; ret[61U] = 0U; ret[62U] = 0U; ret[63U] = 0U; ret[64U] = 0U; ret[65U] = 0U; ret[66U] = 0U; ret[67U] = 0U; ret[68U] = 0U; ret[69U] = 0U; ret[70U] = 0U; ret[71U] = 0U; ret[72U] = 0U; ret[73U] = 0U; ret[74U] = 0U; ret[75U] = 0U; ret[76U] = 0U; ret[77U] = 0U; ret[78U] = 0U; ret[79U] = 0U; ret[80U] = 0U; ret[81U] = 0U; ret[82U] = 0U; ret[83U] = 0U; ret[84U] = 0U; ret[85U] = 0U; ret[86U] = 0U; ret[87U] = 0U; ret[88U] = 0U; ret[89U] = 0U; ret[90U] = 0U; ret[91U] = 0U; ret[92U] = 0U; ret[93U] = 0U; ret[94U] = 0U; ret[95U] = 0U; ret[96U] = 0U; ret[97U] = 0U; ret[98U] = 0U; ret[99U] = 0U; ret[100U] = 0U; ret[101U] = 0U; ret[102U] = 0U; ret[103U] = 0U; ret[104U] = 0U; ret[105U] = 0U; ret[106U] = 0U; ret[107U] = 0U; ret[108U] = 0U; ret[109U] = 0U; ret[110U] = 0U; ret[111U] = 0U; ret[112U] = 0U; ret[113U] = 0U; ret[114U] = 0U; ret[115U] = 0U; ret[116U] = 0U; ret[117U] = 0U; ret[118U] = 0U; ret[119U] = 0U; ret[120U] = 0U; ret[121U] = 0U; ret[122U] = 0U; ret[123U] = 0U; ret[124U] = 0U; ret[125U] = 0U; ret[126U] = 0U; ret[127U] = 0U; ret[128U] = 0U; ret[129U] = 0U; ret[130U] = 0U; ret[131U] = 0U; ret[132U] = 0U; ret[133U] = 0U; ret[134U] = 0U; ret[135U] = 0U; d4983 3 a4985 5 Generate a new keccak xof state. */ /** This function found in impl {libcrux_sha3::generic_keccak::KeccakXofState[TraitClause@@0]#2} d4988 1 a4988 1 A monomorphic instance of libcrux_sha3.generic_keccak.new_9d d4994 9 a5002 7 static inline libcrux_sha3_generic_keccak_KeccakXofState_4f libcrux_sha3_generic_keccak_new_9d_7e(void) { libcrux_sha3_generic_keccak_KeccakXofState_4f lit; lit.inner = libcrux_sha3_generic_keccak_new_1e_f4(); uint8_t ret[136U]; libcrux_sha3_generic_keccak_zero_block_9d_e6(ret); memcpy(lit.buf[0U], ret, (size_t)136U * sizeof(uint8_t)); d5012 12 d5025 45 a5069 2 {(libcrux_sha3::portable::incremental::XofAbsorb<136: usize> for libcrux_sha3::portable::incremental::Shake256Absorb)#2} d5071 4 a5074 3 static inline libcrux_sha3_generic_keccak_KeccakXofState_4f libcrux_sha3_portable_incremental_new_7d(void) { return libcrux_sha3_generic_keccak_new_9d_7e(); d5078 1 a5078 1 A monomorphic instance of libcrux_sha3.generic_keccak.KeccakXofState d5084 2 a5085 2 typedef struct libcrux_sha3_generic_keccak_KeccakXofState_78_s { libcrux_sha3_generic_keccak_KeccakState_48 inner; d5089 1 a5089 1 } libcrux_sha3_generic_keccak_KeccakXofState_78; d5091 2 a5092 2 typedef libcrux_sha3_generic_keccak_KeccakXofState_78 libcrux_sha3_portable_incremental_Shake128Absorb; d5095 3 a5097 11 Consume the internal buffer and the required amount of the input to pad to `RATE`. Returns the `consumed` bytes from `inputs` if there's enough buffered content to consume, and `0` otherwise. If `consumed > 0` is returned, `self.buf` contains a full block to be loaded. */ /** This function found in impl {libcrux_sha3::generic_keccak::KeccakXofState[TraitClause@@0]#2} d5100 1 a5100 1 A monomorphic instance of libcrux_sha3.generic_keccak.fill_buffer_9d d5106 3 a5108 3 static inline size_t libcrux_sha3_generic_keccak_fill_buffer_9d_b00( libcrux_sha3_generic_keccak_KeccakXofState_78 *self, Eurydice_slice inputs[1U]) { d5117 2 a5118 1 (size_t)168U, self->buf[i0], self->buf_len, uint8_t, size_t); d5121 2 a5122 1 Eurydice_slice_subslice_to(inputs[i0], consumed, uint8_t, size_t), d5132 3 a5134 2 This function found in impl {libcrux_sha3::generic_keccak::KeccakXofState[TraitClause@@0]#2} d5137 1 a5137 1 A monomorphic instance of libcrux_sha3.generic_keccak.absorb_full_9d d5143 3 a5145 7 static inline size_t libcrux_sha3_generic_keccak_absorb_full_9d_f80( libcrux_sha3_generic_keccak_KeccakXofState_78 *self, Eurydice_slice inputs[1U]) { libcrux_sha3_generic_keccak_KeccakXofState_78 *uu____0 = self; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_inputs0[1U]; memcpy(copy_of_inputs0, inputs, (size_t)1U * sizeof(Eurydice_slice)); d5147 1 a5147 1 libcrux_sha3_generic_keccak_fill_buffer_9d_b00(uu____0, copy_of_inputs0); d5152 2 a5153 2 borrowed[i] = core_array___Array_T__N__23__as_slice( (size_t)168U, buf, uint8_t, Eurydice_slice); d5160 3 a5162 5 uint64_t(*uu____2)[5U] = self->inner.st; Eurydice_slice uu____3[1U]; memcpy(uu____3, borrowed, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_portable_keccak_load_block_5a_b83(uu____2, uu____3); libcrux_sha3_generic_keccak_keccakf1600_21(&self->inner); d5171 3 a5173 9 uint64_t(*uu____4)[5U] = self->inner.st; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_inputs[1U]; memcpy(copy_of_inputs, inputs, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice ret[1U]; libcrux_sha3_portable_keccak_slice_n_5a( copy_of_inputs, input_consumed + i0 * (size_t)168U, (size_t)168U, ret); libcrux_sha3_portable_keccak_load_block_5a_b83(uu____4, ret); libcrux_sha3_generic_keccak_keccakf1600_21(&self->inner); d5179 3 a5181 10 Absorb This function takes any number of bytes to absorb and buffers if it's not enough. The function assumes that all input slices in `blocks` have the same length. Only a multiple of `RATE` blocks are absorbed. For the remaining bytes [`absorb_final`] needs to be called. This works best with relatively small `inputs`. d5184 1 a5184 5 This function found in impl {libcrux_sha3::generic_keccak::KeccakXofState[TraitClause@@0]#2} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_9d d5190 3 a5192 7 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_9d_7b0( libcrux_sha3_generic_keccak_KeccakXofState_78 *self, Eurydice_slice inputs[1U]) { libcrux_sha3_generic_keccak_KeccakXofState_78 *uu____0 = self; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_inputs[1U]; memcpy(copy_of_inputs, inputs, (size_t)1U * sizeof(Eurydice_slice)); d5194 1 a5194 1 libcrux_sha3_generic_keccak_absorb_full_9d_f80(uu____0, copy_of_inputs); d5199 7 a5205 8 Eurydice_slice uu____2 = Eurydice_array_to_subslice2( self->buf[i0], self->buf_len, self->buf_len + input_remainder_len, uint8_t); Eurydice_slice_copy( uu____2, Eurydice_slice_subslice_from( inputs[i0], input_len - input_remainder_len, uint8_t, size_t), uint8_t); d5212 2 a5213 3 This function found in impl {(libcrux_sha3::portable::incremental::XofAbsorb<168: usize> for libcrux_sha3::portable::incremental::Shake128Absorb)} d5215 3 a5217 2 static inline void libcrux_sha3_portable_incremental_absorb_1c( libcrux_sha3_generic_keccak_KeccakXofState_78 *self, Eurydice_slice input) { d5219 1 a5219 1 libcrux_sha3_generic_keccak_absorb_9d_7b0(self, buf); a5221 3 typedef libcrux_sha3_generic_keccak_KeccakXofState_78 libcrux_sha3_portable_incremental_Shake128Squeeze; d5223 3 a5225 4 Absorb a final block. The `inputs` block may be empty. Everything in the `inputs` block beyond `RATE` bytes is ignored. d5228 1 a5228 5 This function found in impl {libcrux_sha3::generic_keccak::KeccakXofState[TraitClause@@0]#2} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_final_9d d5235 10 a5244 11 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_final_9d_250( libcrux_sha3_generic_keccak_KeccakXofState_78 *self, Eurydice_slice inputs[1U]) { libcrux_sha3_generic_keccak_KeccakXofState_78 *uu____0 = self; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_inputs[1U]; memcpy(copy_of_inputs, inputs, (size_t)1U * sizeof(Eurydice_slice)); size_t input_remainder_len = libcrux_sha3_generic_keccak_absorb_full_9d_f80(uu____0, copy_of_inputs); size_t input_len = Eurydice_slice_len(inputs[0U], uint8_t); uint8_t blocks[1U][200U] = {{0U}}; d5247 6 a5252 28 if (self->buf_len > (size_t)0U) { Eurydice_slice uu____2 = Eurydice_array_to_subslice2( blocks[i0], (size_t)0U, self->buf_len, uint8_t); Eurydice_slice_copy(uu____2, Eurydice_array_to_subslice2(self->buf[i0], (size_t)0U, self->buf_len, uint8_t), uint8_t); } if (input_remainder_len > (size_t)0U) { Eurydice_slice uu____3 = Eurydice_array_to_subslice2( blocks[i0], self->buf_len, self->buf_len + input_remainder_len, uint8_t); Eurydice_slice_copy( uu____3, Eurydice_slice_subslice_from( inputs[i0], input_len - input_remainder_len, uint8_t, size_t), uint8_t); } blocks[i0][self->buf_len + input_remainder_len] = 31U; size_t uu____4 = i0; size_t uu____5 = (size_t)168U - (size_t)1U; blocks[uu____4][uu____5] = (uint32_t)blocks[uu____4][uu____5] | 128U; } uint64_t(*uu____6)[5U] = self->inner.st; uint8_t uu____7[1U][200U]; memcpy(uu____7, blocks, (size_t)1U * sizeof(uint8_t[200U])); libcrux_sha3_portable_keccak_load_block_full_5a_d21(uu____6, uu____7); libcrux_sha3_generic_keccak_keccakf1600_21(&self->inner); d5256 2 a5257 3 This function found in impl {(libcrux_sha3::portable::incremental::XofAbsorb<168: usize> for libcrux_sha3::portable::incremental::Shake128Absorb)} d5259 3 a5261 3 static inline libcrux_sha3_generic_keccak_KeccakXofState_78 libcrux_sha3_portable_incremental_absorb_final_1c( libcrux_sha3_generic_keccak_KeccakXofState_78 self, Eurydice_slice input) { d5263 1 a5263 2 libcrux_sha3_generic_keccak_absorb_final_9d_250(&self, buf); return self; d5267 3 a5269 5 An all zero block */ /** This function found in impl {libcrux_sha3::generic_keccak::KeccakXofState[TraitClause@@0]#2} d5272 1 a5272 1 A monomorphic instance of libcrux_sha3.generic_keccak.zero_block_9d d5278 1 a5278 1 static inline void libcrux_sha3_generic_keccak_zero_block_9d_e60( d5280 1 a5280 168 ret[0U] = 0U; ret[1U] = 0U; ret[2U] = 0U; ret[3U] = 0U; ret[4U] = 0U; ret[5U] = 0U; ret[6U] = 0U; ret[7U] = 0U; ret[8U] = 0U; ret[9U] = 0U; ret[10U] = 0U; ret[11U] = 0U; ret[12U] = 0U; ret[13U] = 0U; ret[14U] = 0U; ret[15U] = 0U; ret[16U] = 0U; ret[17U] = 0U; ret[18U] = 0U; ret[19U] = 0U; ret[20U] = 0U; ret[21U] = 0U; ret[22U] = 0U; ret[23U] = 0U; ret[24U] = 0U; ret[25U] = 0U; ret[26U] = 0U; ret[27U] = 0U; ret[28U] = 0U; ret[29U] = 0U; ret[30U] = 0U; ret[31U] = 0U; ret[32U] = 0U; ret[33U] = 0U; ret[34U] = 0U; ret[35U] = 0U; ret[36U] = 0U; ret[37U] = 0U; ret[38U] = 0U; ret[39U] = 0U; ret[40U] = 0U; ret[41U] = 0U; ret[42U] = 0U; ret[43U] = 0U; ret[44U] = 0U; ret[45U] = 0U; ret[46U] = 0U; ret[47U] = 0U; ret[48U] = 0U; ret[49U] = 0U; ret[50U] = 0U; ret[51U] = 0U; ret[52U] = 0U; ret[53U] = 0U; ret[54U] = 0U; ret[55U] = 0U; ret[56U] = 0U; ret[57U] = 0U; ret[58U] = 0U; ret[59U] = 0U; ret[60U] = 0U; ret[61U] = 0U; ret[62U] = 0U; ret[63U] = 0U; ret[64U] = 0U; ret[65U] = 0U; ret[66U] = 0U; ret[67U] = 0U; ret[68U] = 0U; ret[69U] = 0U; ret[70U] = 0U; ret[71U] = 0U; ret[72U] = 0U; ret[73U] = 0U; ret[74U] = 0U; ret[75U] = 0U; ret[76U] = 0U; ret[77U] = 0U; ret[78U] = 0U; ret[79U] = 0U; ret[80U] = 0U; ret[81U] = 0U; ret[82U] = 0U; ret[83U] = 0U; ret[84U] = 0U; ret[85U] = 0U; ret[86U] = 0U; ret[87U] = 0U; ret[88U] = 0U; ret[89U] = 0U; ret[90U] = 0U; ret[91U] = 0U; ret[92U] = 0U; ret[93U] = 0U; ret[94U] = 0U; ret[95U] = 0U; ret[96U] = 0U; ret[97U] = 0U; ret[98U] = 0U; ret[99U] = 0U; ret[100U] = 0U; ret[101U] = 0U; ret[102U] = 0U; ret[103U] = 0U; ret[104U] = 0U; ret[105U] = 0U; ret[106U] = 0U; ret[107U] = 0U; ret[108U] = 0U; ret[109U] = 0U; ret[110U] = 0U; ret[111U] = 0U; ret[112U] = 0U; ret[113U] = 0U; ret[114U] = 0U; ret[115U] = 0U; ret[116U] = 0U; ret[117U] = 0U; ret[118U] = 0U; ret[119U] = 0U; ret[120U] = 0U; ret[121U] = 0U; ret[122U] = 0U; ret[123U] = 0U; ret[124U] = 0U; ret[125U] = 0U; ret[126U] = 0U; ret[127U] = 0U; ret[128U] = 0U; ret[129U] = 0U; ret[130U] = 0U; ret[131U] = 0U; ret[132U] = 0U; ret[133U] = 0U; ret[134U] = 0U; ret[135U] = 0U; ret[136U] = 0U; ret[137U] = 0U; ret[138U] = 0U; ret[139U] = 0U; ret[140U] = 0U; ret[141U] = 0U; ret[142U] = 0U; ret[143U] = 0U; ret[144U] = 0U; ret[145U] = 0U; ret[146U] = 0U; ret[147U] = 0U; ret[148U] = 0U; ret[149U] = 0U; ret[150U] = 0U; ret[151U] = 0U; ret[152U] = 0U; ret[153U] = 0U; ret[154U] = 0U; ret[155U] = 0U; ret[156U] = 0U; ret[157U] = 0U; ret[158U] = 0U; ret[159U] = 0U; ret[160U] = 0U; ret[161U] = 0U; ret[162U] = 0U; ret[163U] = 0U; ret[164U] = 0U; ret[165U] = 0U; ret[166U] = 0U; ret[167U] = 0U; d5284 3 a5286 1 Generate a new keccak xof state. d5289 1 a5289 5 This function found in impl {libcrux_sha3::generic_keccak::KeccakXofState[TraitClause@@0]#2} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.new_9d d5295 9 a5303 7 static inline libcrux_sha3_generic_keccak_KeccakXofState_78 libcrux_sha3_generic_keccak_new_9d_7e0(void) { libcrux_sha3_generic_keccak_KeccakXofState_78 lit; lit.inner = libcrux_sha3_generic_keccak_new_1e_f4(); uint8_t ret[168U]; libcrux_sha3_generic_keccak_zero_block_9d_e60(ret); memcpy(lit.buf[0U], ret, (size_t)168U * sizeof(uint8_t)); d5310 2 a5311 61 This function found in impl {(libcrux_sha3::portable::incremental::XofAbsorb<168: usize> for libcrux_sha3::portable::incremental::Shake128Absorb)} */ static inline libcrux_sha3_generic_keccak_KeccakXofState_78 libcrux_sha3_portable_incremental_new_1c(void) { return libcrux_sha3_generic_keccak_new_9d_7e0(); } /** `out` has the exact size we want here. It must be less than or equal to `RATE`. */ /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.store_5a with const generics - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_5a_1c( uint64_t (*state)[5U], Eurydice_slice out[1U]) { size_t num_full_blocks = Eurydice_slice_len(out[0U], uint8_t) / (size_t)8U; size_t last_block_len = Eurydice_slice_len(out[0U], uint8_t) % (size_t)8U; for (size_t i = (size_t)0U; i < num_full_blocks; i++) { size_t i0 = i; Eurydice_slice uu____0 = Eurydice_slice_subslice2( out[0U], i0 * (size_t)8U, i0 * (size_t)8U + (size_t)8U, uint8_t); uint8_t ret[8U]; core_num__u64_9__to_le_bytes(state[i0 / (size_t)5U][i0 % (size_t)5U], ret); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)8U, ret, uint8_t), uint8_t); } if (last_block_len != (size_t)0U) { Eurydice_slice uu____1 = Eurydice_slice_subslice2( out[0U], num_full_blocks * (size_t)8U, num_full_blocks * (size_t)8U + last_block_len, uint8_t); uint8_t ret[8U]; core_num__u64_9__to_le_bytes( state[num_full_blocks / (size_t)5U][num_full_blocks % (size_t)5U], ret); Eurydice_slice_copy( uu____1, Eurydice_array_to_subslice2(ret, (size_t)0U, last_block_len, uint8_t), uint8_t); } } /** Squeeze `N` x `LEN` bytes. */ /** This function found in impl {libcrux_sha3::generic_keccak::KeccakXofState[TraitClause@@0]#2} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_9d with types uint64_t with const generics - PARALLEL_LANES= 1 - RATE= 136 d5313 3 a5315 50 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_9d_96( libcrux_sha3_generic_keccak_KeccakXofState_4f *self, Eurydice_slice out[1U]) { if (self->sponge) { libcrux_sha3_generic_keccak_keccakf1600_21(&self->inner); } size_t out_len = Eurydice_slice_len(out[0U], uint8_t); size_t blocks = out_len / (size_t)136U; size_t last = out_len - out_len % (size_t)136U; size_t mid; if ((size_t)136U >= out_len) { mid = out_len; } else { mid = (size_t)136U; } Eurydice_slice_uint8_t_1size_t__x2 uu____0 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(out, mid); Eurydice_slice out00[1U]; memcpy(out00, uu____0.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice out_rest[1U]; memcpy(out_rest, uu____0.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_portable_keccak_store_5a_1c(self->inner.st, out00); core_ops_range_Range_b3 iter = core_iter_traits_collect___core__iter__traits__collect__IntoIterator_for_I__1__into_iter( (CLITERAL(core_ops_range_Range_b3){.start = (size_t)1U, .end = blocks}), core_ops_range_Range_b3, core_ops_range_Range_b3); while (true) { if (core_iter_range___core__iter__traits__iterator__Iterator_for_core__ops__range__Range_A___6__next( &iter, size_t, Option_b3) .tag == None) { break; } else { Eurydice_slice_uint8_t_1size_t__x2 uu____1 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(out_rest, (size_t)136U); Eurydice_slice out0[1U]; memcpy(out0, uu____1.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice tmp[1U]; memcpy(tmp, uu____1.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_keccakf1600_21(&self->inner); libcrux_sha3_portable_keccak_store_5a_1c(self->inner.st, out0); memcpy(out_rest, tmp, (size_t)1U * sizeof(Eurydice_slice)); } } if (last < out_len) { libcrux_sha3_generic_keccak_keccakf1600_21(&self->inner); libcrux_sha3_portable_keccak_store_5a_1c(self->inner.st, out_rest); } self->sponge = true; d5319 1 a5319 1 Shake256 squeeze d5323 2 a5324 54 {(libcrux_sha3::portable::incremental::XofSqueeze<136: usize> for libcrux_sha3::portable::incremental::Shake256Squeeze)#3} */ static inline void libcrux_sha3_portable_incremental_squeeze_8a( libcrux_sha3_generic_keccak_KeccakXofState_4f *self, Eurydice_slice out) { Eurydice_slice buf[1U] = {out}; libcrux_sha3_generic_keccak_squeeze_9d_96(self, buf); } /** `out` has the exact size we want here. It must be less than or equal to `RATE`. */ /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.store_5a with const generics - RATE= 168 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_5a_1c0( uint64_t (*state)[5U], Eurydice_slice out[1U]) { size_t num_full_blocks = Eurydice_slice_len(out[0U], uint8_t) / (size_t)8U; size_t last_block_len = Eurydice_slice_len(out[0U], uint8_t) % (size_t)8U; for (size_t i = (size_t)0U; i < num_full_blocks; i++) { size_t i0 = i; Eurydice_slice uu____0 = Eurydice_slice_subslice2( out[0U], i0 * (size_t)8U, i0 * (size_t)8U + (size_t)8U, uint8_t); uint8_t ret[8U]; core_num__u64_9__to_le_bytes(state[i0 / (size_t)5U][i0 % (size_t)5U], ret); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)8U, ret, uint8_t), uint8_t); } if (last_block_len != (size_t)0U) { Eurydice_slice uu____1 = Eurydice_slice_subslice2( out[0U], num_full_blocks * (size_t)8U, num_full_blocks * (size_t)8U + last_block_len, uint8_t); uint8_t ret[8U]; core_num__u64_9__to_le_bytes( state[num_full_blocks / (size_t)5U][num_full_blocks % (size_t)5U], ret); Eurydice_slice_copy( uu____1, Eurydice_array_to_subslice2(ret, (size_t)0U, last_block_len, uint8_t), uint8_t); } } /** Squeeze `N` x `LEN` bytes. */ /** This function found in impl {libcrux_sha3::generic_keccak::KeccakXofState[TraitClause@@0]#2} d5327 1 a5327 1 A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_9d a5329 1 - PARALLEL_LANES= 1 d5332 3 a5334 3 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_9d_960( libcrux_sha3_generic_keccak_KeccakXofState_78 *self, Eurydice_slice out[1U]) { d5336 1 a5336 10 libcrux_sha3_generic_keccak_keccakf1600_21(&self->inner); } size_t out_len = Eurydice_slice_len(out[0U], uint8_t); size_t blocks = out_len / (size_t)168U; size_t last = out_len - out_len % (size_t)168U; size_t mid; if ((size_t)168U >= out_len) { mid = out_len; } else { mid = (size_t)168U; d5338 5 a5342 17 Eurydice_slice_uint8_t_1size_t__x2 uu____0 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(out, mid); Eurydice_slice out00[1U]; memcpy(out00, uu____0.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice out_rest[1U]; memcpy(out_rest, uu____0.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_portable_keccak_store_5a_1c0(self->inner.st, out00); core_ops_range_Range_b3 iter = core_iter_traits_collect___core__iter__traits__collect__IntoIterator_for_I__1__into_iter( (CLITERAL(core_ops_range_Range_b3){.start = (size_t)1U, .end = blocks}), core_ops_range_Range_b3, core_ops_range_Range_b3); while (true) { if (core_iter_range___core__iter__traits__iterator__Iterator_for_core__ops__range__Range_A___6__next( &iter, size_t, Option_b3) .tag == None) { break; d5344 15 a5358 15 Eurydice_slice_uint8_t_1size_t__x2 uu____1 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(out_rest, (size_t)168U); Eurydice_slice out0[1U]; memcpy(out0, uu____1.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice tmp[1U]; memcpy(tmp, uu____1.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_keccakf1600_21(&self->inner); libcrux_sha3_portable_keccak_store_5a_1c0(self->inner.st, out0); memcpy(out_rest, tmp, (size_t)1U * sizeof(Eurydice_slice)); } } if (last < out_len) { libcrux_sha3_generic_keccak_keccakf1600_21(&self->inner); libcrux_sha3_portable_keccak_store_5a_1c0(self->inner.st, out_rest); a5359 1 self->sponge = true; d5366 2 a5367 3 This function found in impl {(libcrux_sha3::portable::incremental::XofSqueeze<168: usize> for libcrux_sha3::portable::incremental::Shake128Squeeze)#1} d5369 4 a5372 4 static inline void libcrux_sha3_portable_incremental_squeeze_10( libcrux_sha3_generic_keccak_KeccakXofState_78 *self, Eurydice_slice out) { Eurydice_slice buf[1U] = {out}; libcrux_sha3_generic_keccak_squeeze_9d_960(self, buf); d5376 2 a5377 2 This function found in impl {(core::clone::Clone for libcrux_sha3::portable::KeccakState)} d5379 3 a5381 3 static inline libcrux_sha3_generic_keccak_KeccakState_48 libcrux_sha3_portable_clone_3d( libcrux_sha3_generic_keccak_KeccakState_48 *self) { d5386 2 a5387 2 This function found in impl {(core::convert::From for u32)#1} d5389 1 a5389 2 static inline uint32_t libcrux_sha3_from_eb(libcrux_sha3_Algorithm v) { uint32_t uu____0; d5391 1 a5391 2 case libcrux_sha3_Sha224: { uu____0 = 1U; d5394 2 a5395 3 case libcrux_sha3_Sha256: { uu____0 = 2U; break; d5397 2 a5398 3 case libcrux_sha3_Sha384: { uu____0 = 3U; break; d5400 2 a5401 3 case libcrux_sha3_Sha512: { uu____0 = 4U; break; d5409 1 a5409 1 return uu____0; d5413 2 a5414 2 This function found in impl {(core::convert::From for libcrux_sha3::Algorithm)} d5416 1 a5416 2 static inline libcrux_sha3_Algorithm libcrux_sha3_from_2d(uint32_t v) { libcrux_sha3_Algorithm uu____0; a5418 1 uu____0 = libcrux_sha3_Sha224; d5422 1 a5422 2 uu____0 = libcrux_sha3_Sha256; break; d5425 1 a5425 2 uu____0 = libcrux_sha3_Sha384; break; d5428 1 a5428 2 uu____0 = libcrux_sha3_Sha512; break; d5436 1 a5436 1 return uu____0; a5438 8 typedef uint8_t libcrux_sha3_Sha3_512Digest[64U]; typedef uint8_t libcrux_sha3_Sha3_384Digest[48U]; typedef uint8_t libcrux_sha3_Sha3_256Digest[32U]; typedef uint8_t libcrux_sha3_Sha3_224Digest[28U]; d5443 2 a5444 2 #define __libcrux_sha3_portable_H_DEFINED #endif d5446 1 a5446 1 /* from libcrux/libcrux-ml-kem/cg/libcrux_mlkem768_portable.h */ d5448 1 a5448 1 * SPDX-FileCopyrightText: 2024 Cryspen Sarl d5453 5 a5457 5 * Charon: 6b5e110342a771a3e1c739b10294b1778e4be8b4 * Eurydice: 31be7d65ca5d6acdacfb33652e478d24dd85c1cb * Karamel: 3205d3365ea2790b02368f79fcee38e38d0b5908 * F*: a32b316e521fa4f239b610ec8f1d15e78d62cbe8-dirty * Libcrux: 4ad532b206174114dd4140b718e7794a28fc59ee d5460 3 a5462 2 #ifndef __libcrux_mlkem768_portable_H #define __libcrux_mlkem768_portable_H d5469 1 a5469 6 #define LIBCRUX_ML_KEM_HASH_FUNCTIONS_BLOCK_SIZE ((size_t)168U) #define LIBCRUX_ML_KEM_HASH_FUNCTIONS_THREE_BLOCKS \ (LIBCRUX_ML_KEM_HASH_FUNCTIONS_BLOCK_SIZE * (size_t)3U) static KRML_MUSTINLINE void libcrux_ml_kem_hash_functions_portable_G( d5477 1 a5477 1 static KRML_MUSTINLINE void libcrux_ml_kem_hash_functions_portable_H( a5484 9 #define LIBCRUX_ML_KEM_IND_CCA_ENCAPS_SEED_SIZE \ (LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE) #define LIBCRUX_ML_KEM_IND_CCA_KEY_GENERATION_SEED_SIZE \ (LIBCRUX_ML_KEM_CONSTANTS_CPA_PKE_KEY_GENERATION_SEED_SIZE + \ LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE) typedef uint8_t libcrux_ml_kem_ind_cca_MlKemSharedSecret[32U]; d5519 3 a5521 1 #define LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR ((size_t)16U) d5523 1 a5523 3 #define LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT \ (LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT / \ LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR) d5525 1 a5525 1 #define LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS ((int16_t)3329) d5530 2 d5544 1 a5544 1 Result_c0 dst; d5546 3 a5548 3 &dst, Eurydice_slice_subslice2(array, (size_t)0U, (size_t)16U, int16_t), Eurydice_slice, int16_t[16U]); unwrap_41_f9(dst, ret); d5554 2 a5555 2 This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} d5558 3 a5560 135 libcrux_ml_kem_vector_portable_from_i16_array_0d(Eurydice_slice array) { return libcrux_ml_kem_vector_portable_vector_type_from_i16_array(array); } typedef struct uint8_t_x11_s { uint8_t fst; uint8_t snd; uint8_t thd; uint8_t f3; uint8_t f4; uint8_t f5; uint8_t f6; uint8_t f7; uint8_t f8; uint8_t f9; uint8_t f10; } uint8_t_x11; static KRML_MUSTINLINE uint8_t_x11 libcrux_ml_kem_vector_portable_serialize_serialize_11_int(Eurydice_slice v) { uint8_t r0 = (uint8_t)Eurydice_slice_index(v, (size_t)0U, int16_t, int16_t *); uint8_t r1 = (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)1U, int16_t, int16_t *) & (int16_t)31) << 3U | (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)0U, int16_t, int16_t *) >> 8U); uint8_t r2 = (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)2U, int16_t, int16_t *) & (int16_t)3) << 6U | (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)1U, int16_t, int16_t *) >> 5U); uint8_t r3 = (uint8_t)(Eurydice_slice_index(v, (size_t)2U, int16_t, int16_t *) >> 2U & (int16_t)255); uint8_t r4 = (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)3U, int16_t, int16_t *) & (int16_t)127) << 1U | (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)2U, int16_t, int16_t *) >> 10U); uint8_t r5 = (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)4U, int16_t, int16_t *) & (int16_t)15) << 4U | (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)3U, int16_t, int16_t *) >> 7U); uint8_t r6 = (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)5U, int16_t, int16_t *) & (int16_t)1) << 7U | (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)4U, int16_t, int16_t *) >> 4U); uint8_t r7 = (uint8_t)(Eurydice_slice_index(v, (size_t)5U, int16_t, int16_t *) >> 1U & (int16_t)255); uint8_t r8 = (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)6U, int16_t, int16_t *) & (int16_t)63) << 2U | (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)5U, int16_t, int16_t *) >> 9U); uint8_t r9 = (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)7U, int16_t, int16_t *) & (int16_t)7) << 5U | (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)6U, int16_t, int16_t *) >> 6U); uint8_t r10 = (uint8_t)(Eurydice_slice_index(v, (size_t)7U, int16_t, int16_t *) >> 3U); return (CLITERAL(uint8_t_x11){.fst = r0, .snd = r1, .thd = r2, .f3 = r3, .f4 = r4, .f5 = r5, .f6 = r6, .f7 = r7, .f8 = r8, .f9 = r9, .f10 = r10}); } static KRML_MUSTINLINE void libcrux_ml_kem_vector_portable_serialize_serialize_11( libcrux_ml_kem_vector_portable_vector_type_PortableVector v, uint8_t ret[22U]) { uint8_t_x11 r0_10 = libcrux_ml_kem_vector_portable_serialize_serialize_11_int( Eurydice_array_to_subslice2(v.elements, (size_t)0U, (size_t)8U, int16_t)); uint8_t_x11 r11_21 = libcrux_ml_kem_vector_portable_serialize_serialize_11_int( Eurydice_array_to_subslice2(v.elements, (size_t)8U, (size_t)16U, int16_t)); uint8_t result[22U] = {0U}; result[0U] = r0_10.fst; result[1U] = r0_10.snd; result[2U] = r0_10.thd; result[3U] = r0_10.f3; result[4U] = r0_10.f4; result[5U] = r0_10.f5; result[6U] = r0_10.f6; result[7U] = r0_10.f7; result[8U] = r0_10.f8; result[9U] = r0_10.f9; result[10U] = r0_10.f10; result[11U] = r11_21.fst; result[12U] = r11_21.snd; result[13U] = r11_21.thd; result[14U] = r11_21.f3; result[15U] = r11_21.f4; result[16U] = r11_21.f5; result[17U] = r11_21.f6; result[18U] = r11_21.f7; result[19U] = r11_21.f8; result[20U] = r11_21.f9; result[21U] = r11_21.f10; memcpy(ret, result, (size_t)22U * sizeof(uint8_t)); } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline void libcrux_ml_kem_vector_portable_serialize_11_0d( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, uint8_t ret[22U]) { libcrux_ml_kem_vector_portable_serialize_serialize_11(a, ret); a5573 63 static KRML_MUSTINLINE int16_t_x8 libcrux_ml_kem_vector_portable_serialize_deserialize_11_int( Eurydice_slice bytes) { int16_t r0 = ((int16_t)Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *) & (int16_t)7) << 8U | (int16_t)Eurydice_slice_index(bytes, (size_t)0U, uint8_t, uint8_t *); int16_t r1 = ((int16_t)Eurydice_slice_index(bytes, (size_t)2U, uint8_t, uint8_t *) & (int16_t)63) << 5U | (int16_t)Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *) >> 3U; int16_t r2 = (((int16_t)Eurydice_slice_index(bytes, (size_t)4U, uint8_t, uint8_t *) & (int16_t)1) << 10U | (int16_t)Eurydice_slice_index(bytes, (size_t)3U, uint8_t, uint8_t *) << 2U) | (int16_t)Eurydice_slice_index(bytes, (size_t)2U, uint8_t, uint8_t *) >> 6U; int16_t r3 = ((int16_t)Eurydice_slice_index(bytes, (size_t)5U, uint8_t, uint8_t *) & (int16_t)15) << 7U | (int16_t)Eurydice_slice_index(bytes, (size_t)4U, uint8_t, uint8_t *) >> 1U; int16_t r4 = ((int16_t)Eurydice_slice_index(bytes, (size_t)6U, uint8_t, uint8_t *) & (int16_t)127) << 4U | (int16_t)Eurydice_slice_index(bytes, (size_t)5U, uint8_t, uint8_t *) >> 4U; int16_t r5 = (((int16_t)Eurydice_slice_index(bytes, (size_t)8U, uint8_t, uint8_t *) & (int16_t)3) << 9U | (int16_t)Eurydice_slice_index(bytes, (size_t)7U, uint8_t, uint8_t *) << 1U) | (int16_t)Eurydice_slice_index(bytes, (size_t)6U, uint8_t, uint8_t *) >> 7U; int16_t r6 = ((int16_t)Eurydice_slice_index(bytes, (size_t)9U, uint8_t, uint8_t *) & (int16_t)31) << 6U | (int16_t)Eurydice_slice_index(bytes, (size_t)8U, uint8_t, uint8_t *) >> 2U; int16_t r7 = (int16_t)Eurydice_slice_index(bytes, (size_t)10U, uint8_t, uint8_t *) << 3U | (int16_t)Eurydice_slice_index(bytes, (size_t)9U, uint8_t, uint8_t *) >> 5U; return (CLITERAL(int16_t_x8){.fst = r0, .snd = r1, .thd = r2, .f3 = r3, .f4 = r4, .f5 = r5, .f6 = r6, .f7 = r7}); } d5577 4 a5580 16 lit.elements[0U] = (int16_t)0; lit.elements[1U] = (int16_t)0; lit.elements[2U] = (int16_t)0; lit.elements[3U] = (int16_t)0; lit.elements[4U] = (int16_t)0; lit.elements[5U] = (int16_t)0; lit.elements[6U] = (int16_t)0; lit.elements[7U] = (int16_t)0; lit.elements[8U] = (int16_t)0; lit.elements[9U] = (int16_t)0; lit.elements[10U] = (int16_t)0; lit.elements[11U] = (int16_t)0; lit.elements[12U] = (int16_t)0; lit.elements[13U] = (int16_t)0; lit.elements[14U] = (int16_t)0; lit.elements[15U] = (int16_t)0; a5583 569 static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_serialize_deserialize_11(Eurydice_slice bytes) { int16_t_x8 v0_7 = libcrux_ml_kem_vector_portable_serialize_deserialize_11_int( Eurydice_slice_subslice2(bytes, (size_t)0U, (size_t)11U, uint8_t)); int16_t_x8 v8_15 = libcrux_ml_kem_vector_portable_serialize_deserialize_11_int( Eurydice_slice_subslice2(bytes, (size_t)11U, (size_t)22U, uint8_t)); libcrux_ml_kem_vector_portable_vector_type_PortableVector v = libcrux_ml_kem_vector_portable_vector_type_zero(); v.elements[0U] = v0_7.fst; v.elements[1U] = v0_7.snd; v.elements[2U] = v0_7.thd; v.elements[3U] = v0_7.f3; v.elements[4U] = v0_7.f4; v.elements[5U] = v0_7.f5; v.elements[6U] = v0_7.f6; v.elements[7U] = v0_7.f7; v.elements[8U] = v8_15.fst; v.elements[9U] = v8_15.snd; v.elements[10U] = v8_15.thd; v.elements[11U] = v8_15.f3; v.elements[12U] = v8_15.f4; v.elements[13U] = v8_15.f5; v.elements[14U] = v8_15.f6; v.elements[15U] = v8_15.f7; return v; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_deserialize_11_0d(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_serialize_deserialize_11(a); } static KRML_MUSTINLINE void libcrux_ml_kem_vector_portable_vector_type_to_i16_array( libcrux_ml_kem_vector_portable_vector_type_PortableVector x, int16_t ret[16U]) { memcpy(ret, x.elements, (size_t)16U * sizeof(int16_t)); } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline void libcrux_ml_kem_vector_portable_to_i16_array_0d( libcrux_ml_kem_vector_portable_vector_type_PortableVector x, int16_t ret[16U]) { libcrux_ml_kem_vector_portable_vector_type_to_i16_array(x, ret); } static const uint8_t libcrux_ml_kem_vector_rej_sample_table_REJECTION_SAMPLE_SHUFFLE_TABLE [256U][16U] = {{255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {6U, 7U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 6U, 7U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 6U, 7U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 6U, 7U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 6U, 7U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 6U, 7U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 6U, 7U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 6U, 7U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {8U, 9U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 8U, 9U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 8U, 9U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 8U, 9U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 8U, 9U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 8U, 9U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 8U, 9U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 8U, 9U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {6U, 7U, 8U, 9U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 6U, 7U, 8U, 9U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 6U, 7U, 8U, 9U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 6U, 7U, 8U, 9U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 6U, 7U, 8U, 9U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 6U, 7U, 8U, 9U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 255U, 255U, 255U, 255U, 255U, 255U}, {10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {6U, 7U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 6U, 7U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 6U, 7U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 6U, 7U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 6U, 7U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 6U, 7U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 6U, 7U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 6U, 7U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U}, {8U, 9U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 8U, 9U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 8U, 9U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 8U, 9U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 8U, 9U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 8U, 9U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 8U, 9U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 8U, 9U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U}, {6U, 7U, 8U, 9U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 6U, 7U, 8U, 9U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 6U, 7U, 8U, 9U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 6U, 7U, 8U, 9U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 6U, 7U, 8U, 9U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 6U, 7U, 8U, 9U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 10U, 11U, 255U, 255U, 255U, 255U}, {12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {6U, 7U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 6U, 7U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 6U, 7U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 6U, 7U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 6U, 7U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 6U, 7U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 6U, 7U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 6U, 7U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U}, {8U, 9U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 8U, 9U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 8U, 9U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 8U, 9U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 8U, 9U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 8U, 9U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 8U, 9U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 8U, 9U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U}, {6U, 7U, 8U, 9U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 6U, 7U, 8U, 9U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 6U, 7U, 8U, 9U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 6U, 7U, 8U, 9U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 6U, 7U, 8U, 9U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 6U, 7U, 8U, 9U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 12U, 13U, 255U, 255U, 255U, 255U}, {10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U}, {6U, 7U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 6U, 7U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 6U, 7U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 6U, 7U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 6U, 7U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 6U, 7U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 6U, 7U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 6U, 7U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U}, {8U, 9U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 8U, 9U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 8U, 9U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 8U, 9U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 8U, 9U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 8U, 9U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 8U, 9U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 8U, 9U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U}, {6U, 7U, 8U, 9U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 6U, 7U, 8U, 9U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 6U, 7U, 8U, 9U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 6U, 7U, 8U, 9U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U}, {4U, 5U, 6U, 7U, 8U, 9U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 6U, 7U, 8U, 9U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 10U, 11U, 12U, 13U, 255U, 255U}, {14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {6U, 7U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 6U, 7U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 6U, 7U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 6U, 7U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 6U, 7U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 6U, 7U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 6U, 7U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 6U, 7U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {8U, 9U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 8U, 9U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 8U, 9U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 8U, 9U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 8U, 9U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 8U, 9U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 8U, 9U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 8U, 9U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {6U, 7U, 8U, 9U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 6U, 7U, 8U, 9U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 6U, 7U, 8U, 9U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 6U, 7U, 8U, 9U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 6U, 7U, 8U, 9U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 6U, 7U, 8U, 9U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 14U, 15U, 255U, 255U, 255U, 255U}, {10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {6U, 7U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 6U, 7U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 6U, 7U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 6U, 7U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 6U, 7U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 6U, 7U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 6U, 7U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 6U, 7U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U}, {8U, 9U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 8U, 9U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 8U, 9U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 8U, 9U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 8U, 9U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 8U, 9U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 8U, 9U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 8U, 9U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U}, {6U, 7U, 8U, 9U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 6U, 7U, 8U, 9U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 6U, 7U, 8U, 9U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 6U, 7U, 8U, 9U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U}, {4U, 5U, 6U, 7U, 8U, 9U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 6U, 7U, 8U, 9U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 10U, 11U, 14U, 15U, 255U, 255U}, {12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {6U, 7U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 6U, 7U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 6U, 7U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 6U, 7U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 6U, 7U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 6U, 7U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 6U, 7U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 6U, 7U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U}, {8U, 9U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 8U, 9U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 8U, 9U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 8U, 9U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 8U, 9U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 8U, 9U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 8U, 9U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 8U, 9U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U}, {6U, 7U, 8U, 9U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 6U, 7U, 8U, 9U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 6U, 7U, 8U, 9U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 6U, 7U, 8U, 9U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U}, {4U, 5U, 6U, 7U, 8U, 9U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 6U, 7U, 8U, 9U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 12U, 13U, 14U, 15U, 255U, 255U}, {10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U}, {6U, 7U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 6U, 7U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 6U, 7U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 6U, 7U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U}, {4U, 5U, 6U, 7U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 6U, 7U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 6U, 7U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 6U, 7U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U}, {8U, 9U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 8U, 9U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 8U, 9U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 8U, 9U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U}, {4U, 5U, 8U, 9U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 8U, 9U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 8U, 9U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 8U, 9U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U}, {6U, 7U, 8U, 9U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 6U, 7U, 8U, 9U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U}, {2U, 3U, 6U, 7U, 8U, 9U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 6U, 7U, 8U, 9U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U}, {4U, 5U, 6U, 7U, 8U, 9U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 6U, 7U, 8U, 9U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U}, {2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 10U, 11U, 12U, 13U, 14U, 15U}}; d5585 2 a5586 2 This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} d5589 1 a5589 1 libcrux_ml_kem_vector_portable_ZERO_0d(void) { d5607 2 a5608 2 This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} d5611 1 a5611 1 libcrux_ml_kem_vector_portable_add_0d( d5631 2 a5632 2 This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} d5635 1 a5635 1 libcrux_ml_kem_vector_portable_sub_0d( d5643 1 a5643 1 libcrux_ml_kem_vector_portable_vector_type_PortableVector v, int16_t c) { d5648 1 a5648 1 v.elements[uu____0] = v.elements[uu____0] * c; d5650 1 a5650 1 return v; d5654 2 a5655 2 This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} d5658 3 a5660 3 libcrux_ml_kem_vector_portable_multiply_by_constant_0d( libcrux_ml_kem_vector_portable_vector_type_PortableVector v, int16_t c) { return libcrux_ml_kem_vector_portable_arithmetic_multiply_by_constant(v, c); d5663 4 d5668 2 a5669 2 libcrux_ml_kem_vector_portable_arithmetic_bitwise_and_with_constant( libcrux_ml_kem_vector_portable_vector_type_PortableVector v, int16_t c) { d5673 4 a5676 37 size_t uu____0 = i0; v.elements[uu____0] = v.elements[uu____0] & c; } return v; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_bitwise_and_with_constant_0d( libcrux_ml_kem_vector_portable_vector_type_PortableVector v, int16_t c) { return libcrux_ml_kem_vector_portable_arithmetic_bitwise_and_with_constant(v, c); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_arithmetic_cond_subtract_3329( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { core_ops_range_Range_b3 iter = core_iter_traits_collect___core__iter__traits__collect__IntoIterator_for_I__1__into_iter( (CLITERAL(core_ops_range_Range_b3){ .start = (size_t)0U, .end = LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR}), core_ops_range_Range_b3, core_ops_range_Range_b3); while (true) { Option_b3 uu____0 = core_iter_range___core__iter__traits__iterator__Iterator_for_core__ops__range__Range_A___6__next( &iter, size_t, Option_b3); if (!(uu____0.tag == None)) { size_t i = uu____0.f0; if (v.elements[i] >= (int16_t)3329) { size_t uu____1 = i; v.elements[uu____1] = v.elements[uu____1] - (int16_t)3329; } continue; a5677 1 return v; d5679 1 d5683 2 a5684 2 This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} d5687 1 a5687 1 libcrux_ml_kem_vector_portable_cond_subtract_3329_0d( d5695 1 a5695 1 #define LIBCRUX_ML_KEM_VECTOR_PORTABLE_ARITHMETIC_BARRETT_SHIFT ((int32_t)26) d5697 2 a5698 3 #define LIBCRUX_ML_KEM_VECTOR_PORTABLE_ARITHMETIC_BARRETT_R \ ((int32_t)1 << (uint32_t) \ LIBCRUX_ML_KEM_VECTOR_PORTABLE_ARITHMETIC_BARRETT_SHIFT) d5711 3 a5713 1 In particular, if `|value| < BARRETT_R`, then `|result| < FIELD_MODULUS`. d5718 1 a5718 1 int32_t t = (int32_t)value * d5720 3 a5722 5 (LIBCRUX_ML_KEM_VECTOR_PORTABLE_ARITHMETIC_BARRETT_R >> 1U); int16_t quotient = (int16_t)(t >> (uint32_t) LIBCRUX_ML_KEM_VECTOR_PORTABLE_ARITHMETIC_BARRETT_SHIFT); d5728 1 a5728 1 libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { d5732 1 a5732 1 v.elements[i0] = d5734 2 a5735 1 v.elements[i0]); d5737 1 a5737 1 return v; d5741 2 a5742 2 This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} d5745 3 a5747 3 libcrux_ml_kem_vector_portable_barrett_reduce_0d( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { return libcrux_ml_kem_vector_portable_arithmetic_barrett_reduce(v); a5751 4 #define LIBCRUX_ML_KEM_VECTOR_PORTABLE_ARITHMETIC_MONTGOMERY_R \ ((int32_t)1 << (uint32_t) \ LIBCRUX_ML_KEM_VECTOR_PORTABLE_ARITHMETIC_MONTGOMERY_SHIFT) d5761 5 a5765 1 `|result| ≤ (|value| / MONTGOMERY_R) + (FIELD_MODULUS / 2) a5766 2 In particular, if `|value| ≤ FIELD_MODULUS * MONTGOMERY_R`, then `|o| < (3 · FIELD_MODULUS) / 2`. d5772 4 a5775 2 (int32_t)(int16_t)value * (int32_t)LIBCRUX_ML_KEM_VECTOR_TRAITS_INVERSE_OF_MODULUS_MOD_MONTGOMERY_R; d5777 10 a5786 9 (int32_t)(int16_t)k * (int32_t)LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS; int16_t c = (int16_t)(k_times_modulus >> (uint32_t) LIBCRUX_ML_KEM_VECTOR_PORTABLE_ARITHMETIC_MONTGOMERY_SHIFT); int16_t value_high = (int16_t)(value >> (uint32_t) LIBCRUX_ML_KEM_VECTOR_PORTABLE_ARITHMETIC_MONTGOMERY_SHIFT); d5804 2 d5807 1 a5807 1 (int32_t)fe * (int32_t)fer); d5812 1 a5812 1 libcrux_ml_kem_vector_portable_vector_type_PortableVector v, int16_t c) { d5816 1 a5816 1 v.elements[i0] = d5818 1 a5818 1 v.elements[i0], c); d5820 1 a5820 1 return v; d5824 2 a5825 2 This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} d5828 3 a5830 2 libcrux_ml_kem_vector_portable_montgomery_multiply_by_constant_0d( libcrux_ml_kem_vector_portable_vector_type_PortableVector v, int16_t r) { d5832 51 a5882 1 v, r); d5910 3 a5912 1 int16_t shifted = (int16_t)1664 - (int16_t)fe; d5916 3 a5918 1 return (uint8_t)(shifted_positive_in_range >> 15U & (int16_t)1); d5923 1 a5923 1 libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { d5927 1 a5927 1 v.elements[i0] = (int16_t) d5929 1 a5929 1 (uint16_t)v.elements[i0]); d5931 1 a5931 1 return v; d5935 2 a5936 2 This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} d5939 3 a5941 3 libcrux_ml_kem_vector_portable_compress_1_0d( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { return libcrux_ml_kem_vector_portable_compress_compress_1(v); d5953 2 a5954 1 uint64_t compressed = (uint64_t)fe << (uint32_t)coefficient_bits; d5958 1 a5958 1 return (int16_t) d5960 24 a5983 1 coefficient_bits, (uint32_t)compressed); d5987 2 a5988 2 libcrux_ml_kem_vector_portable_vector_type_PortableVector *v, int16_t zeta, size_t i, size_t j) { d5991 6 a5996 3 v->elements[j], zeta); v->elements[j] = v->elements[i] - t; v->elements[i] = v->elements[i] + t; d6001 3 a6003 3 libcrux_ml_kem_vector_portable_vector_type_PortableVector v, int16_t zeta0, int16_t zeta1, int16_t zeta2, int16_t zeta3) { libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta0, (size_t)0U, d6005 1 a6005 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta0, (size_t)1U, d6007 1 a6007 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta1, (size_t)4U, d6009 1 a6009 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta1, (size_t)5U, d6011 1 a6011 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta2, (size_t)8U, d6013 1 a6013 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta2, (size_t)9U, d6015 1 a6015 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta3, (size_t)12U, d6017 1 a6017 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta3, (size_t)13U, d6019 1 a6019 1 return v; d6023 2 a6024 2 This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} d6027 1 a6027 1 libcrux_ml_kem_vector_portable_ntt_layer_1_step_0d( d6036 3 a6038 3 libcrux_ml_kem_vector_portable_vector_type_PortableVector v, int16_t zeta0, int16_t zeta1) { libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta0, (size_t)0U, d6040 1 a6040 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta0, (size_t)1U, d6042 1 a6042 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta0, (size_t)2U, d6044 1 a6044 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta0, (size_t)3U, d6046 1 a6046 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta1, (size_t)8U, d6048 1 a6048 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta1, (size_t)9U, d6050 1 a6050 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta1, (size_t)10U, d6052 1 a6052 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta1, (size_t)11U, d6054 1 a6054 1 return v; d6058 2 a6059 2 This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} d6062 1 a6062 1 libcrux_ml_kem_vector_portable_ntt_layer_2_step_0d( d6070 7 a6076 4 libcrux_ml_kem_vector_portable_vector_type_PortableVector v, int16_t zeta) { libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta, (size_t)0U, (size_t)8U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta, (size_t)1U, (size_t)9U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta, (size_t)2U, d6078 1 a6078 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta, (size_t)3U, d6080 1 a6080 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta, (size_t)4U, d6082 1 a6082 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta, (size_t)5U, d6084 1 a6084 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta, (size_t)6U, d6086 1 a6086 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta, (size_t)7U, d6088 1 a6088 1 return v; d6092 2 a6093 2 This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} d6096 1 a6096 1 libcrux_ml_kem_vector_portable_ntt_layer_3_step_0d( d6102 7 a6108 7 libcrux_ml_kem_vector_portable_vector_type_PortableVector *v, int16_t zeta, size_t i, size_t j) { int16_t a_minus_b = v->elements[j] - v->elements[i]; v->elements[i] = libcrux_ml_kem_vector_portable_arithmetic_barrett_reduce_element( v->elements[i] + v->elements[j]); v->elements[j] = d6110 3 a6112 1 a_minus_b, zeta); d6117 3 a6119 3 libcrux_ml_kem_vector_portable_vector_type_PortableVector v, int16_t zeta0, int16_t zeta1, int16_t zeta2, int16_t zeta3) { libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta0, (size_t)0U, d6121 1 a6121 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta0, (size_t)1U, d6123 1 a6123 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta1, (size_t)4U, d6125 1 a6125 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta1, (size_t)5U, d6127 1 a6127 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta2, (size_t)8U, d6129 1 a6129 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta2, (size_t)9U, d6131 1 a6131 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta3, (size_t)12U, d6133 1 a6133 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta3, (size_t)13U, d6135 1 a6135 1 return v; d6139 2 a6140 2 This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} d6143 1 a6143 1 libcrux_ml_kem_vector_portable_inv_ntt_layer_1_step_0d( d6152 3 a6154 3 libcrux_ml_kem_vector_portable_vector_type_PortableVector v, int16_t zeta0, int16_t zeta1) { libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta0, (size_t)0U, d6156 1 a6156 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta0, (size_t)1U, d6158 1 a6158 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta0, (size_t)2U, d6160 1 a6160 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta0, (size_t)3U, d6162 1 a6162 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta1, (size_t)8U, d6164 1 a6164 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta1, (size_t)9U, d6166 1 a6166 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta1, (size_t)10U, d6168 1 a6168 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta1, (size_t)11U, d6170 1 a6170 1 return v; d6174 2 a6175 2 This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} d6178 1 a6178 1 libcrux_ml_kem_vector_portable_inv_ntt_layer_2_step_0d( d6187 3 a6189 2 libcrux_ml_kem_vector_portable_vector_type_PortableVector v, int16_t zeta) { libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta, (size_t)0U, d6191 1 a6191 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta, (size_t)1U, d6193 1 a6193 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta, (size_t)2U, d6195 1 a6195 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta, (size_t)3U, d6197 1 a6197 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta, (size_t)4U, d6199 1 a6199 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta, (size_t)5U, d6201 1 a6201 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta, (size_t)6U, d6203 1 a6203 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta, (size_t)7U, d6205 1 a6205 1 return v; d6209 2 a6210 2 This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} d6213 1 a6213 1 libcrux_ml_kem_vector_portable_inv_ntt_layer_3_step_0d( d6244 23 a6266 8 size_t i, size_t j, libcrux_ml_kem_vector_portable_vector_type_PortableVector *out) { int16_t o0 = libcrux_ml_kem_vector_portable_arithmetic_montgomery_reduce_element( (int32_t)a->elements[i] * (int32_t)b->elements[i] + (int32_t) libcrux_ml_kem_vector_portable_arithmetic_montgomery_reduce_element( (int32_t)a->elements[j] * (int32_t)b->elements[j]) * (int32_t)zeta); d6269 3 a6271 4 (int32_t)a->elements[i] * (int32_t)b->elements[j] + (int32_t)a->elements[j] * (int32_t)b->elements[i]); out->elements[i] = o0; out->elements[j] = o1; d6279 4 d6286 2 a6287 1 lhs, rhs, zeta0, (size_t)0U, (size_t)1U, &out); d6289 2 a6290 1 lhs, rhs, -zeta0, (size_t)2U, (size_t)3U, &out); d6292 2 a6293 1 lhs, rhs, zeta1, (size_t)4U, (size_t)5U, &out); d6295 2 a6296 1 lhs, rhs, -zeta1, (size_t)6U, (size_t)7U, &out); d6298 2 a6299 1 lhs, rhs, zeta2, (size_t)8U, (size_t)9U, &out); d6301 2 a6302 1 lhs, rhs, -zeta2, (size_t)10U, (size_t)11U, &out); d6304 2 a6305 1 lhs, rhs, zeta3, (size_t)12U, (size_t)13U, &out); d6307 2 a6308 1 lhs, rhs, -zeta3, (size_t)14U, (size_t)15U, &out); d6313 2 a6314 2 This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} d6317 1 a6317 1 libcrux_ml_kem_vector_portable_ntt_multiply_0d( d6329 28 a6356 15 uint8_t result[2U] = {0U}; for (size_t i = (size_t)0U; i < (size_t)8U; i++) { size_t i0 = i; size_t uu____0 = (size_t)0U; result[uu____0] = (uint32_t)result[uu____0] | (uint32_t)(uint8_t)v.elements[i0] << (uint32_t)i0; } for (size_t i = (size_t)8U; i < (size_t)16U; i++) { size_t i0 = i; size_t uu____1 = (size_t)1U; result[uu____1] = (uint32_t)result[uu____1] | (uint32_t)(uint8_t)v.elements[i0] << (uint32_t)(i0 - (size_t)8U); } memcpy(ret, result, (size_t)2U * sizeof(uint8_t)); d6360 2 a6361 2 This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} d6363 1 a6363 1 static inline void libcrux_ml_kem_vector_portable_serialize_1_0d( d6366 1 a6366 1 libcrux_ml_kem_vector_portable_serialize_serialize_1(a, ret); d6371 57 a6427 18 libcrux_ml_kem_vector_portable_vector_type_PortableVector result = libcrux_ml_kem_vector_portable_vector_type_zero(); for (size_t i = (size_t)0U; i < (size_t)8U; i++) { size_t i0 = i; result.elements[i0] = (int16_t)((uint32_t)Eurydice_slice_index( v, (size_t)0U, uint8_t, uint8_t *) >> (uint32_t)i0 & 1U); } for (size_t i = (size_t)8U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; result.elements[i0] = (int16_t)((uint32_t)Eurydice_slice_index( v, (size_t)1U, uint8_t, uint8_t *) >> (uint32_t)(i0 - (size_t)8U) & 1U); } return result; d6431 2 a6432 2 This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} d6435 2 a6436 2 libcrux_ml_kem_vector_portable_deserialize_1_0d(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_serialize_deserialize_1(a); d6448 21 a6468 21 uint8_t result0 = (uint32_t)(uint8_t)Eurydice_slice_index(v, (size_t)1U, int16_t, int16_t *) << 4U | (uint32_t)(uint8_t)Eurydice_slice_index(v, (size_t)0U, int16_t, int16_t *); uint8_t result1 = (uint32_t)(uint8_t)Eurydice_slice_index(v, (size_t)3U, int16_t, int16_t *) << 4U | (uint32_t)(uint8_t)Eurydice_slice_index(v, (size_t)2U, int16_t, int16_t *); uint8_t result2 = (uint32_t)(uint8_t)Eurydice_slice_index(v, (size_t)5U, int16_t, int16_t *) << 4U | (uint32_t)(uint8_t)Eurydice_slice_index(v, (size_t)4U, int16_t, int16_t *); uint8_t result3 = (uint32_t)(uint8_t)Eurydice_slice_index(v, (size_t)7U, int16_t, int16_t *) << 4U | (uint32_t)(uint8_t)Eurydice_slice_index(v, (size_t)6U, int16_t, int16_t *); return (CLITERAL(uint8_t_x4){ d6478 2 a6479 2 Eurydice_array_to_subslice2(v.elements, (size_t)0U, (size_t)8U, int16_t)); d6482 18 a6499 12 Eurydice_array_to_subslice2(v.elements, (size_t)8U, (size_t)16U, int16_t)); uint8_t result[8U] = {0U}; result[0U] = result0_3.fst; result[1U] = result0_3.snd; result[2U] = result0_3.thd; result[3U] = result0_3.f3; result[4U] = result4_7.fst; result[5U] = result4_7.snd; result[6U] = result4_7.thd; result[7U] = result4_7.f3; memcpy(ret, result, (size_t)8U * sizeof(uint8_t)); d6503 2 a6504 2 This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} d6506 1 a6506 1 static inline void libcrux_ml_kem_vector_portable_serialize_4_0d( d6509 1 a6509 1 libcrux_ml_kem_vector_portable_serialize_serialize_4(a, ret); d6515 36 a6550 36 int16_t v0 = (int16_t)((uint32_t)Eurydice_slice_index(bytes, (size_t)0U, uint8_t, uint8_t *) & 15U); int16_t v1 = (int16_t)((uint32_t)Eurydice_slice_index(bytes, (size_t)0U, uint8_t, uint8_t *) >> 4U & 15U); int16_t v2 = (int16_t)((uint32_t)Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *) & 15U); int16_t v3 = (int16_t)((uint32_t)Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *) >> 4U & 15U); int16_t v4 = (int16_t)((uint32_t)Eurydice_slice_index(bytes, (size_t)2U, uint8_t, uint8_t *) & 15U); int16_t v5 = (int16_t)((uint32_t)Eurydice_slice_index(bytes, (size_t)2U, uint8_t, uint8_t *) >> 4U & 15U); int16_t v6 = (int16_t)((uint32_t)Eurydice_slice_index(bytes, (size_t)3U, uint8_t, uint8_t *) & 15U); int16_t v7 = (int16_t)((uint32_t)Eurydice_slice_index(bytes, (size_t)3U, uint8_t, uint8_t *) >> 4U & 15U); return (CLITERAL(int16_t_x8){.fst = v0, .snd = v1, .thd = v2, .f3 = v3, .f4 = v4, .f5 = v5, .f6 = v6, .f7 = v7}); d6556 1 a6556 1 Eurydice_slice_subslice2(bytes, (size_t)0U, (size_t)4U, uint8_t)); d6558 12 a6569 20 Eurydice_slice_subslice2(bytes, (size_t)4U, (size_t)8U, uint8_t)); libcrux_ml_kem_vector_portable_vector_type_PortableVector v = libcrux_ml_kem_vector_portable_vector_type_zero(); v.elements[0U] = v0_7.fst; v.elements[1U] = v0_7.snd; v.elements[2U] = v0_7.thd; v.elements[3U] = v0_7.f3; v.elements[4U] = v0_7.f4; v.elements[5U] = v0_7.f5; v.elements[6U] = v0_7.f6; v.elements[7U] = v0_7.f7; v.elements[8U] = v8_15.fst; v.elements[9U] = v8_15.snd; v.elements[10U] = v8_15.thd; v.elements[11U] = v8_15.f3; v.elements[12U] = v8_15.f4; v.elements[13U] = v8_15.f5; v.elements[14U] = v8_15.f6; v.elements[15U] = v8_15.f7; return v; d6573 2 a6574 2 This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} d6577 2 a6578 2 libcrux_ml_kem_vector_portable_deserialize_4_0d(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_serialize_deserialize_4(a); d6590 3 a6592 4 libcrux_ml_kem_vector_portable_serialize_serialize_5_int(Eurydice_slice v) { uint8_t r0 = (uint8_t)(Eurydice_slice_index(v, (size_t)0U, int16_t, int16_t *) | Eurydice_slice_index(v, (size_t)1U, int16_t, int16_t *) << 5U); d6594 6 a6599 4 (uint8_t)((Eurydice_slice_index(v, (size_t)1U, int16_t, int16_t *) >> 3U | Eurydice_slice_index(v, (size_t)2U, int16_t, int16_t *) << 2U) | Eurydice_slice_index(v, (size_t)3U, int16_t, int16_t *) << 7U); d6601 6 a6606 2 (uint8_t)(Eurydice_slice_index(v, (size_t)3U, int16_t, int16_t *) >> 1U | Eurydice_slice_index(v, (size_t)4U, int16_t, int16_t *) << 4U); d6608 10 a6617 165 (uint8_t)((Eurydice_slice_index(v, (size_t)4U, int16_t, int16_t *) >> 4U | Eurydice_slice_index(v, (size_t)5U, int16_t, int16_t *) << 1U) | Eurydice_slice_index(v, (size_t)6U, int16_t, int16_t *) << 6U); uint8_t r4 = (uint8_t)(Eurydice_slice_index(v, (size_t)6U, int16_t, int16_t *) >> 2U | Eurydice_slice_index(v, (size_t)7U, int16_t, int16_t *) << 3U); return (CLITERAL(uint8_t_x5){ .fst = r0, .snd = r1, .thd = r2, .f3 = r3, .f4 = r4}); } static KRML_MUSTINLINE void libcrux_ml_kem_vector_portable_serialize_serialize_5( libcrux_ml_kem_vector_portable_vector_type_PortableVector v, uint8_t ret[10U]) { uint8_t_x5 r0_4 = libcrux_ml_kem_vector_portable_serialize_serialize_5_int( Eurydice_array_to_subslice2(v.elements, (size_t)0U, (size_t)8U, int16_t)); uint8_t_x5 r5_9 = libcrux_ml_kem_vector_portable_serialize_serialize_5_int( Eurydice_array_to_subslice2(v.elements, (size_t)8U, (size_t)16U, int16_t)); uint8_t result[10U] = {0U}; result[0U] = r0_4.fst; result[1U] = r0_4.snd; result[2U] = r0_4.thd; result[3U] = r0_4.f3; result[4U] = r0_4.f4; result[5U] = r5_9.fst; result[6U] = r5_9.snd; result[7U] = r5_9.thd; result[8U] = r5_9.f3; result[9U] = r5_9.f4; memcpy(ret, result, (size_t)10U * sizeof(uint8_t)); } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline void libcrux_ml_kem_vector_portable_serialize_5_0d( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, uint8_t ret[10U]) { libcrux_ml_kem_vector_portable_serialize_serialize_5(a, ret); } static KRML_MUSTINLINE int16_t_x8 libcrux_ml_kem_vector_portable_serialize_deserialize_5_int( Eurydice_slice bytes) { int16_t v0 = (int16_t)((uint32_t)Eurydice_slice_index(bytes, (size_t)0U, uint8_t, uint8_t *) & 31U); int16_t v1 = (int16_t)(((uint32_t)Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *) & 3U) << 3U | (uint32_t)Eurydice_slice_index(bytes, (size_t)0U, uint8_t, uint8_t *) >> 5U); int16_t v2 = (int16_t)((uint32_t)Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *) >> 2U & 31U); int16_t v3 = (int16_t)(((uint32_t)Eurydice_slice_index(bytes, (size_t)2U, uint8_t, uint8_t *) & 15U) << 1U | (uint32_t)Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *) >> 7U); int16_t v4 = (int16_t)(((uint32_t)Eurydice_slice_index(bytes, (size_t)3U, uint8_t, uint8_t *) & 1U) << 4U | (uint32_t)Eurydice_slice_index(bytes, (size_t)2U, uint8_t, uint8_t *) >> 4U); int16_t v5 = (int16_t)((uint32_t)Eurydice_slice_index(bytes, (size_t)3U, uint8_t, uint8_t *) >> 1U & 31U); int16_t v6 = (int16_t)(((uint32_t)Eurydice_slice_index(bytes, (size_t)4U, uint8_t, uint8_t *) & 7U) << 2U | (uint32_t)Eurydice_slice_index(bytes, (size_t)3U, uint8_t, uint8_t *) >> 6U); int16_t v7 = (int16_t)((uint32_t)Eurydice_slice_index(bytes, (size_t)4U, uint8_t, uint8_t *) >> 3U); return (CLITERAL(int16_t_x8){.fst = v0, .snd = v1, .thd = v2, .f3 = v3, .f4 = v4, .f5 = v5, .f6 = v6, .f7 = v7}); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_serialize_deserialize_5(Eurydice_slice bytes) { int16_t_x8 v0_7 = libcrux_ml_kem_vector_portable_serialize_deserialize_5_int( Eurydice_slice_subslice2(bytes, (size_t)0U, (size_t)5U, uint8_t)); int16_t_x8 v8_15 = libcrux_ml_kem_vector_portable_serialize_deserialize_5_int( Eurydice_slice_subslice2(bytes, (size_t)5U, (size_t)10U, uint8_t)); libcrux_ml_kem_vector_portable_vector_type_PortableVector v = libcrux_ml_kem_vector_portable_vector_type_zero(); v.elements[0U] = v0_7.fst; v.elements[1U] = v0_7.snd; v.elements[2U] = v0_7.thd; v.elements[3U] = v0_7.f3; v.elements[4U] = v0_7.f4; v.elements[5U] = v0_7.f5; v.elements[6U] = v0_7.f6; v.elements[7U] = v0_7.f7; v.elements[8U] = v8_15.fst; v.elements[9U] = v8_15.snd; v.elements[10U] = v8_15.thd; v.elements[11U] = v8_15.f3; v.elements[12U] = v8_15.f4; v.elements[13U] = v8_15.f5; v.elements[14U] = v8_15.f6; v.elements[15U] = v8_15.f7; return v; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_deserialize_5_0d(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_serialize_deserialize_5(a); } static KRML_MUSTINLINE uint8_t_x5 libcrux_ml_kem_vector_portable_serialize_serialize_10_int(Eurydice_slice v) { uint8_t r0 = (uint8_t)(Eurydice_slice_index(v, (size_t)0U, int16_t, int16_t *) & (int16_t)255); uint8_t r1 = (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)1U, int16_t, int16_t *) & (int16_t)63) << 2U | (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)0U, int16_t, int16_t *) >> 8U & (int16_t)3); uint8_t r2 = (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)2U, int16_t, int16_t *) & (int16_t)15) << 4U | (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)1U, int16_t, int16_t *) >> 6U & (int16_t)15); uint8_t r3 = (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)3U, int16_t, int16_t *) & (int16_t)3) << 6U | (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)2U, int16_t, int16_t *) >> 4U & (int16_t)63); uint8_t r4 = (uint8_t)(Eurydice_slice_index(v, (size_t)3U, int16_t, int16_t *) >> 2U & (int16_t)255); return (CLITERAL(uint8_t_x5){ d6626 2 a6627 1 Eurydice_array_to_subslice2(v.elements, (size_t)0U, (size_t)4U, int16_t)); d6629 2 a6630 1 Eurydice_array_to_subslice2(v.elements, (size_t)4U, (size_t)8U, int16_t)); d6632 2 a6633 2 Eurydice_array_to_subslice2(v.elements, (size_t)8U, (size_t)12U, int16_t)); d6635 30 a6664 24 Eurydice_array_to_subslice2(v.elements, (size_t)12U, (size_t)16U, int16_t)); uint8_t result[20U] = {0U}; result[0U] = r0_4.fst; result[1U] = r0_4.snd; result[2U] = r0_4.thd; result[3U] = r0_4.f3; result[4U] = r0_4.f4; result[5U] = r5_9.fst; result[6U] = r5_9.snd; result[7U] = r5_9.thd; result[8U] = r5_9.f3; result[9U] = r5_9.f4; result[10U] = r10_14.fst; result[11U] = r10_14.snd; result[12U] = r10_14.thd; result[13U] = r10_14.f3; result[14U] = r10_14.f4; result[15U] = r15_19.fst; result[16U] = r15_19.snd; result[17U] = r15_19.thd; result[18U] = r15_19.f3; result[19U] = r15_19.f4; memcpy(ret, result, (size_t)20U * sizeof(uint8_t)); d6668 2 a6669 2 This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} d6671 1 a6671 1 static inline void libcrux_ml_kem_vector_portable_serialize_10_0d( d6674 1 a6674 1 libcrux_ml_kem_vector_portable_serialize_serialize_10(a, ret); d6680 3 a6682 2 int16_t r0 = ((int16_t)Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *) & d6685 6 a6690 4 ((int16_t)Eurydice_slice_index(bytes, (size_t)0U, uint8_t, uint8_t *) & (int16_t)255); int16_t r1 = ((int16_t)Eurydice_slice_index(bytes, (size_t)2U, uint8_t, uint8_t *) & d6693 6 a6698 4 (int16_t)Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *) >> 2U; int16_t r2 = ((int16_t)Eurydice_slice_index(bytes, (size_t)3U, uint8_t, uint8_t *) & d6701 6 a6706 4 (int16_t)Eurydice_slice_index(bytes, (size_t)2U, uint8_t, uint8_t *) >> 4U; int16_t r3 = (int16_t)Eurydice_slice_index(bytes, (size_t)4U, uint8_t, uint8_t *) d6708 6 a6713 4 (int16_t)Eurydice_slice_index(bytes, (size_t)3U, uint8_t, uint8_t *) >> 6U; int16_t r4 = ((int16_t)Eurydice_slice_index(bytes, (size_t)6U, uint8_t, uint8_t *) & d6716 6 a6721 4 ((int16_t)Eurydice_slice_index(bytes, (size_t)5U, uint8_t, uint8_t *) & (int16_t)255); int16_t r5 = ((int16_t)Eurydice_slice_index(bytes, (size_t)7U, uint8_t, uint8_t *) & d6724 6 a6729 4 (int16_t)Eurydice_slice_index(bytes, (size_t)6U, uint8_t, uint8_t *) >> 2U; int16_t r6 = ((int16_t)Eurydice_slice_index(bytes, (size_t)8U, uint8_t, uint8_t *) & d6732 6 a6737 4 (int16_t)Eurydice_slice_index(bytes, (size_t)7U, uint8_t, uint8_t *) >> 4U; int16_t r7 = (int16_t)Eurydice_slice_index(bytes, (size_t)9U, uint8_t, uint8_t *) d6739 11 a6749 10 (int16_t)Eurydice_slice_index(bytes, (size_t)8U, uint8_t, uint8_t *) >> 6U; return (CLITERAL(int16_t_x8){.fst = r0, .snd = r1, .thd = r2, .f3 = r3, .f4 = r4, .f5 = r5, .f6 = r6, .f7 = r7}); d6755 1 a6755 1 Eurydice_slice_subslice2(bytes, (size_t)0U, (size_t)10U, uint8_t)); d6758 12 a6769 20 Eurydice_slice_subslice2(bytes, (size_t)10U, (size_t)20U, uint8_t)); libcrux_ml_kem_vector_portable_vector_type_PortableVector v = libcrux_ml_kem_vector_portable_vector_type_zero(); v.elements[0U] = v0_7.fst; v.elements[1U] = v0_7.snd; v.elements[2U] = v0_7.thd; v.elements[3U] = v0_7.f3; v.elements[4U] = v0_7.f4; v.elements[5U] = v0_7.f5; v.elements[6U] = v0_7.f6; v.elements[7U] = v0_7.f7; v.elements[8U] = v8_15.fst; v.elements[9U] = v8_15.snd; v.elements[10U] = v8_15.thd; v.elements[11U] = v8_15.f3; v.elements[12U] = v8_15.f4; v.elements[13U] = v8_15.f5; v.elements[14U] = v8_15.f6; v.elements[15U] = v8_15.f7; return v; d6773 2 a6774 2 This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} d6777 2 a6778 2 libcrux_ml_kem_vector_portable_deserialize_10_0d(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_serialize_deserialize_10(a); d6789 10 a6798 12 uint8_t r0 = (uint8_t)(Eurydice_slice_index(v, (size_t)0U, int16_t, int16_t *) & (int16_t)255); uint8_t r1 = (uint8_t)(Eurydice_slice_index(v, (size_t)0U, int16_t, int16_t *) >> 8U | (Eurydice_slice_index(v, (size_t)1U, int16_t, int16_t *) & (int16_t)15) << 4U); uint8_t r2 = (uint8_t)(Eurydice_slice_index(v, (size_t)1U, int16_t, int16_t *) >> 4U & (int16_t)255); return (CLITERAL(uint8_t_x3){.fst = r0, .snd = r1, .thd = r2}); d6806 2 a6807 1 Eurydice_array_to_subslice2(v.elements, (size_t)0U, (size_t)2U, int16_t)); d6809 2 a6810 1 Eurydice_array_to_subslice2(v.elements, (size_t)2U, (size_t)4U, int16_t)); d6812 2 a6813 1 Eurydice_array_to_subslice2(v.elements, (size_t)4U, (size_t)6U, int16_t)); d6815 2 a6816 1 Eurydice_array_to_subslice2(v.elements, (size_t)6U, (size_t)8U, int16_t)); d6818 2 a6819 2 Eurydice_array_to_subslice2(v.elements, (size_t)8U, (size_t)10U, int16_t)); d6821 2 a6822 2 Eurydice_array_to_subslice2(v.elements, (size_t)10U, (size_t)12U, int16_t)); d6824 2 a6825 2 Eurydice_array_to_subslice2(v.elements, (size_t)12U, (size_t)14U, int16_t)); d6827 34 a6860 28 Eurydice_array_to_subslice2(v.elements, (size_t)14U, (size_t)16U, int16_t)); uint8_t result[24U] = {0U}; result[0U] = r0_2.fst; result[1U] = r0_2.snd; result[2U] = r0_2.thd; result[3U] = r3_5.fst; result[4U] = r3_5.snd; result[5U] = r3_5.thd; result[6U] = r6_8.fst; result[7U] = r6_8.snd; result[8U] = r6_8.thd; result[9U] = r9_11.fst; result[10U] = r9_11.snd; result[11U] = r9_11.thd; result[12U] = r12_14.fst; result[13U] = r12_14.snd; result[14U] = r12_14.thd; result[15U] = r15_17.fst; result[16U] = r15_17.snd; result[17U] = r15_17.thd; result[18U] = r18_20.fst; result[19U] = r18_20.snd; result[20U] = r18_20.thd; result[21U] = r21_23.fst; result[22U] = r21_23.snd; result[23U] = r21_23.thd; memcpy(ret, result, (size_t)24U * sizeof(uint8_t)); d6864 2 a6865 2 This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} d6867 1 a6867 1 static inline void libcrux_ml_kem_vector_portable_serialize_12_0d( d6870 1 a6870 1 libcrux_ml_kem_vector_portable_serialize_serialize_12(a, ret); d6881 6 a6886 6 int16_t byte0 = (int16_t)Eurydice_slice_index(bytes, (size_t)0U, uint8_t, uint8_t *); int16_t byte1 = (int16_t)Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *); int16_t byte2 = (int16_t)Eurydice_slice_index(bytes, (size_t)2U, uint8_t, uint8_t *); d6889 1 a6889 1 return (CLITERAL(int16_t_x2){.fst = r0, .snd = r1}); d6895 1 a6895 1 Eurydice_slice_subslice2(bytes, (size_t)0U, (size_t)3U, uint8_t)); d6897 1 a6897 1 Eurydice_slice_subslice2(bytes, (size_t)3U, (size_t)6U, uint8_t)); d6899 1 a6899 1 Eurydice_slice_subslice2(bytes, (size_t)6U, (size_t)9U, uint8_t)); d6901 1 a6901 1 Eurydice_slice_subslice2(bytes, (size_t)9U, (size_t)12U, uint8_t)); d6903 1 a6903 1 Eurydice_slice_subslice2(bytes, (size_t)12U, (size_t)15U, uint8_t)); d6906 1 a6906 1 Eurydice_slice_subslice2(bytes, (size_t)15U, (size_t)18U, uint8_t)); d6909 1 a6909 1 Eurydice_slice_subslice2(bytes, (size_t)18U, (size_t)21U, uint8_t)); d6912 13 a6924 20 Eurydice_slice_subslice2(bytes, (size_t)21U, (size_t)24U, uint8_t)); libcrux_ml_kem_vector_portable_vector_type_PortableVector re = libcrux_ml_kem_vector_portable_vector_type_zero(); re.elements[0U] = v0_1.fst; re.elements[1U] = v0_1.snd; re.elements[2U] = v2_3.fst; re.elements[3U] = v2_3.snd; re.elements[4U] = v4_5.fst; re.elements[5U] = v4_5.snd; re.elements[6U] = v6_7.fst; re.elements[7U] = v6_7.snd; re.elements[8U] = v8_9.fst; re.elements[9U] = v8_9.snd; re.elements[10U] = v10_11.fst; re.elements[11U] = v10_11.snd; re.elements[12U] = v12_13.fst; re.elements[13U] = v12_13.snd; re.elements[14U] = v14_15.fst; re.elements[15U] = v14_15.snd; return re; d6928 2 a6929 2 This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} d6932 2 a6933 2 libcrux_ml_kem_vector_portable_deserialize_12_0d(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_serialize_deserialize_12(a); a6950 7 bool uu____0; int16_t uu____1; bool uu____2; size_t uu____3; int16_t uu____4; size_t uu____5; int16_t uu____6; a6954 15 uu____1 = d2; uu____6 = LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS; uu____0 = uu____1 < uu____6; if (uu____0) { uu____3 = sampled; uu____2 = uu____3 < (size_t)16U; if (uu____2) { uu____4 = d2; uu____5 = sampled; Eurydice_slice_index(result, uu____5, int16_t, int16_t *) = uu____4; sampled++; continue; } } continue; d6957 3 a6959 10 uu____1 = d2; uu____6 = LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS; uu____0 = uu____1 < uu____6; if (uu____0) { uu____3 = sampled; uu____2 = uu____3 < (size_t)16U; if (uu____2) { uu____4 = d2; uu____5 = sampled; Eurydice_slice_index(result, uu____5, int16_t, int16_t *) = uu____4; a6960 1 continue; d6968 2 a6969 2 This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} d6971 1 a6971 1 static inline size_t libcrux_ml_kem_vector_portable_rej_sample_0d( d6976 1 a6976 1 #define LIBCRUX_ML_KEM_MLKEM768_VECTOR_U_COMPRESSION_FACTOR_768 ((size_t)10U) d6978 1 a6978 1 #define LIBCRUX_ML_KEM_MLKEM768_C1_BLOCK_SIZE_768 \ d6980 1 a6980 1 LIBCRUX_ML_KEM_MLKEM768_VECTOR_U_COMPRESSION_FACTOR_768 / (size_t)8U) d6982 1 a6982 1 #define LIBCRUX_ML_KEM_MLKEM768_RANK_768 ((size_t)3U) d6984 2 a6985 2 #define LIBCRUX_ML_KEM_MLKEM768_C1_SIZE_768 \ (LIBCRUX_ML_KEM_MLKEM768_C1_BLOCK_SIZE_768 * LIBCRUX_ML_KEM_MLKEM768_RANK_768) d6987 1 a6987 1 #define LIBCRUX_ML_KEM_MLKEM768_VECTOR_V_COMPRESSION_FACTOR_768 ((size_t)4U) d6989 1 a6989 1 #define LIBCRUX_ML_KEM_MLKEM768_C2_SIZE_768 \ d6991 1 a6991 1 LIBCRUX_ML_KEM_MLKEM768_VECTOR_V_COMPRESSION_FACTOR_768 / (size_t)8U) d6993 2 a6994 2 #define LIBCRUX_ML_KEM_MLKEM768_CPA_PKE_CIPHERTEXT_SIZE_768 \ (LIBCRUX_ML_KEM_MLKEM768_C1_SIZE_768 + LIBCRUX_ML_KEM_MLKEM768_C2_SIZE_768) d6996 2 a6997 2 #define LIBCRUX_ML_KEM_MLKEM768_T_AS_NTT_ENCODED_SIZE_768 \ (LIBCRUX_ML_KEM_MLKEM768_RANK_768 * \ d7001 2 a7002 2 #define LIBCRUX_ML_KEM_MLKEM768_CPA_PKE_PUBLIC_KEY_SIZE_768 \ (LIBCRUX_ML_KEM_MLKEM768_T_AS_NTT_ENCODED_SIZE_768 + (size_t)32U) d7004 3 a7006 3 #define LIBCRUX_ML_KEM_MLKEM768_CPA_PKE_SECRET_KEY_SIZE_768 \ (LIBCRUX_ML_KEM_MLKEM768_RANK_768 * \ LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT * \ d7021 1 a7021 1 LIBCRUX_ML_KEM_MLKEM768_CPA_PKE_CIPHERTEXT_SIZE_768) d7023 1 a7023 1 typedef libcrux_ml_kem_types_MlKemPrivateKey_55 d7026 1 a7026 1 typedef libcrux_ml_kem_types_MlKemPublicKey_15 d7029 2 a7030 2 #define LIBCRUX_ML_KEM_MLKEM768_RANKED_BYTES_PER_RING_ELEMENT_768 \ (LIBCRUX_ML_KEM_MLKEM768_RANK_768 * \ d7033 4 a7036 4 #define LIBCRUX_ML_KEM_MLKEM768_SECRET_KEY_SIZE_768 \ (LIBCRUX_ML_KEM_MLKEM768_CPA_PKE_SECRET_KEY_SIZE_768 + \ LIBCRUX_ML_KEM_MLKEM768_CPA_PKE_PUBLIC_KEY_SIZE_768 + \ LIBCRUX_ML_KEM_CONSTANTS_H_DIGEST_SIZE + \ d7044 1 a7044 1 typedef struct libcrux_ml_kem_polynomial_PolynomialRingElement_f0_s { d7046 11 a7056 1 } libcrux_ml_kem_polynomial_PolynomialRingElement_f0; d7060 2 a7061 1 {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0]} d7064 1 a7064 1 A monomorphic instance of libcrux_ml_kem.polynomial.ZERO_89 d7069 11 a7079 19 static inline libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_polynomial_ZERO_89_ea(void) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 lit; lit.coefficients[0U] = libcrux_ml_kem_vector_portable_ZERO_0d(); lit.coefficients[1U] = libcrux_ml_kem_vector_portable_ZERO_0d(); lit.coefficients[2U] = libcrux_ml_kem_vector_portable_ZERO_0d(); lit.coefficients[3U] = libcrux_ml_kem_vector_portable_ZERO_0d(); lit.coefficients[4U] = libcrux_ml_kem_vector_portable_ZERO_0d(); lit.coefficients[5U] = libcrux_ml_kem_vector_portable_ZERO_0d(); lit.coefficients[6U] = libcrux_ml_kem_vector_portable_ZERO_0d(); lit.coefficients[7U] = libcrux_ml_kem_vector_portable_ZERO_0d(); lit.coefficients[8U] = libcrux_ml_kem_vector_portable_ZERO_0d(); lit.coefficients[9U] = libcrux_ml_kem_vector_portable_ZERO_0d(); lit.coefficients[10U] = libcrux_ml_kem_vector_portable_ZERO_0d(); lit.coefficients[11U] = libcrux_ml_kem_vector_portable_ZERO_0d(); lit.coefficients[12U] = libcrux_ml_kem_vector_portable_ZERO_0d(); lit.coefficients[13U] = libcrux_ml_kem_vector_portable_ZERO_0d(); lit.coefficients[14U] = libcrux_ml_kem_vector_portable_ZERO_0d(); lit.coefficients[15U] = libcrux_ml_kem_vector_portable_ZERO_0d(); d7084 8 a7091 1 A monomorphic instance of libcrux_ml_kem.ind_cpa.deserialize_secret_key.closure d7095 4 d7100 3 a7102 3 static inline libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_ind_cpa_deserialize_secret_key_closure_6b(size_t _) { return libcrux_ml_kem_polynomial_ZERO_89_ea(); d7111 2 a7112 2 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_serialize_deserialize_to_uncompressed_ring_element_af( d7114 2 a7115 2 libcrux_ml_kem_polynomial_PolynomialRingElement_f0 re = libcrux_ml_kem_polynomial_ZERO_89_ea(); d7119 3 a7121 2 Eurydice_slice bytes = Eurydice_slice_subslice2( serialized, i0 * (size_t)24U, i0 * (size_t)24U + (size_t)24U, uint8_t); d7123 1 a7123 1 libcrux_ml_kem_vector_portable_deserialize_12_0d(bytes); d7133 1 a7133 1 A monomorphic instance of libcrux_ml_kem.ind_cpa.deserialize_secret_key d7138 1 a7138 1 static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_deserialize_secret_key_24( d7140 1 a7140 2 libcrux_ml_kem_polynomial_PolynomialRingElement_f0 ret[3U]) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 secret_as_ntt[3U]; a7141 6 secret_as_ntt[i] = libcrux_ml_kem_polynomial_ZERO_89_ea(); } for (size_t i = (size_t)0U; i < Eurydice_slice_len(secret_key, uint8_t) / LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT; i++) { d7143 8 a7150 8 Eurydice_slice secret_bytes = Eurydice_slice_subslice2( secret_key, i0 * LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT, i0 * LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT + LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT, uint8_t); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 uu____0 = libcrux_ml_kem_serialize_deserialize_to_uncompressed_ring_element_af( secret_bytes); a7152 3 memcpy( ret, secret_as_ntt, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); d7156 5 a7160 4 A monomorphic instance of libcrux_ml_kem.ind_cpa.unpacked.IndCpaPrivateKeyUnpacked with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - $3size_t a7161 4 typedef struct libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_f8_s { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 secret_as_ntt[3U]; } libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_f8; d7164 1 a7164 1 libcrux_ml_kem.ind_cpa.deserialize_then_decompress_u.closure with types d7170 4 a7173 3 static inline libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_ind_cpa_deserialize_then_decompress_u_closure_7c(size_t _) { return libcrux_ml_kem_polynomial_ZERO_89_ea(); d7183 2 a7184 2 libcrux_ml_kem_vector_portable_compress_decompress_ciphertext_coefficient_6b( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { d7188 5 a7192 2 int32_t decompressed = (int32_t)v.elements[i0] * (int32_t)LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS; d7195 1 a7195 1 v.elements[i0] = (int16_t)decompressed; d7197 1 a7197 1 return v; d7201 2 a7202 2 This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} d7206 1 a7206 1 libcrux_ml_kem.vector.portable.decompress_ciphertext_coefficient_0d with const d7211 4 a7214 4 libcrux_ml_kem_vector_portable_decompress_ciphertext_coefficient_0d_5a( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { return libcrux_ml_kem_vector_portable_compress_decompress_ciphertext_coefficient_6b( v); d7223 2 a7224 2 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_serialize_deserialize_then_decompress_10_2c( d7226 2 a7227 2 libcrux_ml_kem_polynomial_PolynomialRingElement_f0 re = libcrux_ml_kem_polynomial_ZERO_89_ea(); d7231 3 a7233 2 Eurydice_slice bytes = Eurydice_slice_subslice2( serialized, i0 * (size_t)20U, i0 * (size_t)20U + (size_t)20U, uint8_t); d7235 1 a7235 1 libcrux_ml_kem_vector_portable_deserialize_10_0d(bytes); d7237 1 a7237 65 libcrux_ml_kem_vector_portable_decompress_ciphertext_coefficient_0d_5a( coefficient); re.coefficients[i0] = uu____0; } return re; } /** A monomorphic instance of libcrux_ml_kem.vector.portable.compress.decompress_ciphertext_coefficient with const generics - COEFFICIENT_BITS= 11 */ static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_compress_decompress_ciphertext_coefficient_6b0( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; int32_t decompressed = (int32_t)v.elements[i0] * (int32_t)LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS; decompressed = (decompressed << 1U) + ((int32_t)1 << (uint32_t)(int32_t)11); decompressed = decompressed >> (uint32_t)((int32_t)11 + (int32_t)1); v.elements[i0] = (int16_t)decompressed; } return v; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ /** A monomorphic instance of libcrux_ml_kem.vector.portable.decompress_ciphertext_coefficient_0d with const generics - COEFFICIENT_BITS= 11 */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_decompress_ciphertext_coefficient_0d_5a0( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { return libcrux_ml_kem_vector_portable_compress_decompress_ciphertext_coefficient_6b0( v); } /** A monomorphic instance of libcrux_ml_kem.serialize.deserialize_then_decompress_11 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_serialize_deserialize_then_decompress_11_8d( Eurydice_slice serialized) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 re = libcrux_ml_kem_polynomial_ZERO_89_ea(); for (size_t i = (size_t)0U; i < Eurydice_slice_len(serialized, uint8_t) / (size_t)22U; i++) { size_t i0 = i; Eurydice_slice bytes = Eurydice_slice_subslice2( serialized, i0 * (size_t)22U, i0 * (size_t)22U + (size_t)22U, uint8_t); libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient = libcrux_ml_kem_vector_portable_deserialize_11_0d(bytes); libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_decompress_ciphertext_coefficient_0d_5a0( d7250 2 a7251 2 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_serialize_deserialize_then_decompress_ring_element_u_34( d7253 1 a7253 1 return libcrux_ml_kem_serialize_deserialize_then_decompress_10_2c(serialized); a7261 13 A monomorphic instance of libcrux_ml_kem.vector.traits.montgomery_multiply_fe with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_traits_montgomery_multiply_fe_67( libcrux_ml_kem_vector_portable_vector_type_PortableVector v, int16_t fer) { return libcrux_ml_kem_vector_portable_montgomery_multiply_by_constant_0d(v, fer); } /** d7269 1 a7269 1 libcrux_ml_kem_ntt_ntt_layer_int_vec_step_0c( d7274 7 a7280 6 libcrux_ml_kem_vector_traits_montgomery_multiply_fe_67(b, zeta_r); b = libcrux_ml_kem_vector_portable_sub_0d(a, &t); a = libcrux_ml_kem_vector_portable_add_0d(a, &t); return ( CLITERAL(libcrux_ml_kem_vector_portable_vector_type_PortableVector_x2){ .fst = a, .snd = b}); d7289 2 a7290 2 static KRML_MUSTINLINE void libcrux_ml_kem_ntt_ntt_at_layer_4_plus_51( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *re, d7302 1 a7302 1 libcrux_ml_kem_ntt_ntt_layer_int_vec_step_0c( d7304 1 a7304 1 libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[zeta_i[0U]]); d7319 3 a7321 3 static KRML_MUSTINLINE void libcrux_ml_kem_ntt_ntt_at_layer_3_fd( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *re, size_t _layer, size_t _initial_coefficient_bound) { d7326 1 a7326 1 libcrux_ml_kem_vector_portable_ntt_layer_3_step_0d( d7328 1 a7328 1 libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[zeta_i[0U]]); d7339 3 a7341 3 static KRML_MUSTINLINE void libcrux_ml_kem_ntt_ntt_at_layer_2_ad( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *re, size_t _layer, size_t _initial_coefficient_bound) { d7346 3 a7348 5 libcrux_ml_kem_vector_portable_ntt_layer_2_step_0d( re->coefficients[round], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[zeta_i[0U]], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[zeta_i[0U] + (size_t)1U]); d7359 3 a7361 3 static KRML_MUSTINLINE void libcrux_ml_kem_ntt_ntt_at_layer_1_a2( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *re, size_t _layer, size_t _initial_coefficient_bound) { d7366 5 a7370 9 libcrux_ml_kem_vector_portable_ntt_layer_1_step_0d( re->coefficients[round], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[zeta_i[0U]], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[zeta_i[0U] + (size_t)1U], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[zeta_i[0U] + (size_t)2U], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[zeta_i[0U] + (size_t)3U]); d7376 1 a7376 5 This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.poly_barrett_reduce_89 d7381 2 a7382 2 static KRML_MUSTINLINE void libcrux_ml_kem_polynomial_poly_barrett_reduce_89_8b( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *self) { d7387 3 a7389 3 libcrux_ml_kem_vector_portable_barrett_reduce_0d( self->coefficients[i0]); self->coefficients[i0] = uu____0; d7394 16 d7415 2 a7416 2 static KRML_MUSTINLINE void libcrux_ml_kem_ntt_ntt_vector_u_9f( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *re) { d7418 1 a7418 3 libcrux_ml_kem_ntt_ntt_at_layer_4_plus_51(&zeta_i, re, (size_t)7U, (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_4_plus_51(&zeta_i, re, (size_t)6U, d7420 10 a7429 8 libcrux_ml_kem_ntt_ntt_at_layer_4_plus_51(&zeta_i, re, (size_t)5U, (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_4_plus_51(&zeta_i, re, (size_t)4U, (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_3_fd(&zeta_i, re, (size_t)3U, (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_2_ad(&zeta_i, re, (size_t)2U, (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_1_a2(&zeta_i, re, (size_t)1U, (size_t)3328U); libcrux_ml_kem_polynomial_poly_barrett_reduce_89_8b(re); d7445 1 a7445 1 libcrux_ml_kem_ind_cpa_deserialize_then_decompress_u_f4( d7447 2 a7448 2 libcrux_ml_kem_polynomial_PolynomialRingElement_f0 ret[3U]) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 u_as_ntt[3U]; d7450 5 a7454 1 u_as_ntt[i] = libcrux_ml_kem_polynomial_ZERO_89_ea(); d7464 1 a7464 1 Eurydice_slice u_bytes = Eurydice_array_to_subslice2( d7472 1 a7472 1 uint8_t); d7474 1 a7474 1 libcrux_ml_kem_serialize_deserialize_then_decompress_ring_element_u_34( d7476 1 a7476 1 libcrux_ml_kem_ntt_ntt_vector_u_9f(&u_as_ntt[i0]); d7480 1 a7480 1 (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); d7490 2 a7491 2 libcrux_ml_kem_vector_portable_compress_decompress_ciphertext_coefficient_6b1( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { d7495 5 a7499 2 int32_t decompressed = (int32_t)v.elements[i0] * (int32_t)LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS; d7502 1 a7502 1 v.elements[i0] = (int16_t)decompressed; d7504 1 a7504 1 return v; d7508 2 a7509 2 This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} d7513 1 a7513 1 libcrux_ml_kem.vector.portable.decompress_ciphertext_coefficient_0d with const d7518 4 a7521 4 libcrux_ml_kem_vector_portable_decompress_ciphertext_coefficient_0d_5a1( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { return libcrux_ml_kem_vector_portable_compress_decompress_ciphertext_coefficient_6b1( v); d7530 2 a7531 2 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_serialize_deserialize_then_decompress_4_41( d7533 2 a7534 2 libcrux_ml_kem_polynomial_PolynomialRingElement_f0 re = libcrux_ml_kem_polynomial_ZERO_89_ea(); d7538 2 a7539 2 Eurydice_slice bytes = Eurydice_slice_subslice2( serialized, i0 * (size_t)8U, i0 * (size_t)8U + (size_t)8U, uint8_t); d7541 1 a7541 1 libcrux_ml_kem_vector_portable_deserialize_4_0d(bytes); d7543 1 a7543 1 libcrux_ml_kem_vector_portable_decompress_ciphertext_coefficient_0d_5a1( d7552 4 a7555 3 libcrux_ml_kem.vector.portable.compress.decompress_ciphertext_coefficient with const generics - COEFFICIENT_BITS= 5 d7557 4 a7560 30 static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_compress_decompress_ciphertext_coefficient_6b2( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; int32_t decompressed = (int32_t)v.elements[i0] * (int32_t)LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS; decompressed = (decompressed << 1U) + ((int32_t)1 << (uint32_t)(int32_t)5); decompressed = decompressed >> (uint32_t)((int32_t)5 + (int32_t)1); v.elements[i0] = (int16_t)decompressed; } return v; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ /** A monomorphic instance of libcrux_ml_kem.vector.portable.decompress_ciphertext_coefficient_0d with const generics - COEFFICIENT_BITS= 5 */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_decompress_ciphertext_coefficient_0d_5a2( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { return libcrux_ml_kem_vector_portable_compress_decompress_ciphertext_coefficient_6b2( v); d7564 1 a7564 1 A monomorphic instance of libcrux_ml_kem.serialize.deserialize_then_decompress_5 d7569 7 a7575 16 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_serialize_deserialize_then_decompress_5_4e( Eurydice_slice serialized) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 re = libcrux_ml_kem_polynomial_ZERO_89_ea(); for (size_t i = (size_t)0U; i < Eurydice_slice_len(serialized, uint8_t) / (size_t)10U; i++) { size_t i0 = i; Eurydice_slice bytes = Eurydice_slice_subslice2( serialized, i0 * (size_t)10U, i0 * (size_t)10U + (size_t)10U, uint8_t); re.coefficients[i0] = libcrux_ml_kem_vector_portable_deserialize_5_0d(bytes); libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____1 = libcrux_ml_kem_vector_portable_decompress_ciphertext_coefficient_0d_5a2( re.coefficients[i0]); re.coefficients[i0] = uu____1; d7577 4 a7580 13 return re; } /** A monomorphic instance of libcrux_ml_kem.serialize.deserialize_then_decompress_ring_element_v with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - COMPRESSION_FACTOR= 4 */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_serialize_deserialize_then_decompress_ring_element_v_56( Eurydice_slice serialized) { return libcrux_ml_kem_serialize_deserialize_then_decompress_4_41(serialized); d7611 1 a7611 5 This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.ntt_multiply_89 d7616 6 a7621 6 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_polynomial_ntt_multiply_89_2a( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *self, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *rhs) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 out = libcrux_ml_kem_polynomial_ZERO_89_ea(); d7626 9 a7634 13 libcrux_ml_kem_vector_portable_ntt_multiply_0d( &self->coefficients[i0], &rhs->coefficients[i0], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[(size_t)64U + (size_t)4U * i0], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[(size_t)64U + (size_t)4U * i0 + (size_t)1U], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[(size_t)64U + (size_t)4U * i0 + (size_t)2U], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[(size_t)64U + (size_t)4U * i0 + (size_t)3U]); d7641 18 d7663 1 a7663 5 This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.add_to_ring_element_89 d7668 3 a7670 3 static KRML_MUSTINLINE void libcrux_ml_kem_polynomial_add_to_ring_element_89_84( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *self, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *rhs) { d7674 1 a7674 1 (size_t)16U, self->coefficients, d7680 1 a7680 1 libcrux_ml_kem_vector_portable_add_0d(self->coefficients[i0], d7682 1 a7682 1 self->coefficients[i0] = uu____0; d7687 17 d7709 2 a7710 3 static KRML_MUSTINLINE void libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_1_83( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *re, size_t _layer) { d7715 5 a7719 9 libcrux_ml_kem_vector_portable_inv_ntt_layer_1_step_0d( re->coefficients[round], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[zeta_i[0U]], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[zeta_i[0U] - (size_t)1U], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[zeta_i[0U] - (size_t)2U], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[zeta_i[0U] - (size_t)3U]); d7730 2 a7731 3 static KRML_MUSTINLINE void libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_2_c3( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *re, size_t _layer) { d7736 3 a7738 5 libcrux_ml_kem_vector_portable_inv_ntt_layer_2_step_0d( re->coefficients[round], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[zeta_i[0U]], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[zeta_i[0U] - (size_t)1U]); d7749 2 a7750 3 static KRML_MUSTINLINE void libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_3_68( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *re, size_t _layer) { d7755 1 a7755 1 libcrux_ml_kem_vector_portable_inv_ntt_layer_3_step_0d( d7757 1 a7757 1 libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[zeta_i[0U]]); d7770 1 a7770 1 libcrux_ml_kem_invert_ntt_inv_ntt_layer_int_vec_step_reduce_65( d7775 8 a7782 7 libcrux_ml_kem_vector_portable_sub_0d(b, &a); a = libcrux_ml_kem_vector_portable_barrett_reduce_0d( libcrux_ml_kem_vector_portable_add_0d(a, &b)); b = libcrux_ml_kem_vector_traits_montgomery_multiply_fe_67(a_minus_b, zeta_r); return ( CLITERAL(libcrux_ml_kem_vector_portable_vector_type_PortableVector_x2){ .fst = a, .snd = b}); d7792 2 a7793 2 libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_4_plus_6e( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *re, d7807 1 a7807 1 libcrux_ml_kem_invert_ntt_inv_ntt_layer_int_vec_step_reduce_65( d7809 1 a7809 1 libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[zeta_i[0U]]); d7824 2 a7825 2 static KRML_MUSTINLINE void libcrux_ml_kem_invert_ntt_invert_ntt_montgomery_f6( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *re) { d7828 4 a7831 4 libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_1_83(&zeta_i, re, (size_t)1U); libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_2_c3(&zeta_i, re, (size_t)2U); libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_3_68(&zeta_i, re, (size_t)3U); libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_4_plus_6e(&zeta_i, re, d7833 1 a7833 1 libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_4_plus_6e(&zeta_i, re, d7835 1 a7835 1 libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_4_plus_6e(&zeta_i, re, d7837 1 a7837 1 libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_4_plus_6e(&zeta_i, re, d7839 1 a7839 1 libcrux_ml_kem_polynomial_poly_barrett_reduce_89_8b(re); d7843 1 a7843 5 This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.subtract_reduce_89 d7848 4 a7851 4 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_polynomial_subtract_reduce_89_d4( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *self, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 b) { d7857 1 a7857 1 libcrux_ml_kem_vector_portable_montgomery_multiply_by_constant_0d( d7859 6 a7864 5 libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_barrett_reduce_0d( libcrux_ml_kem_vector_portable_sub_0d(self->coefficients[i0], &coefficient_normal_form)); b.coefficients[i0] = uu____0; d7870 18 d7899 7 a7905 7 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_matrix_compute_message_b3( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *v, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *secret_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *u_as_ntt) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 result = libcrux_ml_kem_polynomial_ZERO_89_ea(); d7908 2 a7909 2 libcrux_ml_kem_polynomial_PolynomialRingElement_f0 product = libcrux_ml_kem_polynomial_ntt_multiply_89_2a(&secret_as_ntt[i0], d7911 1 a7911 1 libcrux_ml_kem_polynomial_add_to_ring_element_89_84(&result, &product); d7913 2 a7914 3 libcrux_ml_kem_invert_ntt_invert_ntt_montgomery_f6(&result); result = libcrux_ml_kem_polynomial_subtract_reduce_89_d4(v, result); return result; d7918 2 a7919 1 A monomorphic instance of libcrux_ml_kem.vector.portable.arithmetic.shift_right d7921 1 a7921 1 - SHIFT_BY= 15 d7924 1 a7924 33 libcrux_ml_kem_vector_portable_arithmetic_shift_right_94( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; v.elements[i0] = v.elements[i0] >> (uint32_t)(int32_t)15; } return v; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ /** A monomorphic instance of libcrux_ml_kem.vector.portable.shift_right_0d with const generics - SHIFT_BY= 15 */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_shift_right_0d_19( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { return libcrux_ml_kem_vector_portable_arithmetic_shift_right_94(v); } /** A monomorphic instance of libcrux_ml_kem.vector.traits.to_unsigned_representative with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_traits_to_unsigned_representative_db( d7926 1 a7926 6 libcrux_ml_kem_vector_portable_vector_type_PortableVector t = libcrux_ml_kem_vector_portable_shift_right_0d_19(a); libcrux_ml_kem_vector_portable_vector_type_PortableVector fm = libcrux_ml_kem_vector_portable_bitwise_and_with_constant_0d( t, LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS); return libcrux_ml_kem_vector_portable_add_0d(a, &fm); d7936 2 a7937 2 libcrux_ml_kem_serialize_compress_then_serialize_message_aa( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 re, uint8_t ret[32U]) { d7942 1 a7942 1 libcrux_ml_kem_vector_traits_to_unsigned_representative_db( d7946 1 a7946 1 libcrux_ml_kem_vector_portable_compress_1_0d(coefficient); d7948 1 a7948 1 libcrux_ml_kem_vector_portable_serialize_1_0d(coefficient_compressed, a7949 2 Eurydice_slice uu____0 = Eurydice_array_to_subslice2( serialized, (size_t)2U * i0, (size_t)2U * i0 + (size_t)2U, uint8_t); d7951 3 a7953 1 uu____0, Eurydice_array_to_slice((size_t)2U, bytes, uint8_t), uint8_t); d7992 2 a7993 2 static inline void libcrux_ml_kem_ind_cpa_decrypt_unpacked_6d( libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_f8 *secret_key, d7995 4 a7998 4 libcrux_ml_kem_polynomial_PolynomialRingElement_f0 u_as_ntt[3U]; libcrux_ml_kem_ind_cpa_deserialize_then_decompress_u_f4(ciphertext, u_as_ntt); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 v = libcrux_ml_kem_serialize_deserialize_then_decompress_ring_element_v_56( d8000 4 a8003 3 (size_t)960U, uint8_t, size_t)); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 message = libcrux_ml_kem_matrix_compute_message_b3(&v, secret_key->secret_as_ntt, d8006 1 a8006 1 libcrux_ml_kem_serialize_compress_then_serialize_message_aa(message, ret0); d8020 3 a8022 11 static inline void libcrux_ml_kem_ind_cpa_decrypt_43(Eurydice_slice secret_key, uint8_t *ciphertext, uint8_t ret[32U]) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 secret_as_ntt[3U]; libcrux_ml_kem_ind_cpa_deserialize_secret_key_24(secret_key, secret_as_ntt); /* Passing arrays by value in Rust generates a copy in C */ libcrux_ml_kem_polynomial_PolynomialRingElement_f0 copy_of_secret_as_ntt[3U]; memcpy( copy_of_secret_as_ntt, secret_as_ntt, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_f8 d8024 6 d8031 8 a8038 6 secret_key_unpacked.secret_as_ntt, copy_of_secret_as_ntt, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); uint8_t ret0[32U]; libcrux_ml_kem_ind_cpa_decrypt_unpacked_6d(&secret_key_unpacked, ciphertext, ret0); memcpy(ret, ret0, (size_t)32U * sizeof(uint8_t)); d8042 2 a8043 2 This function found in impl {(libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash)} d8046 1 a8046 1 A monomorphic instance of libcrux_ml_kem.hash_functions.portable.G_f1 d8050 1 a8050 1 static KRML_MUSTINLINE void libcrux_ml_kem_hash_functions_portable_G_f1_e4( d8060 1 a8060 1 static KRML_MUSTINLINE void libcrux_ml_kem_hash_functions_portable_PRF_2b( d8069 2 a8070 2 This function found in impl {(libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash)} d8073 1 a8073 1 A monomorphic instance of libcrux_ml_kem.hash_functions.portable.PRF_f1 d8078 1 a8078 1 static KRML_MUSTINLINE void libcrux_ml_kem_hash_functions_portable_PRF_f1_ee( d8080 1 a8080 1 libcrux_ml_kem_hash_functions_portable_PRF_2b(input, ret); d8085 1 a8085 1 libcrux_ml_kem.serialize.deserialize_ring_elements_reduced.closure with types d8087 17 a8103 1 - PUBLIC_KEY_SIZE= 1152 d8106 26 a8131 4 static inline libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_closure_cd( size_t _i) { return libcrux_ml_kem_polynomial_ZERO_89_ea(); d8146 2 a8147 2 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_serialize_deserialize_to_reduced_ring_element_4c( d8149 2 a8150 2 libcrux_ml_kem_polynomial_PolynomialRingElement_f0 re = libcrux_ml_kem_polynomial_ZERO_89_ea(); d8154 3 a8156 2 Eurydice_slice bytes = Eurydice_slice_subslice2( serialized, i0 * (size_t)24U, i0 * (size_t)24U + (size_t)24U, uint8_t); d8158 1 a8158 1 libcrux_ml_kem_vector_portable_deserialize_12_0d(bytes); d8160 1 a8160 1 libcrux_ml_kem_vector_portable_cond_subtract_3329_0d(coefficient); d8167 1 a8167 4 This function deserializes ring elements and reduces the result by the field modulus. This function MUST NOT be used on secret inputs. a8172 1 - PUBLIC_KEY_SIZE= 1152 d8176 1 a8176 1 libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_33( d8178 1 a8178 5 libcrux_ml_kem_polynomial_PolynomialRingElement_f0 ret[3U]) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 deserialized_pk[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { deserialized_pk[i] = libcrux_ml_kem_polynomial_ZERO_89_ea(); } d8184 1 a8184 1 Eurydice_slice ring_element = Eurydice_slice_subslice2( d8188 3 a8190 3 uint8_t); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 uu____0 = libcrux_ml_kem_serialize_deserialize_to_reduced_ring_element_4c( a8193 29 memcpy( ret, deserialized_pk, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); } /** A monomorphic instance of libcrux_ml_kem.matrix.sample_matrix_A.closure.closure with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 */ static inline libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_matrix_sample_matrix_A_closure_closure_78(size_t _j) { return libcrux_ml_kem_polynomial_ZERO_89_ea(); } /** A monomorphic instance of libcrux_ml_kem.matrix.sample_matrix_A.closure with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 */ static inline void libcrux_ml_kem_matrix_sample_matrix_A_closure_4b( size_t _i, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 ret[3U]) { for (size_t i = (size_t)0U; i < (size_t)3U; i++) { ret[i] = libcrux_ml_kem_polynomial_ZERO_89_ea(); } d8201 3 a8203 3 typedef struct libcrux_ml_kem_hash_functions_portable_PortableHash_58_s { libcrux_sha3_generic_keccak_KeccakState_48 shake128_state[3U]; } libcrux_ml_kem_hash_functions_portable_PortableHash_58; d8207 2 a8208 1 libcrux_ml_kem.hash_functions.portable.shake128_init_absorb with const generics d8211 5 a8215 4 static KRML_MUSTINLINE libcrux_ml_kem_hash_functions_portable_PortableHash_58 libcrux_ml_kem_hash_functions_portable_shake128_init_absorb_b7( uint8_t input[3U][34U]) { libcrux_sha3_generic_keccak_KeccakState_48 shake128_state[3U]; d8217 1 a8217 1 shake128_state[i] = libcrux_sha3_portable_incremental_shake128_init(); d8219 2 d8224 1 a8224 1 &shake128_state[i0], d8227 1 a8227 8 /* Passing arrays by value in Rust generates a copy in C */ libcrux_sha3_generic_keccak_KeccakState_48 copy_of_shake128_state[3U]; memcpy(copy_of_shake128_state, shake128_state, (size_t)3U * sizeof(libcrux_sha3_generic_keccak_KeccakState_48)); libcrux_ml_kem_hash_functions_portable_PortableHash_58 lit; memcpy(lit.shake128_state, copy_of_shake128_state, (size_t)3U * sizeof(libcrux_sha3_generic_keccak_KeccakState_48)); return lit; d8231 2 a8232 2 This function found in impl {(libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash)} d8236 1 a8236 1 libcrux_ml_kem.hash_functions.portable.shake128_init_absorb_f1 with const d8240 5 a8244 8 static KRML_MUSTINLINE libcrux_ml_kem_hash_functions_portable_PortableHash_58 libcrux_ml_kem_hash_functions_portable_shake128_init_absorb_f1_8c( uint8_t input[3U][34U]) { /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_input[3U][34U]; memcpy(copy_of_input, input, (size_t)3U * sizeof(uint8_t[34U])); return libcrux_ml_kem_hash_functions_portable_shake128_init_absorb_b7( copy_of_input); d8249 2 a8250 2 libcrux_ml_kem.hash_functions.portable.shake128_squeeze_three_blocks with const generics d8253 3 a8255 3 static KRML_MUSTINLINE void libcrux_ml_kem_hash_functions_portable_shake128_squeeze_three_blocks_ca( libcrux_ml_kem_hash_functions_portable_PortableHash_58 *st, d8268 2 a8269 2 This function found in impl {(libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash)} d8273 2 a8274 2 libcrux_ml_kem.hash_functions.portable.shake128_squeeze_three_blocks_f1 with const generics d8277 3 a8279 3 static KRML_MUSTINLINE void libcrux_ml_kem_hash_functions_portable_shake128_squeeze_three_blocks_f1_69( libcrux_ml_kem_hash_functions_portable_PortableHash_58 *self, d8281 2 a8282 2 libcrux_ml_kem_hash_functions_portable_shake128_squeeze_three_blocks_ca(self, ret); d8334 2 a8335 2 libcrux_ml_kem_sampling_sample_from_uniform_distribution_next_db( uint8_t randomness[3U][504U], size_t *sampled_coefficients, d8343 9 a8351 9 Eurydice_slice uu____0 = Eurydice_array_to_subslice2(randomness[i1], r * (size_t)24U, r * (size_t)24U + (size_t)24U, uint8_t); size_t sampled = libcrux_ml_kem_vector_portable_rej_sample_0d( uu____0, Eurydice_array_to_subslice2( out[i1], sampled_coefficients[i1], sampled_coefficients[i1] + (size_t)16U, int16_t)); size_t uu____1 = i1; sampled_coefficients[uu____1] = sampled_coefficients[uu____1] + sampled; d8371 1 a8371 1 libcrux_ml_kem.hash_functions.portable.shake128_squeeze_block with const d8375 3 a8377 3 static KRML_MUSTINLINE void libcrux_ml_kem_hash_functions_portable_shake128_squeeze_block_dd( libcrux_ml_kem_hash_functions_portable_PortableHash_58 *st, d8390 2 a8391 2 This function found in impl {(libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash)} d8395 1 a8395 1 libcrux_ml_kem.hash_functions.portable.shake128_squeeze_block_f1 with const d8399 3 a8401 3 static KRML_MUSTINLINE void libcrux_ml_kem_hash_functions_portable_shake128_squeeze_block_f1_60( libcrux_ml_kem_hash_functions_portable_PortableHash_58 *self, d8403 2 a8404 1 libcrux_ml_kem_hash_functions_portable_shake128_squeeze_block_dd(self, ret); d8456 2 a8457 2 libcrux_ml_kem_sampling_sample_from_uniform_distribution_next_db0( uint8_t randomness[3U][168U], size_t *sampled_coefficients, d8465 9 a8473 9 Eurydice_slice uu____0 = Eurydice_array_to_subslice2(randomness[i1], r * (size_t)24U, r * (size_t)24U + (size_t)24U, uint8_t); size_t sampled = libcrux_ml_kem_vector_portable_rej_sample_0d( uu____0, Eurydice_array_to_subslice2( out[i1], sampled_coefficients[i1], sampled_coefficients[i1] + (size_t)16U, int16_t)); size_t uu____1 = i1; sampled_coefficients[uu____1] = sampled_coefficients[uu____1] + sampled; d8492 3 a8494 7 This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.from_i16_array_89 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics d8497 4 a8500 4 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_polynomial_from_i16_array_89_c1(Eurydice_slice a) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 result = libcrux_ml_kem_polynomial_ZERO_89_ea(); d8505 4 a8508 3 libcrux_ml_kem_vector_portable_from_i16_array_0d( Eurydice_slice_subslice2(a, i0 * (size_t)16U, (i0 + (size_t)1U) * (size_t)16U, int16_t)); d8515 23 a8537 1 A monomorphic instance of libcrux_ml_kem.sampling.sample_from_xof.closure d8543 7 a8549 4 static inline libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_sampling_sample_from_xof_closure_04(int16_t s[272U]) { return libcrux_ml_kem_polynomial_from_i16_array_89_c1( Eurydice_array_to_subslice2(s, (size_t)0U, (size_t)256U, int16_t)); d8559 3 a8561 3 static KRML_MUSTINLINE void libcrux_ml_kem_sampling_sample_from_xof_3f( uint8_t seeds[3U][34U], libcrux_ml_kem_polynomial_PolynomialRingElement_f0 ret[3U]) { d8564 3 a8566 6 /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_seeds[3U][34U]; memcpy(copy_of_seeds, seeds, (size_t)3U * sizeof(uint8_t[34U])); libcrux_ml_kem_hash_functions_portable_PortableHash_58 xof_state = libcrux_ml_kem_hash_functions_portable_shake128_init_absorb_f1_8c( copy_of_seeds); d8568 1 a8568 1 libcrux_ml_kem_hash_functions_portable_shake128_squeeze_three_blocks_f1_69( d8570 2 a8571 5 /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_randomness0[3U][504U]; memcpy(copy_of_randomness0, randomness0, (size_t)3U * sizeof(uint8_t[504U])); bool done = libcrux_ml_kem_sampling_sample_from_uniform_distribution_next_db( copy_of_randomness0, sampled_coefficients, out); d8577 1 a8577 1 libcrux_ml_kem_hash_functions_portable_shake128_squeeze_block_f1_60( d8579 2 a8580 6 /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_randomness[3U][168U]; memcpy(copy_of_randomness, randomness, (size_t)3U * sizeof(uint8_t[168U])); done = libcrux_ml_kem_sampling_sample_from_uniform_distribution_next_db0( copy_of_randomness, sampled_coefficients, out); d8586 1 a8586 1 libcrux_ml_kem_polynomial_PolynomialRingElement_f0 ret0[3U]; d8588 4 a8591 2 ret0[i] = libcrux_ml_kem_sampling_sample_from_xof_closure_04(copy_of_out[i]); d8595 1 a8595 1 (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); d8605 3 a8607 7 static KRML_MUSTINLINE void libcrux_ml_kem_matrix_sample_matrix_A_38( uint8_t seed[34U], bool transpose, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 ret[3U][3U]) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 A_transpose[3U][3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { libcrux_ml_kem_matrix_sample_matrix_A_closure_4b(i, A_transpose[i]); } a8609 3 /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_seed[34U]; memcpy(copy_of_seed, seed, (size_t)34U * sizeof(uint8_t)); d8612 2 a8613 1 memcpy(seeds[i], copy_of_seed, (size_t)34U * sizeof(uint8_t)); d8620 2 a8621 5 /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_seeds[3U][34U]; memcpy(copy_of_seeds, seeds, (size_t)3U * sizeof(uint8_t[34U])); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 sampled[3U]; libcrux_ml_kem_sampling_sample_from_xof_3f(copy_of_seeds, sampled); d8626 2 a8627 2 libcrux_ml_kem_polynomial_PolynomialRingElement_f0), libcrux_ml_kem_polynomial_PolynomialRingElement_f0); d8630 1 a8630 1 libcrux_ml_kem_polynomial_PolynomialRingElement_f0 sample = sampled[j]; d8638 45 a8682 3 memcpy(ret, A_transpose, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0[3U])); d8688 3 a8690 1 libcrux_ml_kem_vector_portable_vector_type_PortableVector[3size_t], uint8_t d8693 4 a8696 4 typedef struct tuple_b0_s { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 fst[3U]; uint8_t snd; } tuple_b0; d8699 10 a8708 3 A monomorphic instance of libcrux_ml_kem.ind_cpa.sample_vector_cbd_then_ntt.closure with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, d8712 7 a8718 2 - ETA= 2 - ETA_RANDOMNESS_SIZE= 128 d8720 3 a8722 3 static inline libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_ind_cpa_sample_vector_cbd_then_ntt_closure_f7(size_t _i) { return libcrux_ml_kem_polynomial_ZERO_89_ea(); d8731 1 a8731 1 static KRML_MUSTINLINE void libcrux_ml_kem_hash_functions_portable_PRFxN_c5( d8744 2 a8745 2 This function found in impl {(libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash)} d8748 1 a8748 1 A monomorphic instance of libcrux_ml_kem.hash_functions.portable.PRFxN_f1 d8753 1 a8753 1 static KRML_MUSTINLINE void libcrux_ml_kem_hash_functions_portable_PRFxN_f1_93( d8755 1 a8755 1 libcrux_ml_kem_hash_functions_portable_PRFxN_c5(input, ret); d8813 2 a8814 2 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_sampling_sample_from_binomial_distribution_2_85( d8820 1 a8820 1 Eurydice_slice byte_chunk = Eurydice_slice_subslice2( d8822 1 a8822 1 chunk_number * (size_t)4U + (size_t)4U, uint8_t); d8838 1 a8838 1 for (uint32_t i = 0U; i < CORE_NUM__U32_8__BITS / 4U; i++) { d8849 1 a8849 46 return libcrux_ml_kem_polynomial_from_i16_array_89_c1( Eurydice_array_to_slice((size_t)256U, sampled_i16s, int16_t)); } /** A monomorphic instance of libcrux_ml_kem.sampling.sample_from_binomial_distribution_3 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_sampling_sample_from_binomial_distribution_3_eb( Eurydice_slice randomness) { int16_t sampled_i16s[256U] = {0U}; for (size_t i0 = (size_t)0U; i0 < Eurydice_slice_len(randomness, uint8_t) / (size_t)3U; i0++) { size_t chunk_number = i0; Eurydice_slice byte_chunk = Eurydice_slice_subslice2( randomness, chunk_number * (size_t)3U, chunk_number * (size_t)3U + (size_t)3U, uint8_t); uint32_t random_bits_as_u24 = ((uint32_t)Eurydice_slice_index(byte_chunk, (size_t)0U, uint8_t, uint8_t *) | (uint32_t)Eurydice_slice_index(byte_chunk, (size_t)1U, uint8_t, uint8_t *) << 8U) | (uint32_t)Eurydice_slice_index(byte_chunk, (size_t)2U, uint8_t, uint8_t *) << 16U; uint32_t first_bits = random_bits_as_u24 & 2396745U; uint32_t second_bits = random_bits_as_u24 >> 1U & 2396745U; uint32_t third_bits = random_bits_as_u24 >> 2U & 2396745U; uint32_t coin_toss_outcomes = first_bits + second_bits + third_bits; for (int32_t i = (int32_t)0; i < (int32_t)24 / (int32_t)6; i++) { int32_t outcome_set = i; int32_t outcome_set0 = outcome_set * (int32_t)6; int16_t outcome_1 = (int16_t)(coin_toss_outcomes >> (uint32_t)outcome_set0 & 7U); int16_t outcome_2 = (int16_t)(coin_toss_outcomes >> (uint32_t)(outcome_set0 + (int32_t)3) & 7U); size_t offset = (size_t)(outcome_set0 / (int32_t)6); sampled_i16s[(size_t)4U * chunk_number + offset] = outcome_1 - outcome_2; } } return libcrux_ml_kem_polynomial_from_i16_array_89_c1( d8859 2 a8860 2 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_sampling_sample_from_binomial_distribution_c6( d8862 1 a8862 1 return libcrux_ml_kem_sampling_sample_from_binomial_distribution_2_85( d8872 2 a8873 2 static KRML_MUSTINLINE void libcrux_ml_kem_ntt_ntt_at_layer_7_f4( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *re) { d8878 1 a8878 1 libcrux_ml_kem_vector_portable_multiply_by_constant_0d( d8881 1 a8881 1 libcrux_ml_kem_vector_portable_sub_0d(re->coefficients[j], &t); d8883 1 a8883 1 libcrux_ml_kem_vector_portable_add_0d(re->coefficients[j], &t); d8895 3 a8897 3 libcrux_ml_kem_ntt_ntt_binomially_sampled_ring_element_0f( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *re) { libcrux_ml_kem_ntt_ntt_at_layer_7_f4(re); d8899 13 a8911 10 libcrux_ml_kem_ntt_ntt_at_layer_4_plus_51(&zeta_i, re, (size_t)6U, (size_t)3U); libcrux_ml_kem_ntt_ntt_at_layer_4_plus_51(&zeta_i, re, (size_t)5U, (size_t)3U); libcrux_ml_kem_ntt_ntt_at_layer_4_plus_51(&zeta_i, re, (size_t)4U, (size_t)3U); libcrux_ml_kem_ntt_ntt_at_layer_3_fd(&zeta_i, re, (size_t)3U, (size_t)3U); libcrux_ml_kem_ntt_ntt_at_layer_2_ad(&zeta_i, re, (size_t)2U, (size_t)3U); libcrux_ml_kem_ntt_ntt_at_layer_1_a2(&zeta_i, re, (size_t)1U, (size_t)3U); libcrux_ml_kem_polynomial_poly_barrett_reduce_89_8b(re); d8927 4 a8930 10 static KRML_MUSTINLINE tuple_b0 libcrux_ml_kem_ind_cpa_sample_vector_cbd_then_ntt_fc(uint8_t prf_input[33U], uint8_t domain_separator) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 re_as_ntt[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { re_as_ntt[i] = libcrux_ml_kem_polynomial_ZERO_89_ea(); } /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_prf_input[33U]; memcpy(copy_of_prf_input, prf_input, (size_t)33U * sizeof(uint8_t)); d8933 2 a8934 6 memcpy(prf_inputs[i], copy_of_prf_input, (size_t)33U * sizeof(uint8_t)); } for (size_t i = (size_t)0U; i < (size_t)3U; i++) { size_t i0 = i; prf_inputs[i0][32U] = domain_separator; domain_separator = (uint32_t)domain_separator + 1U; d8936 2 d8939 1 a8939 1 libcrux_ml_kem_hash_functions_portable_PRFxN_f1_93(prf_inputs, prf_outputs); d8943 1 a8943 1 libcrux_ml_kem_sampling_sample_from_binomial_distribution_c6( d8945 1 a8945 1 libcrux_ml_kem_ntt_ntt_binomially_sampled_ring_element_0f(&re_as_ntt[i0]); d8947 1 a8947 11 /* Passing arrays by value in Rust generates a copy in C */ libcrux_ml_kem_polynomial_PolynomialRingElement_f0 copy_of_re_as_ntt[3U]; memcpy( copy_of_re_as_ntt, re_as_ntt, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); tuple_b0 lit; memcpy( lit.fst, copy_of_re_as_ntt, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); lit.snd = domain_separator; return lit; d8951 9 a8959 1 A monomorphic instance of libcrux_ml_kem.ind_cpa.sample_ring_element_cbd.closure d8964 6 a8970 1 - ETA2= 2 d8972 3 a8974 3 static inline libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_ind_cpa_sample_ring_element_cbd_closure_77(size_t _i) { return libcrux_ml_kem_polynomial_ZERO_89_ea(); d8989 4 a8992 10 static KRML_MUSTINLINE tuple_b0 libcrux_ml_kem_ind_cpa_sample_ring_element_cbd_ac(uint8_t prf_input[33U], uint8_t domain_separator) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 error_1[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { error_1[i] = libcrux_ml_kem_polynomial_ZERO_89_ea(); } /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_prf_input[33U]; memcpy(copy_of_prf_input, prf_input, (size_t)33U * sizeof(uint8_t)); d8995 2 a8996 6 memcpy(prf_inputs[i], copy_of_prf_input, (size_t)33U * sizeof(uint8_t)); } for (size_t i = (size_t)0U; i < (size_t)3U; i++) { size_t i0 = i; prf_inputs[i0][32U] = domain_separator; domain_separator = (uint32_t)domain_separator + 1U; d8998 2 d9001 1 a9001 1 libcrux_ml_kem_hash_functions_portable_PRFxN_f1_93(prf_inputs, prf_outputs); d9004 2 a9005 2 libcrux_ml_kem_polynomial_PolynomialRingElement_f0 uu____1 = libcrux_ml_kem_sampling_sample_from_binomial_distribution_c6( d9007 1 a9007 1 error_1[i0] = uu____1; d9009 1 a9009 11 /* Passing arrays by value in Rust generates a copy in C */ libcrux_ml_kem_polynomial_PolynomialRingElement_f0 copy_of_error_1[3U]; memcpy( copy_of_error_1, error_1, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); tuple_b0 lit; memcpy( lit.fst, copy_of_error_1, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); lit.snd = domain_separator; return lit; d9017 1 a9017 1 static KRML_MUSTINLINE void libcrux_ml_kem_hash_functions_portable_PRF_2b0( d9026 2 a9027 2 This function found in impl {(libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash)} d9030 1 a9030 1 A monomorphic instance of libcrux_ml_kem.hash_functions.portable.PRF_f1 d9035 1 a9035 1 static KRML_MUSTINLINE void libcrux_ml_kem_hash_functions_portable_PRF_f1_ee0( d9037 1 a9037 1 libcrux_ml_kem_hash_functions_portable_PRF_2b0(input, ret); d9041 7 a9047 1 A monomorphic instance of libcrux_ml_kem.matrix.compute_vector_u.closure d9052 4 a9055 3 static inline libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_matrix_compute_vector_u_closure_d6(size_t _i) { return libcrux_ml_kem_polynomial_ZERO_89_ea(); d9059 1 a9059 5 This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.add_error_reduce_89 d9064 3 a9066 3 static KRML_MUSTINLINE void libcrux_ml_kem_polynomial_add_error_reduce_89_38( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *self, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *error) { d9072 8 a9079 7 libcrux_ml_kem_vector_portable_montgomery_multiply_by_constant_0d( self->coefficients[j], (int16_t)1441); libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_barrett_reduce_0d( libcrux_ml_kem_vector_portable_add_0d(coefficient_normal_form, &error->coefficients[j])); self->coefficients[j] = uu____0; d9084 17 d9109 6 a9114 6 static KRML_MUSTINLINE void libcrux_ml_kem_matrix_compute_vector_u_59( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 (*a_as_ntt)[3U], libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *r_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *error_1, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 ret[3U]) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 result[3U]; d9116 4 a9119 1 result[i] = libcrux_ml_kem_polynomial_ZERO_89_ea(); d9125 2 a9126 2 libcrux_ml_kem_polynomial_PolynomialRingElement_f0[3U]), libcrux_ml_kem_polynomial_PolynomialRingElement_f0[3U]); d9129 1 a9129 1 libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *row = a_as_ntt[i1]; d9134 2 a9135 2 libcrux_ml_kem_polynomial_PolynomialRingElement_f0), libcrux_ml_kem_polynomial_PolynomialRingElement_f0); d9138 4 a9141 4 libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *a_element = &row[j]; libcrux_ml_kem_polynomial_PolynomialRingElement_f0 product = libcrux_ml_kem_polynomial_ntt_multiply_89_2a(a_element, &r_as_ntt[j]); libcrux_ml_kem_polynomial_add_to_ring_element_89_84(&result[i1], d9144 2 a9145 2 libcrux_ml_kem_invert_ntt_invert_ntt_montgomery_f6(&result[i1]); libcrux_ml_kem_polynomial_add_error_reduce_89_38(&result[i1], &error_1[i1]); d9149 1 a9149 106 (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); } /** A monomorphic instance of libcrux_ml_kem.vector.traits.decompress_1 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_traits_decompress_1_63( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_ZERO_0d(); return libcrux_ml_kem_vector_portable_bitwise_and_with_constant_0d( libcrux_ml_kem_vector_portable_sub_0d(uu____0, &v), (int16_t)1665); } /** A monomorphic instance of libcrux_ml_kem.serialize.deserialize_then_decompress_message with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_serialize_deserialize_then_decompress_message_0d( uint8_t serialized[32U]) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 re = libcrux_ml_kem_polynomial_ZERO_89_ea(); for (size_t i = (size_t)0U; i < (size_t)16U; i++) { size_t i0 = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient_compressed = libcrux_ml_kem_vector_portable_deserialize_1_0d( Eurydice_array_to_subslice2(serialized, (size_t)2U * i0, (size_t)2U * i0 + (size_t)2U, uint8_t)); libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_traits_decompress_1_63(coefficient_compressed); re.coefficients[i0] = uu____0; } return re; } /** This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.add_message_error_reduce_89 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_polynomial_add_message_error_reduce_89_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *self, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *message, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 result) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT; i++) { size_t i0 = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient_normal_form = libcrux_ml_kem_vector_portable_montgomery_multiply_by_constant_0d( result.coefficients[i0], (int16_t)1441); libcrux_ml_kem_vector_portable_vector_type_PortableVector tmp = libcrux_ml_kem_vector_portable_add_0d(self->coefficients[i0], &message->coefficients[i0]); libcrux_ml_kem_vector_portable_vector_type_PortableVector tmp0 = libcrux_ml_kem_vector_portable_add_0d(coefficient_normal_form, &tmp); libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_barrett_reduce_0d(tmp0); result.coefficients[i0] = uu____0; } return result; } /** Compute InverseNTT(tᵀ ◦ r̂) + e₂ + message */ /** A monomorphic instance of libcrux_ml_kem.matrix.compute_ring_element_v with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_matrix_compute_ring_element_v_54( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *t_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *r_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *error_2, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *message) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 result = libcrux_ml_kem_polynomial_ZERO_89_ea(); for (size_t i = (size_t)0U; i < (size_t)3U; i++) { size_t i0 = i; libcrux_ml_kem_polynomial_PolynomialRingElement_f0 product = libcrux_ml_kem_polynomial_ntt_multiply_89_2a(&t_as_ntt[i0], &r_as_ntt[i0]); libcrux_ml_kem_polynomial_add_to_ring_element_89_84(&result, &product); } libcrux_ml_kem_invert_ntt_invert_ntt_montgomery_f6(&result); result = libcrux_ml_kem_polynomial_add_message_error_reduce_89_ea( error_2, message, result); return result; d9158 2 a9159 2 libcrux_ml_kem_vector_portable_compress_compress_02( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { d9163 1 a9163 1 int16_t uu____0 = d9165 3 a9167 2 (uint8_t)(int32_t)10, (uint16_t)v.elements[i0]); v.elements[i0] = uu____0; d9169 1 a9169 1 return v; d9173 2 a9174 2 This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} d9177 1 a9177 1 A monomorphic instance of libcrux_ml_kem.vector.portable.compress_0d d9182 3 a9184 3 libcrux_ml_kem_vector_portable_compress_0d_28( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { return libcrux_ml_kem_vector_portable_compress_compress_02(v); d9194 2 a9195 2 libcrux_ml_kem_serialize_compress_then_serialize_10_fc( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *re, uint8_t ret[320U]) { d9201 2 a9202 2 libcrux_ml_kem_vector_portable_compress_0d_28( libcrux_ml_kem_vector_traits_to_unsigned_representative_db( d9205 1 a9205 64 libcrux_ml_kem_vector_portable_serialize_10_0d(coefficient, bytes); Eurydice_slice uu____0 = Eurydice_array_to_subslice2( serialized, (size_t)20U * i0, (size_t)20U * i0 + (size_t)20U, uint8_t); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)20U, bytes, uint8_t), uint8_t); } memcpy(ret, serialized, (size_t)320U * sizeof(uint8_t)); } /** A monomorphic instance of libcrux_ml_kem.vector.portable.compress.compress with const generics - COEFFICIENT_BITS= 11 */ static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_compress_compress_020( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; int16_t uu____0 = libcrux_ml_kem_vector_portable_compress_compress_ciphertext_coefficient( (uint8_t)(int32_t)11, (uint16_t)v.elements[i0]); v.elements[i0] = uu____0; } return v; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ /** A monomorphic instance of libcrux_ml_kem.vector.portable.compress_0d with const generics - COEFFICIENT_BITS= 11 */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_compress_0d_280( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { return libcrux_ml_kem_vector_portable_compress_compress_020(v); } /** A monomorphic instance of libcrux_ml_kem.serialize.compress_then_serialize_11 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - OUT_LEN= 320 */ static KRML_MUSTINLINE void libcrux_ml_kem_serialize_compress_then_serialize_11_e1( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *re, uint8_t ret[320U]) { uint8_t serialized[320U] = {0U}; for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT; i++) { size_t i0 = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient = libcrux_ml_kem_vector_portable_compress_0d_280( libcrux_ml_kem_vector_traits_to_unsigned_representative_db( re->coefficients[i0])); uint8_t bytes[22U]; libcrux_ml_kem_vector_portable_serialize_11_0d(coefficient, bytes); Eurydice_slice uu____0 = Eurydice_array_to_subslice2( serialized, (size_t)22U * i0, (size_t)22U * i0 + (size_t)22U, uint8_t); d9207 3 a9209 1 uu____0, Eurydice_array_to_slice((size_t)22U, bytes, uint8_t), uint8_t); d9222 2 a9223 2 libcrux_ml_kem_serialize_compress_then_serialize_ring_element_u_5f( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *re, uint8_t ret[320U]) { d9225 1 a9225 1 libcrux_ml_kem_serialize_compress_then_serialize_10_fc(re, uu____0); d9241 2 a9242 2 static inline void libcrux_ml_kem_ind_cpa_compress_then_serialize_u_a7( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 input[3U], d9248 2 a9249 2 libcrux_ml_kem_polynomial_PolynomialRingElement_f0), libcrux_ml_kem_polynomial_PolynomialRingElement_f0); d9252 2 a9253 2 libcrux_ml_kem_polynomial_PolynomialRingElement_f0 re = input[i0]; Eurydice_slice uu____0 = Eurydice_slice_subslice2( d9255 1 a9255 1 (i0 + (size_t)1U) * ((size_t)960U / (size_t)3U), uint8_t); d9257 1 a9257 1 libcrux_ml_kem_serialize_compress_then_serialize_ring_element_u_5f(&re, d9265 12 a9276 3 A monomorphic instance of libcrux_ml_kem.vector.portable.compress.compress with const generics - COEFFICIENT_BITS= 4 d9278 20 a9297 10 static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_compress_compress_021( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; int16_t uu____0 = libcrux_ml_kem_vector_portable_compress_compress_ciphertext_coefficient( (uint8_t)(int32_t)4, (uint16_t)v.elements[i0]); v.elements[i0] = uu____0; d9299 27 a9325 1 return v; d9329 4 a9332 2 This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} d9334 20 d9355 2 a9356 1 A monomorphic instance of libcrux_ml_kem.vector.portable.compress_0d d9358 1 a9358 1 - COEFFICIENT_BITS= 4 d9360 22 a9381 4 static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_compress_0d_281( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { return libcrux_ml_kem_vector_portable_compress_compress_021(v); d9385 6 a9390 1 A monomorphic instance of libcrux_ml_kem.serialize.compress_then_serialize_4 d9395 27 a9421 6 static KRML_MUSTINLINE void libcrux_ml_kem_serialize_compress_then_serialize_4_9a( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 re, Eurydice_slice serialized) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT; i++) { d9423 4 a9426 10 libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient = libcrux_ml_kem_vector_portable_compress_0d_281( libcrux_ml_kem_vector_traits_to_unsigned_representative_db( re.coefficients[i0])); uint8_t bytes[8U]; libcrux_ml_kem_vector_portable_serialize_4_0d(coefficient, bytes); Eurydice_slice_copy( Eurydice_slice_subslice2(serialized, (size_t)8U * i0, (size_t)8U * i0 + (size_t)8U, uint8_t), Eurydice_array_to_slice((size_t)8U, bytes, uint8_t), uint8_t); d9428 3 d9436 1 a9436 1 - COEFFICIENT_BITS= 5 d9439 2 a9440 2 libcrux_ml_kem_vector_portable_compress_compress_022( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { d9444 1 a9444 1 int16_t uu____0 = d9446 3 a9448 2 (uint8_t)(int32_t)5, (uint16_t)v.elements[i0]); v.elements[i0] = uu____0; d9450 1 a9450 1 return v; d9454 2 a9455 2 This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} d9458 1 a9458 1 A monomorphic instance of libcrux_ml_kem.vector.portable.compress_0d d9460 1 a9460 1 - COEFFICIENT_BITS= 5 d9463 3 a9465 3 libcrux_ml_kem_vector_portable_compress_0d_282( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { return libcrux_ml_kem_vector_portable_compress_compress_022(v); d9469 1 a9469 1 A monomorphic instance of libcrux_ml_kem.serialize.compress_then_serialize_5 d9475 2 a9476 2 libcrux_ml_kem_serialize_compress_then_serialize_5_1f( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 re, d9481 3 a9483 3 libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficients = libcrux_ml_kem_vector_portable_compress_0d_282( libcrux_ml_kem_vector_traits_to_unsigned_representative_db( d9485 2 a9486 2 uint8_t bytes[10U]; libcrux_ml_kem_vector_portable_serialize_5_0d(coefficients, bytes); d9488 3 a9490 3 Eurydice_slice_subslice2(serialized, (size_t)10U * i0, (size_t)10U * i0 + (size_t)10U, uint8_t), Eurydice_array_to_slice((size_t)10U, bytes, uint8_t), uint8_t); d9498 1 d9503 25 a9527 3 libcrux_ml_kem_serialize_compress_then_serialize_ring_element_v_4e( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 re, Eurydice_slice out) { libcrux_ml_kem_serialize_compress_then_serialize_4_9a(re, out); d9531 42 a9572 1 A monomorphic instance of libcrux_ml_kem.ind_cpa.encrypt d9589 3 a9591 54 static inline void libcrux_ml_kem_ind_cpa_encrypt_60(Eurydice_slice public_key, uint8_t message[32U], Eurydice_slice randomness, uint8_t ret[1088U]) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 t_as_ntt[3U]; libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_33( Eurydice_slice_subslice_to(public_key, (size_t)1152U, uint8_t, size_t), t_as_ntt); Eurydice_slice seed = Eurydice_slice_subslice_from(public_key, (size_t)1152U, uint8_t, size_t); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 A[3U][3U]; uint8_t ret0[34U]; libcrux_ml_kem_utils_into_padded_array_ea1(seed, ret0); libcrux_ml_kem_matrix_sample_matrix_A_38(ret0, false, A); uint8_t prf_input[33U]; libcrux_ml_kem_utils_into_padded_array_ea2(randomness, prf_input); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_prf_input0[33U]; memcpy(copy_of_prf_input0, prf_input, (size_t)33U * sizeof(uint8_t)); tuple_b0 uu____1 = libcrux_ml_kem_ind_cpa_sample_vector_cbd_then_ntt_fc( copy_of_prf_input0, 0U); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 r_as_ntt[3U]; memcpy( r_as_ntt, uu____1.fst, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); uint8_t domain_separator0 = uu____1.snd; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_prf_input[33U]; memcpy(copy_of_prf_input, prf_input, (size_t)33U * sizeof(uint8_t)); tuple_b0 uu____3 = libcrux_ml_kem_ind_cpa_sample_ring_element_cbd_ac( copy_of_prf_input, domain_separator0); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 error_1[3U]; memcpy( error_1, uu____3.fst, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); uint8_t domain_separator = uu____3.snd; prf_input[32U] = domain_separator; uint8_t prf_output[128U]; libcrux_ml_kem_hash_functions_portable_PRF_f1_ee0( Eurydice_array_to_slice((size_t)33U, prf_input, uint8_t), prf_output); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 error_2 = libcrux_ml_kem_sampling_sample_from_binomial_distribution_c6( Eurydice_array_to_slice((size_t)128U, prf_output, uint8_t)); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 u[3U]; libcrux_ml_kem_matrix_compute_vector_u_59(A, r_as_ntt, error_1, u); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_message[32U]; memcpy(copy_of_message, message, (size_t)32U * sizeof(uint8_t)); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 message_as_ring_element = libcrux_ml_kem_serialize_deserialize_then_decompress_message_0d( copy_of_message); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 v = libcrux_ml_kem_matrix_compute_ring_element_v_54( t_as_ntt, r_as_ntt, &error_2, &message_as_ring_element); d9593 5 a9597 1 libcrux_ml_kem_polynomial_PolynomialRingElement_f0 uu____5[3U]; d9599 12 a9610 9 uu____5, u, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); libcrux_ml_kem_ind_cpa_compress_then_serialize_u_a7( uu____5, Eurydice_array_to_subslice2(ciphertext, (size_t)0U, (size_t)960U, uint8_t)); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 uu____6 = v; libcrux_ml_kem_serialize_compress_then_serialize_ring_element_v_4e( uu____6, Eurydice_array_to_subslice_from((size_t)1088U, ciphertext, (size_t)960U, uint8_t, size_t)); d9615 32 a9646 2 This function found in impl {(libcrux_ml_kem::variant::Variant for libcrux_ml_kem::variant::MlKem)#1} d9649 1 a9649 1 A monomorphic instance of libcrux_ml_kem.variant.kdf_d8 d9655 2 a9656 3 static KRML_MUSTINLINE void libcrux_ml_kem_variant_kdf_d8_41( Eurydice_slice shared_secret, libcrux_ml_kem_mlkem768_MlKem768Ciphertext *_, uint8_t ret[32U]) { d9664 3 d9688 2 a9689 2 static inline void libcrux_ml_kem_ind_cca_decapsulate_70( libcrux_ml_kem_types_MlKemPrivateKey_55 *private_key, d9691 3 a9693 3 Eurydice_slice_uint8_t_x2 uu____0 = Eurydice_slice_split_at( Eurydice_array_to_slice((size_t)2400U, private_key->value, uint8_t), (size_t)1152U, uint8_t, Eurydice_slice_uint8_t_x2); d9695 3 a9697 10 Eurydice_slice secret_key0 = uu____0.snd; Eurydice_slice_uint8_t_x2 uu____1 = Eurydice_slice_split_at( secret_key0, (size_t)1184U, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice ind_cpa_public_key = uu____1.fst; Eurydice_slice secret_key = uu____1.snd; Eurydice_slice_uint8_t_x2 uu____2 = Eurydice_slice_split_at( secret_key, LIBCRUX_ML_KEM_CONSTANTS_H_DIGEST_SIZE, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice ind_cpa_public_key_hash = uu____2.fst; Eurydice_slice implicit_rejection_value = uu____2.snd; d9699 1 a9699 1 libcrux_ml_kem_ind_cpa_decrypt_43(ind_cpa_secret_key, ciphertext->value, d9702 1 a9702 1 libcrux_ml_kem_utils_into_padded_array_ea( d9707 1 a9707 1 uint8_t, size_t), d9710 1 a9710 1 libcrux_ml_kem_hash_functions_portable_G_f1_e4( d9712 1 a9712 1 Eurydice_slice_uint8_t_x2 uu____3 = Eurydice_slice_split_at( d9716 2 a9717 2 Eurydice_slice shared_secret0 = uu____3.fst; Eurydice_slice pseudorandomness = uu____3.snd; d9719 2 a9720 2 libcrux_ml_kem_utils_into_padded_array_ea0(implicit_rejection_value, to_hash); Eurydice_slice uu____4 = Eurydice_array_to_subslice_from( d9722 2 a9723 2 uint8_t, size_t); Eurydice_slice_copy(uu____4, libcrux_ml_kem_types_as_ref_00_24(ciphertext), d9726 1 a9726 1 libcrux_ml_kem_hash_functions_portable_PRF_f1_ee( a9728 4 Eurydice_slice uu____5 = ind_cpa_public_key; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_decrypted[32U]; memcpy(copy_of_decrypted, decrypted, (size_t)32U * sizeof(uint8_t)); d9730 1 a9730 1 libcrux_ml_kem_ind_cpa_encrypt_60(uu____5, copy_of_decrypted, d9733 1 a9733 1 libcrux_ml_kem_variant_kdf_d8_41( d9736 2 a9737 1 ciphertext, implicit_rejection_shared_secret); d9739 3 a9741 1 libcrux_ml_kem_variant_kdf_d8_41(shared_secret0, ciphertext, shared_secret); d9744 1 a9744 1 libcrux_ml_kem_types_as_ref_00_24(ciphertext), d9777 2 a9778 2 libcrux_ml_kem_ind_cca_instantiations_portable_decapsulate_2e( libcrux_ml_kem_types_MlKemPrivateKey_55 *private_key, d9780 1 a9780 1 libcrux_ml_kem_ind_cca_decapsulate_70(private_key, ciphertext, ret); d9791 1 a9791 1 libcrux_ml_kem_types_MlKemPrivateKey_55 *private_key, d9793 1 a9793 1 libcrux_ml_kem_ind_cca_instantiations_portable_decapsulate_2e( d9798 2 a9799 2 This function found in impl {(libcrux_ml_kem::variant::Variant for libcrux_ml_kem::variant::MlKem)#1} d9802 1 a9802 1 A monomorphic instance of libcrux_ml_kem.variant.entropy_preprocess_d8 d9807 1 a9807 1 static KRML_MUSTINLINE void libcrux_ml_kem_variant_entropy_preprocess_d8_63( d9816 2 a9817 2 This function found in impl {(libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash)} d9820 1 a9820 1 A monomorphic instance of libcrux_ml_kem.hash_functions.portable.H_f1 d9824 1 a9824 1 static KRML_MUSTINLINE void libcrux_ml_kem_hash_functions_portable_H_f1_1a( d9842 1 a9842 1 - VECTOR_U_BLOCK_LEN= 320 d9848 2 a9849 3 static inline tuple_3c libcrux_ml_kem_ind_cca_encapsulate_cd( libcrux_ml_kem_types_MlKemPublicKey_15 *public_key, uint8_t randomness[32U]) { d9851 1 a9851 1 libcrux_ml_kem_variant_entropy_preprocess_d8_63( d9854 1 a9854 1 libcrux_ml_kem_utils_into_padded_array_ea( d9858 3 a9860 3 size_t); uint8_t ret[32U]; libcrux_ml_kem_hash_functions_portable_H_f1_1a( d9862 1 a9862 1 libcrux_ml_kem_types_as_slice_cb_50(public_key), d9864 1 a9864 1 ret); d9866 1 a9866 1 uu____0, Eurydice_array_to_slice((size_t)32U, ret, uint8_t), uint8_t); d9868 1 a9868 1 libcrux_ml_kem_hash_functions_portable_G_f1_e4( a9875 5 Eurydice_slice uu____2 = Eurydice_array_to_slice( (size_t)1184U, libcrux_ml_kem_types_as_slice_cb_50(public_key), uint8_t); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_randomness[32U]; memcpy(copy_of_randomness, randomness0, (size_t)32U * sizeof(uint8_t)); d9877 5 a9881 2 libcrux_ml_kem_ind_cpa_encrypt_60(uu____2, copy_of_randomness, pseudorandomness, ciphertext); d9885 5 a9889 13 libcrux_ml_kem_mlkem768_MlKem768Ciphertext ciphertext0 = libcrux_ml_kem_types_from_01_9f(copy_of_ciphertext); uint8_t shared_secret_array[32U]; libcrux_ml_kem_variant_kdf_d8_41(shared_secret, &ciphertext0, shared_secret_array); libcrux_ml_kem_mlkem768_MlKem768Ciphertext uu____5 = ciphertext0; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_shared_secret_array[32U]; memcpy(copy_of_shared_secret_array, shared_secret_array, (size_t)32U * sizeof(uint8_t)); tuple_3c lit; lit.fst = uu____5; memcpy(lit.snd, copy_of_shared_secret_array, (size_t)32U * sizeof(uint8_t)); d9904 1 a9904 1 - VECTOR_U_BLOCK_LEN= 320 d9910 4 a9913 9 static inline tuple_3c libcrux_ml_kem_ind_cca_instantiations_portable_encapsulate_c6( libcrux_ml_kem_types_MlKemPublicKey_15 *public_key, uint8_t randomness[32U]) { libcrux_ml_kem_types_MlKemPublicKey_15 *uu____0 = public_key; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_randomness[32U]; memcpy(copy_of_randomness, randomness, (size_t)32U * sizeof(uint8_t)); return libcrux_ml_kem_ind_cca_encapsulate_cd(uu____0, copy_of_randomness); d9923 2 a9924 2 static inline tuple_3c libcrux_ml_kem_mlkem768_portable_encapsulate( libcrux_ml_kem_types_MlKemPublicKey_15 *public_key, d9926 26 a9951 6 libcrux_ml_kem_types_MlKemPublicKey_15 *uu____0 = public_key; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_randomness[32U]; memcpy(copy_of_randomness, randomness, (size_t)32U * sizeof(uint8_t)); return libcrux_ml_kem_ind_cca_instantiations_portable_encapsulate_c6( uu____0, copy_of_randomness); d9955 2 a9956 2 This function found in impl {(libcrux_ml_kem::variant::Variant for libcrux_ml_kem::variant::MlKem)#1} d9959 1 a9959 1 A monomorphic instance of libcrux_ml_kem.variant.cpa_keygen_seed_d8 d9964 1 a9964 1 static KRML_MUSTINLINE void libcrux_ml_kem_variant_cpa_keygen_seed_d8_0e( d9968 1 a9968 1 Eurydice_array_to_subslice2( d9970 1 a9970 1 LIBCRUX_ML_KEM_CONSTANTS_CPA_PKE_KEY_GENERATION_SEED_SIZE, uint8_t), d9975 1 a9975 1 libcrux_ml_kem_hash_functions_portable_G_f1_e4( d9981 13 a9993 3 A monomorphic instance of libcrux_ml_kem.matrix.compute_As_plus_e.closure with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics d9995 2 d9998 4 a10001 3 static inline libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_matrix_compute_As_plus_e_closure_87(size_t _i) { return libcrux_ml_kem_polynomial_ZERO_89_ea(); d10005 1 a10005 1 A monomorphic instance of libcrux_ml_kem.vector.traits.to_standard_domain d10010 6 a10015 5 static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_traits_to_standard_domain_59( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { return libcrux_ml_kem_vector_portable_montgomery_multiply_by_constant_0d( v, LIBCRUX_ML_KEM_VECTOR_TRAITS_MONTGOMERY_R_SQUARED_MOD_FIELD_MODULUS); d10019 1 a10019 5 This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.add_standard_error_reduce_89 d10025 3 a10027 3 libcrux_ml_kem_polynomial_add_standard_error_reduce_89_03( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *self, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *error) { d10033 8 a10040 7 libcrux_ml_kem_vector_traits_to_standard_domain_59( self->coefficients[j]); libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_barrett_reduce_0d( libcrux_ml_kem_vector_portable_add_0d(coefficient_normal_form, &error->coefficients[j])); self->coefficients[j] = uu____0; d10045 3 a10047 1 Compute  ◦ ŝ + ê d10050 1 a10050 1 A monomorphic instance of libcrux_ml_kem.matrix.compute_As_plus_e a10052 48 - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_matrix_compute_As_plus_e_60( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 (*matrix_A)[3U], libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *s_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *error_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 ret[3U]) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 result[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { result[i] = libcrux_ml_kem_polynomial_ZERO_89_ea(); } for (size_t i0 = (size_t)0U; i0 < Eurydice_slice_len( Eurydice_array_to_slice( (size_t)3U, matrix_A, libcrux_ml_kem_polynomial_PolynomialRingElement_f0[3U]), libcrux_ml_kem_polynomial_PolynomialRingElement_f0[3U]); i0++) { size_t i1 = i0; libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *row = matrix_A[i1]; for (size_t i = (size_t)0U; i < Eurydice_slice_len( Eurydice_array_to_slice( (size_t)3U, row, libcrux_ml_kem_polynomial_PolynomialRingElement_f0), libcrux_ml_kem_polynomial_PolynomialRingElement_f0); i++) { size_t j = i; libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *matrix_element = &row[j]; libcrux_ml_kem_polynomial_PolynomialRingElement_f0 product = libcrux_ml_kem_polynomial_ntt_multiply_89_2a(matrix_element, &s_as_ntt[j]); libcrux_ml_kem_polynomial_add_to_ring_element_89_84(&result[i1], &product); } libcrux_ml_kem_polynomial_add_standard_error_reduce_89_03( &result[i1], &error_as_ntt[i1]); } memcpy( ret, result, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); } /** A monomorphic instance of libcrux_ml_kem.serialize.serialize_uncompressed_ring_element with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics d10056 4 a10059 17 libcrux_ml_kem_serialize_serialize_uncompressed_ring_element_5b( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *re, uint8_t ret[384U]) { uint8_t serialized[384U] = {0U}; for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT; i++) { size_t i0 = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient = libcrux_ml_kem_vector_traits_to_unsigned_representative_db( re->coefficients[i0]); uint8_t bytes[24U]; libcrux_ml_kem_vector_portable_serialize_12_0d(coefficient, bytes); Eurydice_slice uu____0 = Eurydice_array_to_subslice2( serialized, (size_t)24U * i0, (size_t)24U * i0 + (size_t)24U, uint8_t); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)24U, bytes, uint8_t), uint8_t); } memcpy(ret, serialized, (size_t)384U * sizeof(uint8_t)); d10063 1 a10063 1 Call [`serialize_uncompressed_ring_element`] for each ring element. d10066 1 a10066 1 A monomorphic instance of libcrux_ml_kem.ind_cpa.serialize_secret_key a10069 1 - OUT_LEN= 1152 d10071 5 a10075 4 static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_serialize_secret_key_b5( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *key, uint8_t ret[1152U]) { uint8_t out[1152U] = {0U}; d10079 3 a10081 3 (size_t)3U, key, libcrux_ml_kem_polynomial_PolynomialRingElement_f0), libcrux_ml_kem_polynomial_PolynomialRingElement_f0); d10084 22 a10105 9 libcrux_ml_kem_polynomial_PolynomialRingElement_f0 re = key[i0]; Eurydice_slice uu____0 = Eurydice_array_to_subslice2( out, i0 * LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT, (i0 + (size_t)1U) * LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT, uint8_t); uint8_t ret0[384U]; libcrux_ml_kem_serialize_serialize_uncompressed_ring_element_5b(&re, ret0); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)384U, ret0, uint8_t), uint8_t); d10107 178 a10284 1 memcpy(ret, out, (size_t)1152U * sizeof(uint8_t)); a10294 1 - RANKED_BYTES_PER_RING_ELEMENT= 1152 d10297 2 a10298 2 static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_serialize_public_key_79( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *t_as_ntt, d10301 2 a10302 10 Eurydice_slice uu____0 = Eurydice_array_to_subslice2( public_key_serialized, (size_t)0U, (size_t)1152U, uint8_t); uint8_t ret0[1152U]; libcrux_ml_kem_ind_cpa_serialize_secret_key_b5(t_as_ntt, ret0); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)1152U, ret0, uint8_t), uint8_t); Eurydice_slice_copy( Eurydice_array_to_subslice_from((size_t)1184U, public_key_serialized, (size_t)1152U, uint8_t, size_t), seed_for_a, uint8_t); d10307 6 a10312 4 A monomorphic instance of libcrux_ml_kem.ind_cpa.generate_keypair with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]], libcrux_ml_kem_variant_MlKem with const generics a10315 3 - RANKED_BYTES_PER_RING_ELEMENT= 1152 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 d10318 3 a10320 42 libcrux_ml_kem_ind_cpa_generate_keypair_fc(Eurydice_slice key_generation_seed) { uint8_t hashed[64U]; libcrux_ml_kem_variant_cpa_keygen_seed_d8_0e(key_generation_seed, hashed); Eurydice_slice_uint8_t_x2 uu____0 = Eurydice_slice_split_at( Eurydice_array_to_slice((size_t)64U, hashed, uint8_t), (size_t)32U, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice seed_for_A0 = uu____0.fst; Eurydice_slice seed_for_secret_and_error = uu____0.snd; libcrux_ml_kem_polynomial_PolynomialRingElement_f0 A_transpose[3U][3U]; uint8_t ret[34U]; libcrux_ml_kem_utils_into_padded_array_ea1(seed_for_A0, ret); libcrux_ml_kem_matrix_sample_matrix_A_38(ret, true, A_transpose); uint8_t prf_input[33U]; libcrux_ml_kem_utils_into_padded_array_ea2(seed_for_secret_and_error, prf_input); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_prf_input0[33U]; memcpy(copy_of_prf_input0, prf_input, (size_t)33U * sizeof(uint8_t)); tuple_b0 uu____2 = libcrux_ml_kem_ind_cpa_sample_vector_cbd_then_ntt_fc( copy_of_prf_input0, 0U); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 secret_as_ntt[3U]; memcpy( secret_as_ntt, uu____2.fst, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); uint8_t domain_separator = uu____2.snd; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_prf_input[33U]; memcpy(copy_of_prf_input, prf_input, (size_t)33U * sizeof(uint8_t)); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 error_as_ntt[3U]; memcpy( error_as_ntt, libcrux_ml_kem_ind_cpa_sample_vector_cbd_then_ntt_fc(copy_of_prf_input, domain_separator) .fst, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 t_as_ntt[3U]; libcrux_ml_kem_matrix_compute_As_plus_e_60(A_transpose, secret_as_ntt, error_as_ntt, t_as_ntt); uint8_t seed_for_A[32U]; Result_00 dst; Eurydice_slice_to_array2(&dst, seed_for_A0, Eurydice_slice, uint8_t[32U]); unwrap_41_83(dst, seed_for_A); d10322 3 a10324 2 libcrux_ml_kem_ind_cpa_serialize_public_key_79( t_as_ntt, Eurydice_array_to_slice((size_t)32U, seed_for_A, uint8_t), d10326 4 a10329 3 uint8_t secret_key_serialized[1152U]; libcrux_ml_kem_ind_cpa_serialize_secret_key_b5(secret_as_ntt, secret_key_serialized); d10347 23 d10373 1 a10373 1 A monomorphic instance of libcrux_ml_kem.ind_cca.serialize_kem_secret_key d10379 2 a10380 1 static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_serialize_kem_secret_key_48( d10382 1 a10382 2 Eurydice_slice implicit_rejection_value, uint8_t ret[2400U]) { uint8_t out[2400U] = {0U}; d10384 1 a10384 1 uint8_t *uu____0 = out; d10388 1 a10388 1 Eurydice_array_to_subslice2( d10390 1 a10390 1 uint8_t), d10393 1 a10393 1 uint8_t *uu____3 = out; d10397 1 a10397 1 Eurydice_array_to_subslice2( d10399 1 a10399 1 uint8_t), d10402 5 a10406 4 Eurydice_slice uu____6 = Eurydice_array_to_subslice2( out, pointer, pointer + LIBCRUX_ML_KEM_CONSTANTS_H_DIGEST_SIZE, uint8_t); uint8_t ret0[32U]; libcrux_ml_kem_hash_functions_portable_H_f1_1a(public_key, ret0); d10408 1 a10408 1 uu____6, Eurydice_array_to_slice((size_t)32U, ret0, uint8_t), uint8_t); d10410 1 a10410 1 uint8_t *uu____7 = out; d10414 1 a10414 1 Eurydice_array_to_subslice2( d10417 1 a10417 1 uint8_t), d10419 15 a10453 1 - BYTES_PER_RING_ELEMENT= 1152 d10457 3 a10459 3 static inline libcrux_ml_kem_mlkem768_MlKem768KeyPair libcrux_ml_kem_ind_cca_generate_keypair_8c(uint8_t randomness[64U]) { Eurydice_slice ind_cpa_keypair_randomness = Eurydice_array_to_subslice2( d10461 1 a10461 1 LIBCRUX_ML_KEM_CONSTANTS_CPA_PKE_KEY_GENERATION_SEED_SIZE, uint8_t); d10465 1 a10465 1 size_t); d10467 1 a10467 1 libcrux_ml_kem_ind_cpa_generate_keypair_fc(ind_cpa_keypair_randomness); d10473 1 a10473 1 libcrux_ml_kem_ind_cca_serialize_kem_secret_key_48( d10481 3 a10483 3 libcrux_ml_kem_types_MlKemPrivateKey_55 private_key = libcrux_ml_kem_types_from_05_f2(copy_of_secret_key_serialized); libcrux_ml_kem_types_MlKemPrivateKey_55 uu____2 = private_key; d10487 2 a10488 2 return libcrux_ml_kem_types_from_17_35( uu____2, libcrux_ml_kem_types_from_b6_da(copy_of_public_key)); a10501 1 - BYTES_PER_RING_ELEMENT= 1152 d10506 3 a10508 6 libcrux_ml_kem_ind_cca_instantiations_portable_generate_keypair_d5( uint8_t randomness[64U]) { /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_randomness[64U]; memcpy(copy_of_randomness, randomness, (size_t)64U * sizeof(uint8_t)); return libcrux_ml_kem_ind_cca_generate_keypair_8c(copy_of_randomness); d10516 2 a10517 5 /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_randomness[64U]; memcpy(copy_of_randomness, randomness, (size_t)64U * sizeof(uint8_t)); return libcrux_ml_kem_ind_cca_instantiations_portable_generate_keypair_d5( copy_of_randomness); d10521 3 a10523 2 This function found in impl {(libcrux_ml_kem::variant::Variant for libcrux_ml_kem::variant::Kyber)} d10526 1 a10526 1 A monomorphic instance of libcrux_ml_kem.variant.kdf_33 d10530 1 a10530 1 - CIPHERTEXT_SIZE= 1088 d10532 12 a10543 20 static KRML_MUSTINLINE void libcrux_ml_kem_variant_kdf_33_f0( Eurydice_slice shared_secret, libcrux_ml_kem_mlkem768_MlKem768Ciphertext *ciphertext, uint8_t ret[32U]) { uint8_t kdf_input[64U]; libcrux_ml_kem_utils_into_padded_array_ea(shared_secret, kdf_input); Eurydice_slice uu____0 = Eurydice_array_to_subslice_from( (size_t)64U, kdf_input, LIBCRUX_ML_KEM_CONSTANTS_H_DIGEST_SIZE, uint8_t, size_t); uint8_t ret0[32U]; libcrux_ml_kem_hash_functions_portable_H_f1_1a( Eurydice_array_to_slice((size_t)1088U, libcrux_ml_kem_types_as_slice_d4_1d(ciphertext), uint8_t), ret0); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)32U, ret0, uint8_t), uint8_t); uint8_t ret1[32U]; libcrux_ml_kem_hash_functions_portable_PRF_f1_ee( Eurydice_array_to_slice((size_t)64U, kdf_input, uint8_t), ret1); memcpy(ret, ret1, (size_t)32U * sizeof(uint8_t)); d10547 10 a10556 4 A monomorphic instance of libcrux_ml_kem.ind_cca.decapsulate with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]], libcrux_ml_kem_variant_Kyber with const generics a10558 2 - CPA_SECRET_KEY_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 a10559 11 - T_AS_NTT_ENCODED_SIZE= 1152 - C1_SIZE= 960 - C2_SIZE= 128 - VECTOR_U_COMPRESSION_FACTOR= 10 - VECTOR_V_COMPRESSION_FACTOR= 4 - C1_BLOCK_SIZE= 320 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 - ETA2= 2 - ETA2_RANDOMNESS_SIZE= 128 - IMPLICIT_REJECTION_HASH_INPUT_SIZE= 1120 d10561 4 a10564 71 static inline void libcrux_ml_kem_ind_cca_decapsulate_700( libcrux_ml_kem_types_MlKemPrivateKey_55 *private_key, libcrux_ml_kem_mlkem768_MlKem768Ciphertext *ciphertext, uint8_t ret[32U]) { Eurydice_slice_uint8_t_x2 uu____0 = Eurydice_slice_split_at( Eurydice_array_to_slice((size_t)2400U, private_key->value, uint8_t), (size_t)1152U, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice ind_cpa_secret_key = uu____0.fst; Eurydice_slice secret_key0 = uu____0.snd; Eurydice_slice_uint8_t_x2 uu____1 = Eurydice_slice_split_at( secret_key0, (size_t)1184U, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice ind_cpa_public_key = uu____1.fst; Eurydice_slice secret_key = uu____1.snd; Eurydice_slice_uint8_t_x2 uu____2 = Eurydice_slice_split_at( secret_key, LIBCRUX_ML_KEM_CONSTANTS_H_DIGEST_SIZE, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice ind_cpa_public_key_hash = uu____2.fst; Eurydice_slice implicit_rejection_value = uu____2.snd; uint8_t decrypted[32U]; libcrux_ml_kem_ind_cpa_decrypt_43(ind_cpa_secret_key, ciphertext->value, decrypted); uint8_t to_hash0[64U]; libcrux_ml_kem_utils_into_padded_array_ea( Eurydice_array_to_slice((size_t)32U, decrypted, uint8_t), to_hash0); Eurydice_slice_copy( Eurydice_array_to_subslice_from( (size_t)64U, to_hash0, LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE, uint8_t, size_t), ind_cpa_public_key_hash, uint8_t); uint8_t hashed[64U]; libcrux_ml_kem_hash_functions_portable_G_f1_e4( Eurydice_array_to_slice((size_t)64U, to_hash0, uint8_t), hashed); Eurydice_slice_uint8_t_x2 uu____3 = Eurydice_slice_split_at( Eurydice_array_to_slice((size_t)64U, hashed, uint8_t), LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice shared_secret0 = uu____3.fst; Eurydice_slice pseudorandomness = uu____3.snd; uint8_t to_hash[1120U]; libcrux_ml_kem_utils_into_padded_array_ea0(implicit_rejection_value, to_hash); Eurydice_slice uu____4 = Eurydice_array_to_subslice_from( (size_t)1120U, to_hash, LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE, uint8_t, size_t); Eurydice_slice_copy(uu____4, libcrux_ml_kem_types_as_ref_00_24(ciphertext), uint8_t); uint8_t implicit_rejection_shared_secret0[32U]; libcrux_ml_kem_hash_functions_portable_PRF_f1_ee( Eurydice_array_to_slice((size_t)1120U, to_hash, uint8_t), implicit_rejection_shared_secret0); Eurydice_slice uu____5 = ind_cpa_public_key; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_decrypted[32U]; memcpy(copy_of_decrypted, decrypted, (size_t)32U * sizeof(uint8_t)); uint8_t expected_ciphertext[1088U]; libcrux_ml_kem_ind_cpa_encrypt_60(uu____5, copy_of_decrypted, pseudorandomness, expected_ciphertext); uint8_t implicit_rejection_shared_secret[32U]; libcrux_ml_kem_variant_kdf_33_f0( Eurydice_array_to_slice((size_t)32U, implicit_rejection_shared_secret0, uint8_t), ciphertext, implicit_rejection_shared_secret); uint8_t shared_secret[32U]; libcrux_ml_kem_variant_kdf_33_f0(shared_secret0, ciphertext, shared_secret); uint8_t ret0[32U]; libcrux_ml_kem_constant_time_ops_compare_ciphertexts_select_shared_secret_in_constant_time( libcrux_ml_kem_types_as_ref_00_24(ciphertext), Eurydice_array_to_slice((size_t)1088U, expected_ciphertext, uint8_t), Eurydice_array_to_slice((size_t)32U, shared_secret, uint8_t), Eurydice_array_to_slice((size_t)32U, implicit_rejection_shared_secret, uint8_t), ret0); memcpy(ret, ret0, (size_t)32U * sizeof(uint8_t)); d10568 1 a10568 1 Portable decapsulate d10572 1 a10572 1 libcrux_ml_kem.ind_cca.instantiations.portable.kyber_decapsulate with const a10575 2 - CPA_SECRET_KEY_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 a10576 11 - T_AS_NTT_ENCODED_SIZE= 1152 - C1_SIZE= 960 - C2_SIZE= 128 - VECTOR_U_COMPRESSION_FACTOR= 10 - VECTOR_V_COMPRESSION_FACTOR= 4 - C1_BLOCK_SIZE= 320 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 - ETA2= 2 - ETA2_RANDOMNESS_SIZE= 128 - IMPLICIT_REJECTION_HASH_INPUT_SIZE= 1120 d10578 299 a10876 3 static inline void libcrux_ml_kem_ind_cca_instantiations_portable_kyber_decapsulate_fc( libcrux_ml_kem_types_MlKemPrivateKey_55 *private_key, d10878 1 a10878 1 libcrux_ml_kem_ind_cca_decapsulate_700(private_key, ciphertext, ret); d10882 1 a10882 1 Decapsulate Kyber 768 d10885 2 a10886 2 The input is a reference to an [`MlKem768PrivateKey`] and an [`MlKem768Ciphertext`]. d10888 3 a10890 2 static inline void libcrux_ml_kem_mlkem768_portable_kyber_decapsulate( libcrux_ml_kem_types_MlKemPrivateKey_55 *private_key, d10892 1 a10892 1 libcrux_ml_kem_ind_cca_instantiations_portable_kyber_decapsulate_fc( d10897 1 a10897 5 This function found in impl {(libcrux_ml_kem::variant::Variant for libcrux_ml_kem::variant::Kyber)} */ /** A monomorphic instance of libcrux_ml_kem.variant.entropy_preprocess_33 d10902 13 a10914 3 static KRML_MUSTINLINE void libcrux_ml_kem_variant_entropy_preprocess_33_8a( Eurydice_slice randomness, uint8_t ret[32U]) { libcrux_ml_kem_hash_functions_portable_H_f1_1a(randomness, ret); d10918 1 a10918 1 A monomorphic instance of libcrux_ml_kem.ind_cca.encapsulate d10920 2 a10921 2 libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]], libcrux_ml_kem_variant_Kyber with const generics d10936 7 a10942 16 static inline tuple_3c libcrux_ml_kem_ind_cca_encapsulate_cd0( libcrux_ml_kem_types_MlKemPublicKey_15 *public_key, uint8_t randomness[32U]) { uint8_t randomness0[32U]; libcrux_ml_kem_variant_entropy_preprocess_33_8a( Eurydice_array_to_slice((size_t)32U, randomness, uint8_t), randomness0); uint8_t to_hash[64U]; libcrux_ml_kem_utils_into_padded_array_ea( Eurydice_array_to_slice((size_t)32U, randomness0, uint8_t), to_hash); Eurydice_slice uu____0 = Eurydice_array_to_subslice_from( (size_t)64U, to_hash, LIBCRUX_ML_KEM_CONSTANTS_H_DIGEST_SIZE, uint8_t, size_t); uint8_t ret[32U]; libcrux_ml_kem_hash_functions_portable_H_f1_1a( Eurydice_array_to_slice((size_t)1184U, libcrux_ml_kem_types_as_slice_cb_50(public_key), d10944 2 a10945 7 ret); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)32U, ret, uint8_t), uint8_t); uint8_t hashed[64U]; libcrux_ml_kem_hash_functions_portable_G_f1_e4( Eurydice_array_to_slice((size_t)64U, to_hash, uint8_t), hashed); Eurydice_slice_uint8_t_x2 uu____1 = Eurydice_slice_split_at( d10949 2 a10950 7 Eurydice_slice shared_secret = uu____1.fst; Eurydice_slice pseudorandomness = uu____1.snd; Eurydice_slice uu____2 = Eurydice_array_to_slice( (size_t)1184U, libcrux_ml_kem_types_as_slice_cb_50(public_key), uint8_t); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_randomness[32U]; memcpy(copy_of_randomness, randomness0, (size_t)32U * sizeof(uint8_t)); d10952 7 a10958 2 libcrux_ml_kem_ind_cpa_encrypt_60(uu____2, copy_of_randomness, pseudorandomness, ciphertext); d10962 2 a10963 6 libcrux_ml_kem_mlkem768_MlKem768Ciphertext ciphertext0 = libcrux_ml_kem_types_from_01_9f(copy_of_ciphertext); uint8_t shared_secret_array[32U]; libcrux_ml_kem_variant_kdf_33_f0(shared_secret, &ciphertext0, shared_secret_array); libcrux_ml_kem_mlkem768_MlKem768Ciphertext uu____5 = ciphertext0; d10968 2 a10969 2 tuple_3c lit; lit.fst = uu____5; d10975 1 a10975 1 Portable encapsulate d10979 1 a10979 1 libcrux_ml_kem.ind_cca.instantiations.portable.kyber_encapsulate with const d10995 17 a11011 3 static inline tuple_3c libcrux_ml_kem_ind_cca_instantiations_portable_kyber_encapsulate_7a( libcrux_ml_kem_types_MlKemPublicKey_15 *public_key, d11013 199 a11211 1 libcrux_ml_kem_types_MlKemPublicKey_15 *uu____0 = public_key; d11213 69 a11281 3 uint8_t copy_of_randomness[32U]; memcpy(copy_of_randomness, randomness, (size_t)32U * sizeof(uint8_t)); return libcrux_ml_kem_ind_cca_encapsulate_cd0(uu____0, copy_of_randomness); d11285 6 a11290 1 Encapsulate Kyber 768 d11292 12 a11303 3 Generates an ([`MlKem768Ciphertext`], [`MlKemSharedSecret`]) tuple. The input is a reference to an [`MlKem768PublicKey`] and [`SHARED_SECRET_SIZE`] bytes of `randomness`. d11305 32 a11336 9 static inline tuple_3c libcrux_ml_kem_mlkem768_portable_kyber_encapsulate( libcrux_ml_kem_types_MlKemPublicKey_15 *public_key, uint8_t randomness[32U]) { libcrux_ml_kem_types_MlKemPublicKey_15 *uu____0 = public_key; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_randomness[32U]; memcpy(copy_of_randomness, randomness, (size_t)32U * sizeof(uint8_t)); return libcrux_ml_kem_ind_cca_instantiations_portable_kyber_encapsulate_7a( uu____0, copy_of_randomness); d11340 1 a11340 2 This function found in impl {(libcrux_ml_kem::variant::Variant for libcrux_ml_kem::variant::Kyber)} d11343 2 a11344 2 A monomorphic instance of libcrux_ml_kem.variant.cpa_keygen_seed_33 with types libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] d11347 4 d11352 7 a11358 3 static KRML_MUSTINLINE void libcrux_ml_kem_variant_cpa_keygen_seed_33_b6( Eurydice_slice key_generation_seed, uint8_t ret[64U]) { libcrux_ml_kem_hash_functions_portable_G_f1_e4(key_generation_seed, ret); d11362 1 a11362 10 A monomorphic instance of libcrux_ml_kem.ind_cpa.generate_keypair with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]], libcrux_ml_kem_variant_Kyber with const generics - K= 3 - PRIVATE_KEY_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 - RANKED_BYTES_PER_RING_ELEMENT= 1152 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 d11364 7 a11370 65 static inline libcrux_ml_kem_utils_extraction_helper_Keypair768 libcrux_ml_kem_ind_cpa_generate_keypair_fc0( Eurydice_slice key_generation_seed) { uint8_t hashed[64U]; libcrux_ml_kem_variant_cpa_keygen_seed_33_b6(key_generation_seed, hashed); Eurydice_slice_uint8_t_x2 uu____0 = Eurydice_slice_split_at( Eurydice_array_to_slice((size_t)64U, hashed, uint8_t), (size_t)32U, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice seed_for_A0 = uu____0.fst; Eurydice_slice seed_for_secret_and_error = uu____0.snd; libcrux_ml_kem_polynomial_PolynomialRingElement_f0 A_transpose[3U][3U]; uint8_t ret[34U]; libcrux_ml_kem_utils_into_padded_array_ea1(seed_for_A0, ret); libcrux_ml_kem_matrix_sample_matrix_A_38(ret, true, A_transpose); uint8_t prf_input[33U]; libcrux_ml_kem_utils_into_padded_array_ea2(seed_for_secret_and_error, prf_input); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_prf_input0[33U]; memcpy(copy_of_prf_input0, prf_input, (size_t)33U * sizeof(uint8_t)); tuple_b0 uu____2 = libcrux_ml_kem_ind_cpa_sample_vector_cbd_then_ntt_fc( copy_of_prf_input0, 0U); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 secret_as_ntt[3U]; memcpy( secret_as_ntt, uu____2.fst, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); uint8_t domain_separator = uu____2.snd; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_prf_input[33U]; memcpy(copy_of_prf_input, prf_input, (size_t)33U * sizeof(uint8_t)); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 error_as_ntt[3U]; memcpy( error_as_ntt, libcrux_ml_kem_ind_cpa_sample_vector_cbd_then_ntt_fc(copy_of_prf_input, domain_separator) .fst, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 t_as_ntt[3U]; libcrux_ml_kem_matrix_compute_As_plus_e_60(A_transpose, secret_as_ntt, error_as_ntt, t_as_ntt); uint8_t seed_for_A[32U]; Result_00 dst; Eurydice_slice_to_array2(&dst, seed_for_A0, Eurydice_slice, uint8_t[32U]); unwrap_41_83(dst, seed_for_A); uint8_t public_key_serialized[1184U]; libcrux_ml_kem_ind_cpa_serialize_public_key_79( t_as_ntt, Eurydice_array_to_slice((size_t)32U, seed_for_A, uint8_t), public_key_serialized); uint8_t secret_key_serialized[1152U]; libcrux_ml_kem_ind_cpa_serialize_secret_key_b5(secret_as_ntt, secret_key_serialized); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_secret_key_serialized[1152U]; memcpy(copy_of_secret_key_serialized, secret_key_serialized, (size_t)1152U * sizeof(uint8_t)); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_public_key_serialized[1184U]; memcpy(copy_of_public_key_serialized, public_key_serialized, (size_t)1184U * sizeof(uint8_t)); libcrux_ml_kem_utils_extraction_helper_Keypair768 lit; memcpy(lit.fst, copy_of_secret_key_serialized, (size_t)1152U * sizeof(uint8_t)); memcpy(lit.snd, copy_of_public_key_serialized, (size_t)1184U * sizeof(uint8_t)); return lit; d11374 3 a11376 6 Packed API Generate a key pair. Depending on the `Vector` and `Hasher` used, this requires different hardware features d11379 3 a11381 4 A monomorphic instance of libcrux_ml_kem.ind_cca.generate_keypair with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]], libcrux_ml_kem_variant_Kyber with const generics a11385 3 - BYTES_PER_RING_ELEMENT= 1152 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 d11387 4 a11390 9 static inline libcrux_ml_kem_mlkem768_MlKem768KeyPair libcrux_ml_kem_ind_cca_generate_keypair_8c0(uint8_t randomness[64U]) { Eurydice_slice ind_cpa_keypair_randomness = Eurydice_array_to_subslice2( randomness, (size_t)0U, LIBCRUX_ML_KEM_CONSTANTS_CPA_PKE_KEY_GENERATION_SEED_SIZE, uint8_t); Eurydice_slice implicit_rejection_value = Eurydice_array_to_subslice_from( (size_t)64U, randomness, LIBCRUX_ML_KEM_CONSTANTS_CPA_PKE_KEY_GENERATION_SEED_SIZE, uint8_t, size_t); d11392 3 a11394 1 libcrux_ml_kem_ind_cpa_generate_keypair_fc0(ind_cpa_keypair_randomness); d11397 3 a11399 4 uint8_t public_key[1184U]; memcpy(public_key, uu____0.snd, (size_t)1184U * sizeof(uint8_t)); uint8_t secret_key_serialized[2400U]; libcrux_ml_kem_ind_cca_serialize_kem_secret_key_48( d11401 4 a11404 14 Eurydice_array_to_slice((size_t)1184U, public_key, uint8_t), implicit_rejection_value, secret_key_serialized); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_secret_key_serialized[2400U]; memcpy(copy_of_secret_key_serialized, secret_key_serialized, (size_t)2400U * sizeof(uint8_t)); libcrux_ml_kem_types_MlKemPrivateKey_55 private_key = libcrux_ml_kem_types_from_05_f2(copy_of_secret_key_serialized); libcrux_ml_kem_types_MlKemPrivateKey_55 uu____2 = private_key; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_public_key[1184U]; memcpy(copy_of_public_key, public_key, (size_t)1184U * sizeof(uint8_t)); return libcrux_ml_kem_types_from_17_35( uu____2, libcrux_ml_kem_types_from_b6_da(copy_of_public_key)); d11408 5 d11414 2 a11415 2 libcrux_ml_kem.ind_cca.instantiations.portable.kyber_generate_keypair with const generics a11419 3 - BYTES_PER_RING_ELEMENT= 1152 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 d11421 7 a11427 7 static inline libcrux_ml_kem_mlkem768_MlKem768KeyPair libcrux_ml_kem_ind_cca_instantiations_portable_kyber_generate_keypair_9b( uint8_t randomness[64U]) { /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_randomness[64U]; memcpy(copy_of_randomness, randomness, (size_t)64U * sizeof(uint8_t)); return libcrux_ml_kem_ind_cca_generate_keypair_8c0(copy_of_randomness); d11431 1 a11431 1 Generate Kyber 768 Key Pair d11433 5 a11437 8 static inline libcrux_ml_kem_mlkem768_MlKem768KeyPair libcrux_ml_kem_mlkem768_portable_kyber_generate_key_pair( uint8_t randomness[64U]) { /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_randomness[64U]; memcpy(copy_of_randomness, randomness, (size_t)64U * sizeof(uint8_t)); return libcrux_ml_kem_ind_cca_instantiations_portable_kyber_generate_keypair_9b( copy_of_randomness); d11441 9 a11449 1 Validate an ML-KEM private key. d11451 4 a11454 3 This implements the Hash check in 7.3 3. Note that the size checks in 7.2 1 and 2 are covered by the `SECRET_KEY_SIZE` and `CIPHERTEXT_SIZE` in the `private_key` and `ciphertext` types. d11457 2 a11458 2 A monomorphic instance of libcrux_ml_kem.ind_cca.validate_private_key with types libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] d11461 1 a11461 2 - SECRET_KEY_SIZE= 2400 - CIPHERTEXT_SIZE= 1088 d11463 10 a11472 14 static KRML_MUSTINLINE bool libcrux_ml_kem_ind_cca_validate_private_key_e7( libcrux_ml_kem_types_MlKemPrivateKey_55 *private_key, libcrux_ml_kem_mlkem768_MlKem768Ciphertext *_ciphertext) { uint8_t t[32U]; libcrux_ml_kem_hash_functions_portable_H_f1_1a( Eurydice_array_to_subslice2(private_key->value, (size_t)384U * (size_t)3U, (size_t)768U * (size_t)3U + (size_t)32U, uint8_t), t); Eurydice_slice expected = Eurydice_array_to_subslice2( private_key->value, (size_t)768U * (size_t)3U + (size_t)32U, (size_t)768U * (size_t)3U + (size_t)64U, uint8_t); return core_array_equality___core__cmp__PartialEq__0___Slice_U____for__Array_T__N___3__eq( (size_t)32U, t, &expected, uint8_t, uint8_t, bool); d11476 3 a11478 1 Portable private key validation d11482 2 a11483 2 libcrux_ml_kem.ind_cca.instantiations.portable.validate_private_key with const generics d11485 1 a11485 2 - SECRET_KEY_SIZE= 2400 - CIPHERTEXT_SIZE= 1088 d11487 4 a11490 6 static KRML_MUSTINLINE bool libcrux_ml_kem_ind_cca_instantiations_portable_validate_private_key_9c( libcrux_ml_kem_types_MlKemPrivateKey_55 *private_key, libcrux_ml_kem_mlkem768_MlKem768Ciphertext *ciphertext) { return libcrux_ml_kem_ind_cca_validate_private_key_e7(private_key, ciphertext); d11494 8 a11501 1 Validate a private key. d11503 11 a11513 1 Returns `true` if valid, and `false` otherwise. d11515 9 a11523 5 static inline bool libcrux_ml_kem_mlkem768_portable_validate_private_key( libcrux_ml_kem_types_MlKemPrivateKey_55 *private_key, libcrux_ml_kem_mlkem768_MlKem768Ciphertext *ciphertext) { return libcrux_ml_kem_ind_cca_instantiations_portable_validate_private_key_9c( private_key, ciphertext); d11527 5 d11533 1 a11533 1 libcrux_ml_kem.serialize.deserialize_ring_elements_reduced.closure with types d11535 1 a11536 1 - K= 3 d11538 6 a11543 4 static inline libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_closure_cd0( size_t _i) { return libcrux_ml_kem_polynomial_ZERO_89_ea(); d11547 9 a11555 2 This function deserializes ring elements and reduces the result by the field modulus. d11557 4 a11560 1 This function MUST NOT be used on secret inputs. d11563 3 a11565 4 A monomorphic instance of libcrux_ml_kem.serialize.deserialize_ring_elements_reduced with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - PUBLIC_KEY_SIZE= 1184 d11568 11 a11578 23 static KRML_MUSTINLINE void libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_330( Eurydice_slice public_key, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 ret[3U]) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 deserialized_pk[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { deserialized_pk[i] = libcrux_ml_kem_polynomial_ZERO_89_ea(); } for (size_t i = (size_t)0U; i < Eurydice_slice_len(public_key, uint8_t) / LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT; i++) { size_t i0 = i; Eurydice_slice ring_element = Eurydice_slice_subslice2( public_key, i0 * LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT, i0 * LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT + LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT, uint8_t); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 uu____0 = libcrux_ml_kem_serialize_deserialize_to_reduced_ring_element_4c( ring_element); deserialized_pk[i0] = uu____0; } d11580 11 a11590 2 ret, deserialized_pk, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); d11594 3 a11596 5 Validate an ML-KEM public key. This implements the Modulus check in 7.2 2. Note that the size check in 7.2 1 is covered by the `PUBLIC_KEY_SIZE` in the `public_key` type. d11599 1 a11599 1 A monomorphic instance of libcrux_ml_kem.ind_cca.validate_public_key a11602 2 - RANKED_BYTES_PER_RING_ELEMENT= 1152 - PUBLIC_KEY_SIZE= 1184 d11604 11 a11614 16 static KRML_MUSTINLINE bool libcrux_ml_kem_ind_cca_validate_public_key_19( uint8_t *public_key) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 deserialized_pk[3U]; libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_330( Eurydice_array_to_subslice_to((size_t)1184U, public_key, (size_t)1152U, uint8_t, size_t), deserialized_pk); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *uu____0 = deserialized_pk; uint8_t public_key_serialized[1184U]; libcrux_ml_kem_ind_cpa_serialize_public_key_79( uu____0, Eurydice_array_to_subslice_from((size_t)1184U, public_key, (size_t)1152U, uint8_t, size_t), public_key_serialized); return core_array_equality___core__cmp__PartialEq__Array_U__N___for__Array_T__N____eq( (size_t)1184U, public_key, public_key_serialized, uint8_t, uint8_t, bool); d11618 3 a11620 1 Portable public key validation d11623 3 a11625 3 A monomorphic instance of libcrux_ml_kem.ind_cca.instantiations.portable.validate_public_key with const generics a11626 2 - RANKED_BYTES_PER_RING_ELEMENT= 1152 - PUBLIC_KEY_SIZE= 1184 d11628 4 a11631 4 static KRML_MUSTINLINE bool libcrux_ml_kem_ind_cca_instantiations_portable_validate_public_key_4b( uint8_t *public_key) { return libcrux_ml_kem_ind_cca_validate_public_key_19(public_key); d11635 10 a11644 1 Validate a public key. d11646 2 a11647 1 Returns `true` if valid, and `false` otherwise. d11649 5 a11653 4 static inline bool libcrux_ml_kem_mlkem768_portable_validate_public_key( libcrux_ml_kem_types_MlKemPublicKey_15 *public_key) { return libcrux_ml_kem_ind_cca_instantiations_portable_validate_public_key_4b( public_key->value); d11657 1 a11657 2 This function found in impl {(core::clone::Clone for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} d11659 43 a11701 4 static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_vector_type_clone_3b( libcrux_ml_kem_vector_portable_vector_type_PortableVector *self) { return self[0U]; d11704 19 a11722 1 typedef int16_t libcrux_ml_kem_vector_portable_vector_type_FieldElement; d11724 11 a11734 5 typedef int16_t libcrux_ml_kem_vector_portable_arithmetic_MontgomeryFieldElement; typedef int16_t libcrux_ml_kem_vector_portable_arithmetic_FieldElementTimesMontgomeryR; d11740 2 a11741 2 #define __libcrux_mlkem768_portable_H_DEFINED #endif d11746 2 a11747 3 #define libcrux_mlkem768_pk_valid_result Option_92_s #define libcrux_mlkem768_pk libcrux_ml_kem_types_MlKemPublicKey_15_s #define libcrux_mlkem768_sk libcrux_ml_kem_types_MlKemPrivateKey_55_s d11749 1 a11749 1 #define libcrux_mlkem768_enc_result tuple_3c_s d11751 1 a11751 1 #define LIBCRUX_ML_KEM_KEY_PAIR_PRNG_LEN 64 @ 1.2.2.1 log @Pull up the following, requested by christos in ticket #271: crypto/external/bsd/openssh/dist/ed25519-openssl.c up to 1.1.1.1 crypto/external/bsd/openssh/dist/ssherr-libcrypto.c up to 1.1.1.1 crypto/external/bsd/openssh/dist/ssherr-nolibcrypto.c up to 1.1.1.1 crypto/external/bsd/openssh/dist/hash.c delete crypto/external/bsd/openssh/dist/PROTOCOL up to 1.26 crypto/external/bsd/openssh/dist/addr.c up to 1.9 crypto/external/bsd/openssh/dist/addr.h up to 1.1.1.4 crypto/external/bsd/openssh/dist/addrmatch.c up to 1.16 crypto/external/bsd/openssh/dist/auth-bsdauth.c up to 1.10 crypto/external/bsd/openssh/dist/auth-krb5.c up to 1.20 crypto/external/bsd/openssh/dist/auth.c up to 1.40 crypto/external/bsd/openssh/dist/auth.h up to 1.26 crypto/external/bsd/openssh/dist/auth2-chall.c up to 1.22 crypto/external/bsd/openssh/dist/auth2-gss.c up to 1.19 crypto/external/bsd/openssh/dist/auth2-hostbased.c up to 1.26 crypto/external/bsd/openssh/dist/auth2-pubkey.c up to 1.38 crypto/external/bsd/openssh/dist/auth2-pubkeyfile.c up to 1.5 crypto/external/bsd/openssh/dist/auth2.c up to 1.35 crypto/external/bsd/openssh/dist/authfd.c up to 1.29 crypto/external/bsd/openssh/dist/authfd.h up to 1.19 crypto/external/bsd/openssh/dist/authfile.c up to 1.31 crypto/external/bsd/openssh/dist/bcrypt_pbkdf.c up to 1.5 crypto/external/bsd/openssh/dist/canohost.c up to 1.17 crypto/external/bsd/openssh/dist/channels.c up to 1.48 crypto/external/bsd/openssh/dist/channels.h up to 1.31 crypto/external/bsd/openssh/dist/cipher-aesctr.c up to 1.3 crypto/external/bsd/openssh/dist/cipher-chachapoly-libcrypto.c up to 1.4 crypto/external/bsd/openssh/dist/cipher.c up to 1.27 crypto/external/bsd/openssh/dist/clientloop.c up to 1.45 crypto/external/bsd/openssh/dist/clientloop.h up to 1.20 crypto/external/bsd/openssh/dist/compat.c up to 1.27 crypto/external/bsd/openssh/dist/crypto_api.h up to 1.8 crypto/external/bsd/openssh/dist/dh.c up to 1.22 crypto/external/bsd/openssh/dist/digest-libc.c up to 1.12 crypto/external/bsd/openssh/dist/dispatch.c up to 1.13 crypto/external/bsd/openssh/dist/dispatch.h up to 1.9 crypto/external/bsd/openssh/dist/dns.c up to 1.25 crypto/external/bsd/openssh/dist/gss-genr.c up to 1.16 crypto/external/bsd/openssh/dist/gss-serv-krb5.c up to 1.13 crypto/external/bsd/openssh/dist/gss-serv.c up to 1.18 crypto/external/bsd/openssh/dist/hmac.c up to 1.10 crypto/external/bsd/openssh/dist/hostfile.c up to 1.25 crypto/external/bsd/openssh/dist/kex-names.c up to 1.5 crypto/external/bsd/openssh/dist/kex.c up to 1.40 crypto/external/bsd/openssh/dist/kex.h up to 1.29 crypto/external/bsd/openssh/dist/kexdh.c up to 1.12 crypto/external/bsd/openssh/dist/kexecdh.c up to 1.10 crypto/external/bsd/openssh/dist/kexgen.c up to 1.9 crypto/external/bsd/openssh/dist/kexgex.c up to 1.8 crypto/external/bsd/openssh/dist/kexgexc.c up to 1.19 crypto/external/bsd/openssh/dist/kexgexs.c up to 1.26 crypto/external/bsd/openssh/dist/krl.c up to 1.27 crypto/external/bsd/openssh/dist/krl.h up to 1.7 crypto/external/bsd/openssh/dist/libcrux_mlkem768_sha3.h up to 1.3 crypto/external/bsd/openssh/dist/log.c up to 1.34 crypto/external/bsd/openssh/dist/mac.c up to 1.18 crypto/external/bsd/openssh/dist/mac.h up to 1.9 crypto/external/bsd/openssh/dist/misc-agent.c up to 1.3 crypto/external/bsd/openssh/dist/misc.c up to 1.41 crypto/external/bsd/openssh/dist/misc.h up to 1.33 crypto/external/bsd/openssh/dist/mlkem768.sh up to 1.3 crypto/external/bsd/openssh/dist/moduli.c up to 1.19 crypto/external/bsd/openssh/dist/monitor.c up to 1.51 crypto/external/bsd/openssh/dist/monitor.h up to 1.16 crypto/external/bsd/openssh/dist/monitor_fdpass.c up to 1.10 crypto/external/bsd/openssh/dist/monitor_wrap.c up to 1.38 crypto/external/bsd/openssh/dist/monitor_wrap.h up to 1.27 crypto/external/bsd/openssh/dist/msg.c up to 1.13 crypto/external/bsd/openssh/dist/mux.c up to 1.40 crypto/external/bsd/openssh/dist/myproposal.h up to 1.27 crypto/external/bsd/openssh/dist/nchan.c up to 1.17 crypto/external/bsd/openssh/dist/packet.c up to 1.57 crypto/external/bsd/openssh/dist/packet.h up to 1.30 crypto/external/bsd/openssh/dist/progressmeter.c up to 1.18 crypto/external/bsd/openssh/dist/readconf.c up to 1.51 crypto/external/bsd/openssh/dist/readconf.h up to 1.38 crypto/external/bsd/openssh/dist/readpass.c up to 1.21 crypto/external/bsd/openssh/dist/rijndael.c up to 1.3 crypto/external/bsd/openssh/dist/scp.c up to 1.45 crypto/external/bsd/openssh/dist/servconf.c up to 1.52 crypto/external/bsd/openssh/dist/servconf.h up to 1.34 crypto/external/bsd/openssh/dist/serverloop.c up to 1.40 crypto/external/bsd/openssh/dist/session.c up to 1.45 crypto/external/bsd/openssh/dist/sftp-client.c up to 1.39 crypto/external/bsd/openssh/dist/sftp-client.h up to 1.20 crypto/external/bsd/openssh/dist/sftp-common.c up to 1.15 crypto/external/bsd/openssh/dist/sftp-common.h up to 1.9 crypto/external/bsd/openssh/dist/sftp-server.c up to 1.33 crypto/external/bsd/openssh/dist/sftp.c up to 1.44 crypto/external/bsd/openssh/dist/sntrup761.c up to 1.5 crypto/external/bsd/openssh/dist/sntrup761.sh up to 1.1.1.4 crypto/external/bsd/openssh/dist/srclimit.c up to 1.8 crypto/external/bsd/openssh/dist/srclimit.h up to 1.1.1.4 crypto/external/bsd/openssh/dist/ssh-add.1 up to 1.22 crypto/external/bsd/openssh/dist/ssh-add.c up to 1.34 crypto/external/bsd/openssh/dist/ssh-agent.c up to 1.44 crypto/external/bsd/openssh/dist/ssh-ecdsa-sk.c up to 1.6 crypto/external/bsd/openssh/dist/ssh-ecdsa.c up to 1.18 crypto/external/bsd/openssh/dist/ssh-ed25519-sk.c up to 1.6 crypto/external/bsd/openssh/dist/ssh-ed25519.c up to 1.12 crypto/external/bsd/openssh/dist/ssh-keygen.1 up to 1.42 crypto/external/bsd/openssh/dist/ssh-keygen.c up to 1.51 crypto/external/bsd/openssh/dist/ssh-keysign.c up to 1.29 crypto/external/bsd/openssh/dist/ssh-pkcs11-client.c up to 1.22 crypto/external/bsd/openssh/dist/ssh-pkcs11-helper.c up to 1.25 crypto/external/bsd/openssh/dist/ssh-pkcs11.c up to 1.31 crypto/external/bsd/openssh/dist/ssh-pkcs11.h up to 1.11 crypto/external/bsd/openssh/dist/ssh-rsa.c up to 1.22 crypto/external/bsd/openssh/dist/ssh-sk-client.c up to 1.9 crypto/external/bsd/openssh/dist/ssh.1 up to 1.43 crypto/external/bsd/openssh/dist/ssh.c up to 1.49 crypto/external/bsd/openssh/dist/ssh_api.c up to 1.20 crypto/external/bsd/openssh/dist/ssh_config.5 up to 1.46 crypto/external/bsd/openssh/dist/sshbuf-getput-basic.c up to 1.13 crypto/external/bsd/openssh/dist/sshbuf-misc.c up to 1.16 crypto/external/bsd/openssh/dist/sshbuf.c up to 1.16 crypto/external/bsd/openssh/dist/sshbuf.h up to 1.23 crypto/external/bsd/openssh/dist/sshconnect.c up to 1.42 crypto/external/bsd/openssh/dist/sshconnect.h up to 1.20 crypto/external/bsd/openssh/dist/sshconnect2.c up to 1.53 crypto/external/bsd/openssh/dist/sshd-auth.c up to 1.5 crypto/external/bsd/openssh/dist/sshd-session.c up to 1.12 crypto/external/bsd/openssh/dist/sshd.c up to 1.57 crypto/external/bsd/openssh/dist/sshd_config.5 up to 1.49 crypto/external/bsd/openssh/dist/ssherr.c up to 1.11 crypto/external/bsd/openssh/dist/ssherr.h up to 1.5 crypto/external/bsd/openssh/dist/sshkey.c up to 1.37 crypto/external/bsd/openssh/dist/sshkey.h up to 1.26 crypto/external/bsd/openssh/dist/sshlogin.c up to 1.14 crypto/external/bsd/openssh/dist/sshpty.c up to 1.9 crypto/external/bsd/openssh/dist/sshsig.c up to 1.17 crypto/external/bsd/openssh/dist/ttymodes.c up to 1.13 crypto/external/bsd/openssh/dist/uidswap.c up to 1.11 crypto/external/bsd/openssh/dist/umac.c up to 1.24 crypto/external/bsd/openssh/dist/version.h up to 1.53 crypto/external/bsd/openssh/dist/moduli-gen/moduli.2048 up to 1.22 crypto/external/bsd/openssh/dist/moduli-gen/moduli.3072 up to 1.24 crypto/external/bsd/openssh/dist/moduli-gen/moduli.4096 up to 1.24 crypto/external/bsd/openssh/dist/moduli-gen/moduli.6144 up to 1.24 crypto/external/bsd/openssh/dist/moduli-gen/moduli.7680 up to 1.24 crypto/external/bsd/openssh/dist/moduli-gen/moduli.8192 up to 1.24 crypto/external/bsd/openssh/lib/Makefile up to 1.49 crypto/external/bsd/openssh/lib/shlib_version up to 1.42 crypto/external/bsd/openssh/lib/ssh.expsym up to 1.5 crypto/external/bsd/openssh/libexec/Makefile up to 1.4 Update OpenSSH to 10.3. @ text @d1 1 a1 1 /* $OpenBSD: libcrux_mlkem768_sha3.h,v 1.4 2025/11/13 05:13:06 djm Exp $ */ d3 1 a3 1 /* Extracted from libcrux revision 026a87ab6d88ad3626b9fbbf3710d1e0483c1849 */ d37 7 a43 12 static inline void store64_le(uint8_t dst[8], uint64_t src) { dst[0] = src & 0xff; dst[1] = (src >> 8) & 0xff; dst[2] = (src >> 16) & 0xff; dst[3] = (src >> 24) & 0xff; dst[4] = (src >> 32) & 0xff; dst[5] = (src >> 40) & 0xff; dst[6] = (src >> 48) & 0xff; dst[7] = (src >> 56) & 0xff; } d45 1 a45 8 static inline void store32_le(uint8_t dst[4], uint32_t src) { dst[0] = src & 0xff; dst[1] = (src >> 8) & 0xff; dst[2] = (src >> 16) & 0xff; dst[3] = (src >> 24) & 0xff; } d47 2 a48 38 static inline void store32_be(uint8_t dst[4], uint32_t src) { dst[0] = (src >> 24) & 0xff; dst[1] = (src >> 16) & 0xff; dst[2] = (src >> 8) & 0xff; dst[3] = src & 0xff; } static inline uint64_t load64_le(uint8_t src[8]) { return (uint64_t)(src[0]) | ((uint64_t)(src[1]) << 8) | ((uint64_t)(src[2]) << 16) | ((uint64_t)(src[3]) << 24) | ((uint64_t)(src[4]) << 32) | ((uint64_t)(src[5]) << 40) | ((uint64_t)(src[6]) << 48) | ((uint64_t)(src[7]) << 56); } static inline uint32_t load32_le(uint8_t src[4]) { return (uint32_t)(src[0]) | ((uint32_t)(src[1]) << 8) | ((uint32_t)(src[2]) << 16) | ((uint32_t)(src[3]) << 24); } #ifdef MISSING_BUILTIN_POPCOUNT static inline unsigned int __builtin_popcount(unsigned int num) { const int v[16] = { 0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4 }; return v[num & 0xf] + v[(num >> 4) & 0xf]; } a50 2 /* from libcrux/libcrux-ml-kem/extracts/c_header_only/generated/eurydice_glue.h */ #pragma once d53 1 a53 6 #ifdef _MSC_VER // For __popcnt #endif // C++ HELPERS d55 3 d59 1 a59 14 #ifndef KRML_HOST_EPRINTF #define KRML_HOST_EPRINTF(...) fprintf(stderr, __VA_ARGS__) #endif #ifndef __cpp_lib_type_identity template struct type_identity { using type = T; }; template using type_identity_t = typename type_identity::type; d61 1 a61 1 using std::type_identity_t; a63 24 #define KRML_UNION_CONSTRUCTOR(T) \ template \ constexpr T(int t, V U::*m, type_identity_t v) : tag(t) { \ val.*m = std::move(v); \ } \ T() = default; #endif // GENERAL-PURPOSE STUFF #define LowStar_Ignore_ignore(e, t, _ret_t) ((void)e) #define EURYDICE_ASSERT(test, msg) \ do { \ if (!(test)) { \ fprintf(stderr, "assertion \"%s\" failed: file \"%s\", line %d\n", msg, \ __FILE__, __LINE__); \ exit(255); \ } \ } while (0) // SLICES, ARRAYS, ETC. d68 3 a70 2 // performing pointer arithmetic on it (remember that C desugars pointer // arithmetic based on the type of the address) d72 2 a73 1 // need to multiply it by sizeof t, where t is the type of the elements. d75 3 a77 3 // Empty slices have `len == 0` and `ptr` always needs to be a valid pointer // that is not NULL (otherwise the construction in EURYDICE_SLICE computes `NULL // + start`). a82 13 #if defined(__cplusplus) #define KRML_CLITERAL(type) type #else #define KRML_CLITERAL(type) (type) #endif #if defined(__cplusplus) && defined(__cpp_designated_initializers) || \ !(defined(__cplusplus)) #define EURYDICE_CFIELD(X) X #else #define EURYDICE_CFIELD(X) #endif d88 2 a89 6 (KRML_CLITERAL(Eurydice_slice){(void *)(x + start), end - start}) // Slice length #define EURYDICE_SLICE_LEN(s, _) (s).len #define Eurydice_slice_len(s, _) (s).len d96 1 a96 4 // The following functions get sub slices from a slice. #define Eurydice_slice_subslice(s, r, t, _0, _1) \ a97 1 d101 2 a102 8 EURYDICE_SLICE((t *)s.ptr, (start), (end)) // Previous version above does not work when t is an array type (as usual). Will // be deprecated soon. #define Eurydice_slice_subslice3(s, start, end, t_ptr) \ EURYDICE_SLICE((t_ptr)s.ptr, (start), (end)) #define Eurydice_slice_subslice_to(s, subslice_end_pos, t, _0, _1) \ d104 1 a104 2 #define Eurydice_slice_subslice_from(s, subslice_start_pos, t, _0, _1) \ a105 1 d109 1 a109 1 #define Eurydice_array_to_subslice(_arraylen, x, r, t, _0, _1) \ a110 1 d113 2 a114 12 EURYDICE_SLICE((t *)x, (start), (end)) // Same as above, variant for when start and end are statically known #define Eurydice_array_to_subslice3(x, start, end, t_ptr) \ EURYDICE_SLICE((t_ptr)x, (start), (end)) #define Eurydice_array_repeat(dst, len, init, t) \ ERROR "should've been desugared" // The following functions convert an array into a slice. #define Eurydice_array_to_subslice_to(_size, x, r, t, _range_t, _0) \ d116 1 a116 1 #define Eurydice_array_to_subslice_from(size, x, r, t, _range_t, _0) \ d118 1 a118 2 // Copy a slice with memcopy d121 2 d124 2 a125 5 #define core_array___Array_T__N___as_slice(len_, ptr_, t, _ret_t) \ KRML_CLITERAL(Eurydice_slice) { ptr_, len_ } #define core_array__core__clone__Clone_for__Array_T__N___clone( \ len, src, dst, elem_type, _ret_t) \ a127 7 #define core_array_TryFromSliceError uint8_t #define Eurydice_array_eq(sz, a1, a2, t) (memcmp(a1, a2, sz * sizeof(t)) == 0) // core::cmp::PartialEq<&0 (@@Slice)> for @@Array #define Eurydice_array_eq_slice(sz, a1, s2, t, _) \ (memcmp(a1, (s2)->ptr, sz * sizeof(t)) == 0) d129 2 d138 9 a146 19 #define Eurydice_slice_split_at(slice, mid, element_type, ret_t) \ KRML_CLITERAL(ret_t) { \ EURYDICE_CFIELD(.fst =) \ EURYDICE_SLICE((element_type *)(slice).ptr, 0, mid), \ EURYDICE_CFIELD(.snd =) \ EURYDICE_SLICE((element_type *)(slice).ptr, mid, (slice).len) \ } #define Eurydice_slice_split_at_mut(slice, mid, element_type, ret_t) \ KRML_CLITERAL(ret_t) { \ EURYDICE_CFIELD(.fst =) \ KRML_CLITERAL(Eurydice_slice){EURYDICE_CFIELD(.ptr =)(slice.ptr), \ EURYDICE_CFIELD(.len =) mid}, \ EURYDICE_CFIELD(.snd =) KRML_CLITERAL(Eurydice_slice) { \ EURYDICE_CFIELD(.ptr =) \ ((char *)slice.ptr + mid * sizeof(element_type)), \ EURYDICE_CFIELD(.len =)(slice.len - mid) \ } \ } d151 1 a151 1 #define Eurydice_slice_to_array2(dst, src, _0, t_arr, _1) \ a160 31 // SUPPORT FOR DSTs (Dynamically-Sized Types) // A DST is a fat pointer that keeps tracks of the size of it flexible array // member. Slices are a specific case of DSTs, where [T; N] implements // Unsize<[T]>, meaning an array of statically known size can be converted to a // fat pointer, i.e. a slice. // // Unlike slices, DSTs have a built-in definition that gets monomorphized, of // the form: // // typedef struct { // T *ptr; // size_t len; // number of elements // } Eurydice_dst; // // Furthermore, T = T0<[U0]> where `struct T0`, where the `U` is the // last field. This means that there are two monomorphizations of T0 in the // program. One is `T0<[V; N]>` // -- this is directly converted to a Eurydice_dst via suitable codegen (no // macro). The other is `T = T0<[U]>`, where `[U]` gets emitted to // `Eurydice_derefed_slice`, a type that only appears in that precise situation // and is thus defined to give rise to a flexible array member. typedef char Eurydice_derefed_slice[]; #define Eurydice_slice_of_dst(fam_ptr, len_, t, _) \ ((Eurydice_slice){.ptr = (void *)(fam_ptr), .len = len_}) #define Eurydice_slice_of_boxed_array(ptr_, len_, t, _) \ ((Eurydice_slice){.ptr = (void *)(ptr_), .len = len_}) d163 3 a165 31 // We slap extern "C" on declarations that intend to implement a prototype // generated by Eurydice, because Eurydice prototypes are always emitted within // an extern "C" block, UNLESS you use -fcxx17-compat, in which case, you must // pass -DKRML_CXX17_COMPAT="" to your C++ compiler. #if defined(__cplusplus) && !defined(KRML_CXX17_COMPAT) extern "C" { #endif static inline void core_num__u32__to_be_bytes(uint32_t src, uint8_t dst[4]) { store32_be(dst, src); } static inline void core_num__u32__to_le_bytes(uint32_t src, uint8_t dst[4]) { store32_le(dst, src); } static inline uint32_t core_num__u32__from_le_bytes(uint8_t buf[4]) { return load32_le(buf); } static inline void core_num__u64__to_le_bytes(uint64_t v, uint8_t buf[8]) { store64_le(buf, v); } static inline uint64_t core_num__u64__from_le_bytes(uint8_t buf[8]) { return load64_le(buf); } static inline int64_t core_convert_num___core__convert__From_i32__for_i64__from( int32_t x) { return x; d167 4 a170 14 static inline uint64_t core_convert_num___core__convert__From_u8__for_u64__from( uint8_t x) { return x; } static inline uint64_t core_convert_num___core__convert__From_u16__for_u64__from(uint16_t x) { return x; } static inline size_t core_convert_num___core__convert__From_u16__for_usize__from(uint16_t x) { return x; d173 4 a176 6 static inline uint32_t core_num__u8__count_ones(uint8_t x0) { #ifdef _MSC_VER return __popcnt(x0); #else return __builtin_popcount(x0); #endif d179 1 a179 1 static inline uint32_t core_num__i32__count_ones(int32_t x0) { a186 8 static inline size_t core_cmp_impls___core__cmp__Ord_for_usize__min(size_t a, size_t b) { if (a <= b) return a; else return b; } d188 1 a188 1 static inline uint16_t core_num__u16__wrapping_add(uint16_t x, uint16_t y) { d191 1 a191 1 static inline uint8_t core_num__u8__wrapping_sub(uint8_t x, uint8_t y) { a193 40 static inline uint64_t core_num__u64__rotate_left(uint64_t x0, uint32_t x1) { return (x0 << x1 | x0 >> (64 - x1)); } static inline void core_ops_arith__i32__add_assign(int32_t *x0, int32_t *x1) { *x0 = *x0 + *x1; } static inline uint8_t Eurydice_bitand_pv_u8(uint8_t *p, uint8_t v) { return (*p) & v; } static inline uint8_t Eurydice_shr_pv_u8(uint8_t *p, int32_t v) { return (*p) >> v; } static inline uint32_t Eurydice_min_u32(uint32_t x, uint32_t y) { return x < y ? x : y; } static inline uint8_t core_ops_bit___core__ops__bit__BitAnd_u8__u8__for___a__u8___46__bitand( uint8_t *x0, uint8_t x1) { return Eurydice_bitand_pv_u8(x0, x1); } static inline uint8_t core_ops_bit___core__ops__bit__Shr_i32__u8__for___a__u8___792__shr(uint8_t *x0, int32_t x1) { return Eurydice_shr_pv_u8(x0, x1); } #define core_num_nonzero_private_NonZeroUsizeInner size_t static inline core_num_nonzero_private_NonZeroUsizeInner core_num_nonzero_private___core__clone__Clone_for_core__num__nonzero__private__NonZeroUsizeInner__26__clone( core_num_nonzero_private_NonZeroUsizeInner *x0) { return *x0; } #if defined(__cplusplus) && !defined(KRML_CXX17_COMPAT) } #endif d197 4 a200 6 #define Eurydice_range_iter_next(iter_ptr, t, ret_t) \ (((iter_ptr)->start >= (iter_ptr)->end) \ ? (KRML_CLITERAL(ret_t){EURYDICE_CFIELD(.tag =) 0, \ EURYDICE_CFIELD(.f0 =) 0}) \ : (KRML_CLITERAL(ret_t){EURYDICE_CFIELD(.tag =) 1, \ EURYDICE_CFIELD(.f0 =)(iter_ptr)->start++})) d202 1 a202 1 #define core_iter_range___core__iter__traits__iterator__Iterator_A__for_core__ops__range__Range_A__TraitClause_0___6__next \ d206 2 a207 2 #define Eurydice_into_iter(x, t, _ret_t, _) (x) #define core_iter_traits_collect___core__iter__traits__collect__IntoIterator_Clause1_Item__I__for_I__1__into_iter \ d210 1 a210 82 typedef struct { Eurydice_slice slice; size_t chunk_size; } Eurydice_chunks; // Can't use macros Eurydice_slice_subslice_{to,from} because they require a // type, and this static inline function cannot receive a type as an argument. // Instead, we receive the element size and use it to peform manual offset // computations rather than going through the macros. static inline Eurydice_slice chunk_next(Eurydice_chunks *chunks, size_t element_size) { size_t chunk_size = chunks->slice.len >= chunks->chunk_size ? chunks->chunk_size : chunks->slice.len; Eurydice_slice curr_chunk; curr_chunk.ptr = chunks->slice.ptr; curr_chunk.len = chunk_size; chunks->slice.ptr = (char *)(chunks->slice.ptr) + chunk_size * element_size; chunks->slice.len = chunks->slice.len - chunk_size; return curr_chunk; } #define core_slice___Slice_T___chunks(slice_, sz_, t, _ret_t) \ ((Eurydice_chunks){.slice = slice_, .chunk_size = sz_}) #define core_slice___Slice_T___chunks_exact(slice_, sz_, t, _ret_t) \ ((Eurydice_chunks){ \ .slice = {.ptr = slice_.ptr, .len = slice_.len - (slice_.len % sz_)}, \ .chunk_size = sz_}) #define core_slice_iter_Chunks Eurydice_chunks #define core_slice_iter_ChunksExact Eurydice_chunks #define Eurydice_chunks_next(iter, t, ret_t) \ (((iter)->slice.len == 0) ? ((ret_t){.tag = core_option_None}) \ : ((ret_t){.tag = core_option_Some, \ .f0 = chunk_next(iter, sizeof(t))})) #define core_slice_iter___core__iter__traits__iterator__Iterator_for_core__slice__iter__Chunks__a__T___70__next \ Eurydice_chunks_next // This name changed on 20240627 #define core_slice_iter___core__iter__traits__iterator__Iterator_for_core__slice__iter__Chunks__a__T___71__next \ Eurydice_chunks_next #define core_slice_iter__core__slice__iter__ChunksExact__a__T__89__next( \ iter, t, _ret_t) \ core_slice_iter__core__slice__iter__Chunks__a__T__70__next(iter, t) typedef struct { Eurydice_slice s; size_t index; } Eurydice_slice_iterator; #define core_slice___Slice_T___iter(x, t, _ret_t) \ ((Eurydice_slice_iterator){.s = x, .index = 0}) #define core_slice_iter_Iter Eurydice_slice_iterator #define core_slice_iter__core__slice__iter__Iter__a__T__181__next(iter, t, \ ret_t) \ (((iter)->index == (iter)->s.len) \ ? (KRML_CLITERAL(ret_t){.tag = core_option_None}) \ : (KRML_CLITERAL(ret_t){ \ .tag = core_option_Some, \ .f0 = ((iter)->index++, \ &((t *)((iter)->s.ptr))[(iter)->index - 1])})) #define core_option__core__option__Option_T__TraitClause_0___is_some(X, _0, \ _1) \ ((X)->tag == 1) // STRINGS typedef const char *Prims_string; // MISC (UNTESTED) typedef void *core_fmt_Formatter; typedef void *core_fmt_Arguments; typedef void *core_fmt_rt_Argument; #define core_fmt_rt__core__fmt__rt__Argument__a__1__new_display(x1, x2, x3, \ x4) \ NULL // BOXES // Crimes. static inline char *malloc_and_init(size_t sz, char *init) { char *ptr = (char *)malloc(sz); memcpy(ptr, init, sz); return ptr; d212 1 d214 1 a214 7 #define Eurydice_box_new(init, t, t_dst) \ ((t_dst)(malloc_and_init(sizeof(t), (char *)(&init)))) #define Eurydice_box_new_array(len, ptr, t, t_dst) \ ((t_dst)(malloc_and_init(len * sizeof(t), (char *)(ptr)))) /* from libcrux/libcrux-ml-kem/extracts/c_header_only/generated/libcrux_mlkem_core.h */ d216 1 a216 1 * SPDX-FileCopyrightText: 2025 Cryspen Sarl d221 5 a225 5 * Charon: 667d2fc98984ff7f3df989c2367e6c1fa4a000e7 * Eurydice: 2381cbc416ef2ad0b561c362c500bc84f36b6785 * Karamel: 80f5435f2fc505973c469a4afcc8d875cddd0d8b * F*: 71d8221589d4d438af3706d89cb653cf53e18aab * Libcrux: 68dfed5a4a9e40277f62828471c029afed1ecdcc d228 2 a229 3 #ifndef libcrux_mlkem_core_H #define libcrux_mlkem_core_H d235 1 d241 1 a241 1 typedef struct core_ops_range_Range_08_s { d244 15 a258 1 } core_ops_range_Range_08; d260 7 a266 1 static inline uint16_t core_num__u16__wrapping_add(uint16_t x0, uint16_t x1); d268 1 a268 1 static inline uint64_t core_num__u64__from_le_bytes(uint8_t x0[8U]); d270 1 a270 1 static inline uint64_t core_num__u64__rotate_left(uint64_t x0, uint32_t x1); d272 1 a272 1 static inline void core_num__u64__to_le_bytes(uint64_t x0, uint8_t x1[8U]); d274 1 a274 1 static inline uint32_t core_num__u8__count_ones(uint8_t x0); d276 1 a276 1 static inline uint8_t core_num__u8__wrapping_sub(uint8_t x0, uint8_t x1); d292 1 a292 1 #define LIBCRUX_ML_KEM_CONSTANTS_G_DIGEST_SIZE ((size_t)64U) d294 4 a297 1 #define LIBCRUX_ML_KEM_CONSTANTS_H_DIGEST_SIZE ((size_t)32U) d300 2 a301 1 K * BITS_PER_RING_ELEMENT / 8 a302 2 [eurydice] Note that we can't use const generics here because that breaks C extraction with eurydice. d304 7 a310 4 static inline size_t libcrux_ml_kem_constants_ranked_bytes_per_ring_element( size_t rank) { return rank * LIBCRUX_ML_KEM_CONSTANTS_BITS_PER_RING_ELEMENT / (size_t)8U; } d313 1 a313 1 This function found in impl {libcrux_secrets::traits::Classify for T} d316 2 a317 2 A monomorphic instance of libcrux_secrets.int.public_integers.classify_27 with types uint8_t d320 10 a329 3 static KRML_MUSTINLINE uint8_t libcrux_secrets_int_public_integers_classify_27_90(uint8_t self) { return self; d333 14 a346 1 This function found in impl {libcrux_secrets::traits::Declassify for T} d349 2 a350 2 A monomorphic instance of libcrux_secrets.int.public_integers.declassify_d8 with types int16_t d353 10 a362 3 static KRML_MUSTINLINE int16_t libcrux_secrets_int_public_integers_declassify_d8_39(int16_t self) { return self; d366 3 a368 1 This function found in impl {libcrux_secrets::int::CastOps for i16} d370 7 a376 4 static KRML_MUSTINLINE uint8_t libcrux_secrets_int_as_u8_f5(int16_t self) { return libcrux_secrets_int_public_integers_classify_27_90( (uint8_t)libcrux_secrets_int_public_integers_declassify_d8_39(self)); } d379 1 a379 1 This function found in impl {libcrux_secrets::traits::Classify for T} d382 2 a383 2 A monomorphic instance of libcrux_secrets.int.public_integers.classify_27 with types int16_t d386 10 a395 3 static KRML_MUSTINLINE int16_t libcrux_secrets_int_public_integers_classify_27_39(int16_t self) { return self; d398 12 d411 1 a411 1 This function found in impl {libcrux_secrets::traits::Declassify for T} d414 3 a416 3 A monomorphic instance of libcrux_secrets.int.public_integers.declassify_d8 with types uint8_t d418 3 a420 3 static KRML_MUSTINLINE uint8_t libcrux_secrets_int_public_integers_declassify_d8_90(uint8_t self) { return self; d424 3 a426 1 This function found in impl {libcrux_secrets::int::CastOps for u8} d428 3 a430 4 static KRML_MUSTINLINE int16_t libcrux_secrets_int_as_i16_59(uint8_t self) { return libcrux_secrets_int_public_integers_classify_27_39( (int16_t)libcrux_secrets_int_public_integers_declassify_d8_90(self)); } d433 2 a434 1 This function found in impl {libcrux_secrets::traits::Classify for T} d437 3 a439 3 A monomorphic instance of libcrux_secrets.int.public_integers.classify_27 with types int32_t d441 8 a448 3 static KRML_MUSTINLINE int32_t libcrux_secrets_int_public_integers_classify_27_a8(int32_t self) { return self; d452 3 a454 1 This function found in impl {libcrux_secrets::int::CastOps for i16} d456 8 a463 4 static KRML_MUSTINLINE int32_t libcrux_secrets_int_as_i32_f5(int16_t self) { return libcrux_secrets_int_public_integers_classify_27_a8( (int32_t)libcrux_secrets_int_public_integers_declassify_d8_39(self)); } d466 1 a466 1 This function found in impl {libcrux_secrets::traits::Declassify for T} d469 2 a470 3 A monomorphic instance of libcrux_secrets.int.public_integers.declassify_d8 with types int32_t a471 5 static KRML_MUSTINLINE int32_t libcrux_secrets_int_public_integers_declassify_d8_a8(int32_t self) { return self; } d473 4 a476 1 This function found in impl {libcrux_secrets::int::CastOps for i32} d478 5 a482 3 static KRML_MUSTINLINE int16_t libcrux_secrets_int_as_i16_36(int32_t self) { return libcrux_secrets_int_public_integers_classify_27_39( (int16_t)libcrux_secrets_int_public_integers_declassify_d8_a8(self)); d486 2 a487 1 This function found in impl {libcrux_secrets::traits::Declassify for T} d490 3 a492 3 A monomorphic instance of libcrux_secrets.int.public_integers.declassify_d8 with types uint32_t d494 8 a501 3 static KRML_MUSTINLINE uint32_t libcrux_secrets_int_public_integers_declassify_d8_df(uint32_t self) { return self; d505 3 a507 1 This function found in impl {libcrux_secrets::int::CastOps for u32} d509 7 a515 4 static KRML_MUSTINLINE int32_t libcrux_secrets_int_as_i32_b8(uint32_t self) { return libcrux_secrets_int_public_integers_classify_27_a8( (int32_t)libcrux_secrets_int_public_integers_declassify_d8_df(self)); } d518 1 a518 1 This function found in impl {libcrux_secrets::traits::Classify for T} d521 2 a522 2 A monomorphic instance of libcrux_secrets.int.public_integers.classify_27 with types uint16_t d525 1 a525 318 static KRML_MUSTINLINE uint16_t libcrux_secrets_int_public_integers_classify_27_de(uint16_t self) { return self; } /** This function found in impl {libcrux_secrets::int::CastOps for i16} */ static KRML_MUSTINLINE uint16_t libcrux_secrets_int_as_u16_f5(int16_t self) { return libcrux_secrets_int_public_integers_classify_27_de( (uint16_t)libcrux_secrets_int_public_integers_declassify_d8_39(self)); } /** This function found in impl {libcrux_secrets::traits::Declassify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.declassify_d8 with types uint16_t */ static KRML_MUSTINLINE uint16_t libcrux_secrets_int_public_integers_declassify_d8_de(uint16_t self) { return self; } /** This function found in impl {libcrux_secrets::int::CastOps for u16} */ static KRML_MUSTINLINE int16_t libcrux_secrets_int_as_i16_ca(uint16_t self) { return libcrux_secrets_int_public_integers_classify_27_39( (int16_t)libcrux_secrets_int_public_integers_declassify_d8_de(self)); } /** This function found in impl {libcrux_secrets::traits::Classify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.classify_27 with types uint64_t */ static KRML_MUSTINLINE uint64_t libcrux_secrets_int_public_integers_classify_27_49(uint64_t self) { return self; } /** This function found in impl {libcrux_secrets::int::CastOps for u16} */ static KRML_MUSTINLINE uint64_t libcrux_secrets_int_as_u64_ca(uint16_t self) { return libcrux_secrets_int_public_integers_classify_27_49( (uint64_t)libcrux_secrets_int_public_integers_declassify_d8_de(self)); } /** This function found in impl {libcrux_secrets::traits::Classify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.classify_27 with types uint32_t */ static KRML_MUSTINLINE uint32_t libcrux_secrets_int_public_integers_classify_27_df(uint32_t self) { return self; } /** This function found in impl {libcrux_secrets::traits::Declassify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.declassify_d8 with types uint64_t */ static KRML_MUSTINLINE uint64_t libcrux_secrets_int_public_integers_declassify_d8_49(uint64_t self) { return self; } /** This function found in impl {libcrux_secrets::int::CastOps for u64} */ static KRML_MUSTINLINE uint32_t libcrux_secrets_int_as_u32_a3(uint64_t self) { return libcrux_secrets_int_public_integers_classify_27_df( (uint32_t)libcrux_secrets_int_public_integers_declassify_d8_49(self)); } /** This function found in impl {libcrux_secrets::int::CastOps for u32} */ static KRML_MUSTINLINE int16_t libcrux_secrets_int_as_i16_b8(uint32_t self) { return libcrux_secrets_int_public_integers_classify_27_39( (int16_t)libcrux_secrets_int_public_integers_declassify_d8_df(self)); } /** This function found in impl {libcrux_secrets::int::CastOps for i16} */ static KRML_MUSTINLINE int16_t libcrux_secrets_int_as_i16_f5(int16_t self) { return libcrux_secrets_int_public_integers_classify_27_39( libcrux_secrets_int_public_integers_declassify_d8_39(self)); } typedef struct libcrux_ml_kem_utils_extraction_helper_Keypair768_s { uint8_t fst[1152U]; uint8_t snd[1184U]; } libcrux_ml_kem_utils_extraction_helper_Keypair768; #define Ok 0 #define Err 1 typedef uint8_t Result_b2_tags; /** A monomorphic instance of core.result.Result with types uint8_t[24size_t], core_array_TryFromSliceError */ typedef struct Result_b2_s { Result_b2_tags tag; union { uint8_t case_Ok[24U]; TryFromSliceError case_Err; } val; } Result_b2; /** This function found in impl {core::result::Result[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of core.result.unwrap_26 with types uint8_t[24size_t], core_array_TryFromSliceError */ static inline void unwrap_26_70(Result_b2 self, uint8_t ret[24U]) { if (self.tag == Ok) { uint8_t f0[24U]; memcpy(f0, self.val.case_Ok, (size_t)24U * sizeof(uint8_t)); memcpy(ret, f0, (size_t)24U * sizeof(uint8_t)); } else { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "unwrap not Ok"); KRML_HOST_EXIT(255U); } } /** A monomorphic instance of core.result.Result with types uint8_t[20size_t], core_array_TryFromSliceError */ typedef struct Result_e1_s { Result_b2_tags tag; union { uint8_t case_Ok[20U]; TryFromSliceError case_Err; } val; } Result_e1; /** This function found in impl {core::result::Result[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of core.result.unwrap_26 with types uint8_t[20size_t], core_array_TryFromSliceError */ static inline void unwrap_26_20(Result_e1 self, uint8_t ret[20U]) { if (self.tag == Ok) { uint8_t f0[20U]; memcpy(f0, self.val.case_Ok, (size_t)20U * sizeof(uint8_t)); memcpy(ret, f0, (size_t)20U * sizeof(uint8_t)); } else { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "unwrap not Ok"); KRML_HOST_EXIT(255U); } } /** Pad the `slice` with `0`s at the end. */ /** A monomorphic instance of libcrux_ml_kem.utils.into_padded_array with const generics - LEN= 32 */ static KRML_MUSTINLINE void libcrux_ml_kem_utils_into_padded_array_9e( Eurydice_slice slice, uint8_t ret[32U]) { uint8_t out[32U] = {0U}; uint8_t *uu____0 = out; Eurydice_slice_copy( Eurydice_array_to_subslice3( uu____0, (size_t)0U, Eurydice_slice_len(slice, uint8_t), uint8_t *), slice, uint8_t); memcpy(ret, out, (size_t)32U * sizeof(uint8_t)); } /** A monomorphic instance of libcrux_ml_kem.types.MlKemPrivateKey with const generics - $2400size_t */ typedef struct libcrux_ml_kem_types_MlKemPrivateKey_d9_s { uint8_t value[2400U]; } libcrux_ml_kem_types_MlKemPrivateKey_d9; /** This function found in impl {core::default::Default for libcrux_ml_kem::types::MlKemPrivateKey} */ /** A monomorphic instance of libcrux_ml_kem.types.default_d3 with const generics - SIZE= 2400 */ static inline libcrux_ml_kem_types_MlKemPrivateKey_d9 libcrux_ml_kem_types_default_d3_28(void) { return ( KRML_CLITERAL(libcrux_ml_kem_types_MlKemPrivateKey_d9){.value = {0U}}); } /** A monomorphic instance of libcrux_ml_kem.types.MlKemPublicKey with const generics - $1184size_t */ typedef struct libcrux_ml_kem_types_MlKemPublicKey_30_s { uint8_t value[1184U]; } libcrux_ml_kem_types_MlKemPublicKey_30; /** This function found in impl {core::convert::From<@@Array> for libcrux_ml_kem::types::MlKemPublicKey} */ /** A monomorphic instance of libcrux_ml_kem.types.from_fd with const generics - SIZE= 1184 */ static inline libcrux_ml_kem_types_MlKemPublicKey_30 libcrux_ml_kem_types_from_fd_d0(uint8_t value[1184U]) { /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_value[1184U]; memcpy(copy_of_value, value, (size_t)1184U * sizeof(uint8_t)); libcrux_ml_kem_types_MlKemPublicKey_30 lit; memcpy(lit.value, copy_of_value, (size_t)1184U * sizeof(uint8_t)); return lit; } typedef struct libcrux_ml_kem_mlkem768_MlKem768KeyPair_s { libcrux_ml_kem_types_MlKemPrivateKey_d9 sk; libcrux_ml_kem_types_MlKemPublicKey_30 pk; } libcrux_ml_kem_mlkem768_MlKem768KeyPair; /** This function found in impl {libcrux_ml_kem::types::MlKemKeyPair} */ /** A monomorphic instance of libcrux_ml_kem.types.from_17 with const generics - PRIVATE_KEY_SIZE= 2400 - PUBLIC_KEY_SIZE= 1184 */ static inline libcrux_ml_kem_mlkem768_MlKem768KeyPair libcrux_ml_kem_types_from_17_74(libcrux_ml_kem_types_MlKemPrivateKey_d9 sk, libcrux_ml_kem_types_MlKemPublicKey_30 pk) { return (KRML_CLITERAL(libcrux_ml_kem_mlkem768_MlKem768KeyPair){.sk = sk, .pk = pk}); } /** This function found in impl {core::convert::From<@@Array> for libcrux_ml_kem::types::MlKemPrivateKey} */ /** A monomorphic instance of libcrux_ml_kem.types.from_77 with const generics - SIZE= 2400 */ static inline libcrux_ml_kem_types_MlKemPrivateKey_d9 libcrux_ml_kem_types_from_77_28(uint8_t value[2400U]) { /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_value[2400U]; memcpy(copy_of_value, value, (size_t)2400U * sizeof(uint8_t)); libcrux_ml_kem_types_MlKemPrivateKey_d9 lit; memcpy(lit.value, copy_of_value, (size_t)2400U * sizeof(uint8_t)); return lit; } /** A monomorphic instance of core.result.Result with types uint8_t[32size_t], core_array_TryFromSliceError */ typedef struct Result_fb_s { Result_b2_tags tag; union { uint8_t case_Ok[32U]; TryFromSliceError case_Err; } val; } Result_fb; /** This function found in impl {core::result::Result[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of core.result.unwrap_26 with types uint8_t[32size_t], core_array_TryFromSliceError */ static inline void unwrap_26_b3(Result_fb self, uint8_t ret[32U]) { a536 4 typedef struct libcrux_ml_kem_mlkem768_MlKem768Ciphertext_s { uint8_t value[1088U]; } libcrux_ml_kem_mlkem768_MlKem768Ciphertext; d543 1 a543 1 typedef struct tuple_c2_s { d546 1 a546 1 } tuple_c2; d549 2 a550 2 This function found in impl {core::convert::From<@@Array> for libcrux_ml_kem::types::MlKemCiphertext} d553 1 a553 1 A monomorphic instance of libcrux_ml_kem.types.from_e0 d558 1 a558 1 libcrux_ml_kem_types_from_e0_80(uint8_t value[1088U]) { d568 1 a568 6 This function found in impl {libcrux_ml_kem::types::MlKemPublicKey} */ /** A monomorphic instance of libcrux_ml_kem.types.as_slice_e6 with const generics - SIZE= 1184 a569 5 static inline uint8_t *libcrux_ml_kem_types_as_slice_e6_d0( libcrux_ml_kem_types_MlKemPublicKey_30 *self) { return self->value; } d571 1 a571 1 This function found in impl {libcrux_ml_kem::types::MlKemCiphertext} d574 1 a574 1 A monomorphic instance of libcrux_ml_kem.types.as_slice_a9 d576 1 a576 1 - SIZE= 1088 d578 2 a579 2 static inline uint8_t *libcrux_ml_kem_types_as_slice_a9_80( libcrux_ml_kem_mlkem768_MlKem768Ciphertext *self) { a583 15 A monomorphic instance of libcrux_ml_kem.utils.prf_input_inc with const generics - K= 3 */ static KRML_MUSTINLINE uint8_t libcrux_ml_kem_utils_prf_input_inc_e0( uint8_t (*prf_inputs)[33U], uint8_t domain_separator) { for (size_t i = (size_t)0U; i < (size_t)3U; i++) { size_t i0 = i; prf_inputs[i0][32U] = domain_separator; domain_separator = (uint32_t)domain_separator + 1U; } return domain_separator; } /** d591 1 a591 1 static KRML_MUSTINLINE void libcrux_ml_kem_utils_into_padded_array_c8( d596 2 a597 2 Eurydice_array_to_subslice3( uu____0, (size_t)0U, Eurydice_slice_len(slice, uint8_t), uint8_t *), d610 1 a610 1 static KRML_MUSTINLINE void libcrux_ml_kem_utils_into_padded_array_b6( d615 2 a616 2 Eurydice_array_to_subslice3( uu____0, (size_t)0U, Eurydice_slice_len(slice, uint8_t), uint8_t *), d622 2 a623 2 This function found in impl {core::convert::AsRef<@@Slice> for libcrux_ml_kem::types::MlKemCiphertext} d626 1 a626 1 A monomorphic instance of libcrux_ml_kem.types.as_ref_d3 d630 1 a630 1 static inline Eurydice_slice libcrux_ml_kem_types_as_ref_d3_80( d643 1 a643 1 static KRML_MUSTINLINE void libcrux_ml_kem_utils_into_padded_array_15( d648 2 a649 2 Eurydice_array_to_subslice3( uu____0, (size_t)0U, Eurydice_slice_len(slice, uint8_t), uint8_t *), d662 1 a662 1 static KRML_MUSTINLINE void libcrux_ml_kem_utils_into_padded_array_24( d667 2 a668 2 Eurydice_array_to_subslice3( uu____0, (size_t)0U, Eurydice_slice_len(slice, uint8_t), uint8_t *), d673 3 a675 6 typedef struct Eurydice_slice_uint8_t_x4_s { Eurydice_slice fst; Eurydice_slice snd; Eurydice_slice thd; Eurydice_slice f3; } Eurydice_slice_uint8_t_x4; d677 5 a681 144 typedef struct Eurydice_slice_uint8_t_x2_s { Eurydice_slice fst; Eurydice_slice snd; } Eurydice_slice_uint8_t_x2; /** Unpack an incoming private key into it's different parts. We have this here in types to extract into a common core for C. */ /** A monomorphic instance of libcrux_ml_kem.types.unpack_private_key with const generics - CPA_SECRET_KEY_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 */ static inline Eurydice_slice_uint8_t_x4 libcrux_ml_kem_types_unpack_private_key_b4(Eurydice_slice private_key) { Eurydice_slice_uint8_t_x2 uu____0 = Eurydice_slice_split_at( private_key, (size_t)1152U, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice ind_cpa_secret_key = uu____0.fst; Eurydice_slice secret_key0 = uu____0.snd; Eurydice_slice_uint8_t_x2 uu____1 = Eurydice_slice_split_at( secret_key0, (size_t)1184U, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice ind_cpa_public_key = uu____1.fst; Eurydice_slice secret_key = uu____1.snd; Eurydice_slice_uint8_t_x2 uu____2 = Eurydice_slice_split_at( secret_key, LIBCRUX_ML_KEM_CONSTANTS_H_DIGEST_SIZE, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice ind_cpa_public_key_hash = uu____2.fst; Eurydice_slice implicit_rejection_value = uu____2.snd; return ( KRML_CLITERAL(Eurydice_slice_uint8_t_x4){.fst = ind_cpa_secret_key, .snd = ind_cpa_public_key, .thd = ind_cpa_public_key_hash, .f3 = implicit_rejection_value}); } /** This function found in impl {libcrux_secrets::traits::Declassify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.declassify_d8 with types uint8_t[24size_t] */ static KRML_MUSTINLINE void libcrux_secrets_int_public_integers_declassify_d8_d2(uint8_t self[24U], uint8_t ret[24U]) { memcpy(ret, self, (size_t)24U * sizeof(uint8_t)); } /** This function found in impl {libcrux_secrets::traits::Declassify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.declassify_d8 with types uint8_t[20size_t] */ static KRML_MUSTINLINE void libcrux_secrets_int_public_integers_declassify_d8_57(uint8_t self[20U], uint8_t ret[20U]) { memcpy(ret, self, (size_t)20U * sizeof(uint8_t)); } /** This function found in impl {libcrux_secrets::traits::Declassify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.declassify_d8 with types uint8_t[8size_t] */ static KRML_MUSTINLINE void libcrux_secrets_int_public_integers_declassify_d8_76(uint8_t self[8U], uint8_t ret[8U]) { memcpy(ret, self, (size_t)8U * sizeof(uint8_t)); } /** This function found in impl {libcrux_secrets::traits::Declassify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.declassify_d8 with types uint8_t[2size_t] */ static KRML_MUSTINLINE void libcrux_secrets_int_public_integers_declassify_d8_d4(uint8_t self[2U], uint8_t ret[2U]) { memcpy(ret, self, (size_t)2U * sizeof(uint8_t)); } /** This function found in impl {libcrux_secrets::traits::Classify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.classify_27 with types int16_t[16size_t] */ static KRML_MUSTINLINE void libcrux_secrets_int_public_integers_classify_27_46( int16_t self[16U], int16_t ret[16U]) { memcpy(ret, self, (size_t)16U * sizeof(int16_t)); } /** This function found in impl {libcrux_secrets::traits::ClassifyRef<&'a (@@Slice)> for &'a (@@Slice)} */ /** A monomorphic instance of libcrux_secrets.int.classify_public.classify_ref_9b with types uint8_t */ static KRML_MUSTINLINE Eurydice_slice libcrux_secrets_int_classify_public_classify_ref_9b_90(Eurydice_slice self) { return self; } /** This function found in impl {libcrux_secrets::traits::ClassifyRef<&'a (@@Slice)> for &'a (@@Slice)} */ /** A monomorphic instance of libcrux_secrets.int.classify_public.classify_ref_9b with types int16_t */ static KRML_MUSTINLINE Eurydice_slice libcrux_secrets_int_classify_public_classify_ref_9b_39(Eurydice_slice self) { return self; } /** A monomorphic instance of core.result.Result with types int16_t[16size_t], core_array_TryFromSliceError */ typedef struct Result_0a_s { Result_b2_tags tag; union { int16_t case_Ok[16U]; d684 1 a684 1 } Result_0a; d687 1 a687 2 This function found in impl {core::result::Result[TraitClause@@0, TraitClause@@1]} d690 1 a690 1 A monomorphic instance of core.result.unwrap_26 d694 1 a694 1 static inline void unwrap_26_00(Result_0a self, int16_t ret[16U]) { d711 2 a712 2 typedef struct Result_15_s { Result_b2_tags tag; d717 1 a717 1 } Result_15; d720 1 a720 2 This function found in impl {core::result::Result[TraitClause@@0, TraitClause@@1]} d723 1 a723 1 A monomorphic instance of core.result.unwrap_26 d727 1 a727 1 static inline void unwrap_26_68(Result_15 self, uint8_t ret[8U]) { d739 10 d753 2 a754 2 #define libcrux_mlkem_core_H_DEFINED #endif /* libcrux_mlkem_core_H */ d756 1 a756 1 /* from libcrux/libcrux-ml-kem/extracts/c_header_only/generated/libcrux_ct_ops.h */ d758 1 a758 1 * SPDX-FileCopyrightText: 2025 Cryspen Sarl d763 5 a767 5 * Charon: 667d2fc98984ff7f3df989c2367e6c1fa4a000e7 * Eurydice: 2381cbc416ef2ad0b561c362c500bc84f36b6785 * Karamel: 80f5435f2fc505973c469a4afcc8d875cddd0d8b * F*: 71d8221589d4d438af3706d89cb653cf53e18aab * Libcrux: 68dfed5a4a9e40277f62828471c029afed1ecdcc d770 2 a771 3 #ifndef libcrux_ct_ops_H #define libcrux_ct_ops_H d781 1 a781 2 static KRML_NOINLINE uint8_t libcrux_ml_kem_constant_time_ops_inz(uint8_t value) { d783 6 a788 3 uint8_t result = (uint8_t)((uint32_t)core_num__u16__wrapping_add(~value0, 1U) >> 8U); return (uint32_t)result & 1U; d800 1 a800 1 static KRML_NOINLINE uint8_t libcrux_ml_kem_constant_time_ops_compare( d805 3 a807 4 uint8_t nr = (uint32_t)r | ((uint32_t)Eurydice_slice_index(lhs, i0, uint8_t, uint8_t *) ^ (uint32_t)Eurydice_slice_index(rhs, i0, uint8_t, uint8_t *)); r = nr; d822 1 a822 1 static KRML_NOINLINE void libcrux_ml_kem_constant_time_ops_select_ct( d825 1 a825 1 uint8_t mask = core_num__u8__wrapping_sub( d831 4 a834 6 uint8_t outi = ((uint32_t)Eurydice_slice_index(lhs, i0, uint8_t, uint8_t *) & (uint32_t)mask) | ((uint32_t)Eurydice_slice_index(rhs, i0, uint8_t, uint8_t *) & (uint32_t)~mask); out[i0] = outi; d846 1 a846 1 static KRML_NOINLINE void d863 2 a864 2 #define libcrux_ct_ops_H_DEFINED #endif /* libcrux_ct_ops_H */ d866 1 a866 1 /* from libcrux/libcrux-ml-kem/extracts/c_header_only/generated/libcrux_sha3_portable.h */ d868 1 a868 1 * SPDX-FileCopyrightText: 2025 Cryspen Sarl d873 5 a877 5 * Charon: 667d2fc98984ff7f3df989c2367e6c1fa4a000e7 * Eurydice: 2381cbc416ef2ad0b561c362c500bc84f36b6785 * Karamel: 80f5435f2fc505973c469a4afcc8d875cddd0d8b * F*: 71d8221589d4d438af3706d89cb653cf53e18aab * Libcrux: 68dfed5a4a9e40277f62828471c029afed1ecdcc d880 2 a881 3 #ifndef libcrux_sha3_portable_H #define libcrux_sha3_portable_H d888 26 d915 2 a916 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d918 1 a918 1 static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_zero_d2(void) { d922 1 a922 1 static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable__veor5q_u64( d924 4 a927 1 return (((a ^ b) ^ c) ^ d) ^ e; d931 2 a932 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d934 1 a934 1 static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_xor5_d2( d936 1 a936 1 return libcrux_sha3_simd_portable__veor5q_u64(a, b, c, d, e); d940 1 a940 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d946 2 a947 2 libcrux_sha3_simd_portable_rotate_left_76(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)1); d951 1 a951 1 libcrux_sha3_simd_portable__vrax1q_u64(uint64_t a, uint64_t b) { d953 1 a953 1 return uu____0 ^ libcrux_sha3_simd_portable_rotate_left_76(b); d957 2 a958 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d961 2 a962 2 libcrux_sha3_simd_portable_rotate_left1_and_xor_d2(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vrax1q_u64(a, b); d966 1 a966 1 libcrux_sha3_simd_portable__vbcaxq_u64(uint64_t a, uint64_t b, uint64_t c) { d971 2 a972 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d974 3 a976 3 static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_and_not_xor_d2(uint64_t a, uint64_t b, uint64_t c) { return libcrux_sha3_simd_portable__vbcaxq_u64(a, b, c); d980 1 a980 1 libcrux_sha3_simd_portable__veorq_n_u64(uint64_t a, uint64_t c) { d985 2 a986 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d989 2 a990 2 libcrux_sha3_simd_portable_xor_constant_d2(uint64_t a, uint64_t c) { return libcrux_sha3_simd_portable__veorq_n_u64(a, c); d994 2 a995 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d997 2 a998 2 static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_xor_d2(uint64_t a, uint64_t b) { d1002 4 a1005 31 static const uint64_t libcrux_sha3_generic_keccak_constants_ROUNDCONSTANTS[24U] = { 1ULL, 32898ULL, 9223372036854808714ULL, 9223372039002292224ULL, 32907ULL, 2147483649ULL, 9223372039002292353ULL, 9223372036854808585ULL, 138ULL, 136ULL, 2147516425ULL, 2147483658ULL, 2147516555ULL, 9223372036854775947ULL, 9223372036854808713ULL, 9223372036854808579ULL, 9223372036854808578ULL, 9223372036854775936ULL, 32778ULL, 9223372039002259466ULL, 9223372039002292353ULL, 9223372036854808704ULL, 2147483649ULL, 9223372039002292232ULL}; typedef struct size_t_x2_s { size_t fst; size_t snd; } size_t_x2; d1008 2 a1009 4 A monomorphic instance of libcrux_sha3.generic_keccak.KeccakState with types uint64_t with const generics - $1size_t d1011 22 a1032 3 typedef struct libcrux_sha3_generic_keccak_KeccakState_17_s { uint64_t st[25U]; } libcrux_sha3_generic_keccak_KeccakState_17; d1035 2 a1036 2 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} d1038 6 d1045 1 a1045 1 A monomorphic instance of libcrux_sha3.generic_keccak.new_80 d1048 1 a1048 1 - N= 1 d1050 3 a1052 10 static KRML_MUSTINLINE libcrux_sha3_generic_keccak_KeccakState_17 libcrux_sha3_generic_keccak_new_80_04(void) { libcrux_sha3_generic_keccak_KeccakState_17 lit; uint64_t repeat_expression[25U]; for (size_t i = (size_t)0U; i < (size_t)25U; i++) { repeat_expression[i] = libcrux_sha3_simd_portable_zero_d2(); } memcpy(lit.st, repeat_expression, (size_t)25U * sizeof(uint64_t)); return lit; } d1055 5 a1059 4 A monomorphic instance of libcrux_sha3.traits.get_ij with types uint64_t with const generics - N= 1 a1060 6 static KRML_MUSTINLINE uint64_t *libcrux_sha3_traits_get_ij_04(uint64_t *arr, size_t i, size_t j) { return &arr[(size_t)5U * j + i]; } d1062 1 a1062 1 A monomorphic instance of libcrux_sha3.traits.set_ij d1067 29 a1095 4 static KRML_MUSTINLINE void libcrux_sha3_traits_set_ij_04(uint64_t *arr, size_t i, size_t j, uint64_t value) { arr[(size_t)5U * j + i] = value; d1099 1 a1099 1 A monomorphic instance of libcrux_sha3.simd.portable.load_block d1103 2 a1104 3 static KRML_MUSTINLINE void libcrux_sha3_simd_portable_load_block_f8( uint64_t *state, Eurydice_slice blocks, size_t start) { uint64_t state_flat[25U] = {0U}; a1106 1 size_t offset = start + (size_t)8U * i0; d1108 1 a1108 1 Result_15 dst; d1111 8 a1118 13 Eurydice_slice_subslice3(blocks, offset, offset + (size_t)8U, uint8_t *), Eurydice_slice, uint8_t[8U], TryFromSliceError); unwrap_26_68(dst, uu____0); state_flat[i0] = core_num__u64__from_le_bytes(uu____0); } for (size_t i = (size_t)0U; i < (size_t)72U / (size_t)8U; i++) { size_t i0 = i; libcrux_sha3_traits_set_ij_04( state, i0 / (size_t)5U, i0 % (size_t)5U, libcrux_sha3_traits_get_ij_04(state, i0 / (size_t)5U, i0 % (size_t)5U)[0U] ^ state_flat[i0]); d1123 2 a1124 4 This function found in impl {libcrux_sha3::traits::Absorb<1usize> for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d1127 1 a1127 1 A monomorphic instance of libcrux_sha3.simd.portable.load_block_a1 d1131 7 a1137 149 static inline void libcrux_sha3_simd_portable_load_block_a1_f8( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *input, size_t start) { libcrux_sha3_simd_portable_load_block_f8(self->st, input[0U], start); } /** This function found in impl {core::ops::index::Index<(usize, usize), T> for libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.index_c2 with types uint64_t with const generics - N= 1 */ static inline uint64_t *libcrux_sha3_generic_keccak_index_c2_04( libcrux_sha3_generic_keccak_KeccakState_17 *self, size_t_x2 index) { return libcrux_sha3_traits_get_ij_04(self->st, index.fst, index.snd); } /** This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.theta_80 with types uint64_t with const generics - N= 1 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_theta_80_04( libcrux_sha3_generic_keccak_KeccakState_17 *self, uint64_t ret[5U]) { uint64_t c[5U] = { libcrux_sha3_simd_portable_xor5_d2( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)0U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)0U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)0U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)0U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)0U}))[0U]), libcrux_sha3_simd_portable_xor5_d2( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)1U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)1U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)1U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)1U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)1U}))[0U]), libcrux_sha3_simd_portable_xor5_d2( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)2U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)2U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)2U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)2U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)2U}))[0U]), libcrux_sha3_simd_portable_xor5_d2( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)3U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)3U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)3U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)3U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)3U}))[0U]), libcrux_sha3_simd_portable_xor5_d2( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)4U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)4U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)4U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)4U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)4U}))[0U])}; uint64_t uu____0 = libcrux_sha3_simd_portable_rotate_left1_and_xor_d2( c[((size_t)0U + (size_t)4U) % (size_t)5U], c[((size_t)0U + (size_t)1U) % (size_t)5U]); uint64_t uu____1 = libcrux_sha3_simd_portable_rotate_left1_and_xor_d2( c[((size_t)1U + (size_t)4U) % (size_t)5U], c[((size_t)1U + (size_t)1U) % (size_t)5U]); uint64_t uu____2 = libcrux_sha3_simd_portable_rotate_left1_and_xor_d2( c[((size_t)2U + (size_t)4U) % (size_t)5U], c[((size_t)2U + (size_t)1U) % (size_t)5U]); uint64_t uu____3 = libcrux_sha3_simd_portable_rotate_left1_and_xor_d2( c[((size_t)3U + (size_t)4U) % (size_t)5U], c[((size_t)3U + (size_t)1U) % (size_t)5U]); ret[0U] = uu____0; ret[1U] = uu____1; ret[2U] = uu____2; ret[3U] = uu____3; ret[4U] = libcrux_sha3_simd_portable_rotate_left1_and_xor_d2( c[((size_t)4U + (size_t)4U) % (size_t)5U], c[((size_t)4U + (size_t)1U) % (size_t)5U]); } /** This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.set_80 with types uint64_t with const generics - N= 1 */ static inline void libcrux_sha3_generic_keccak_set_80_04( libcrux_sha3_generic_keccak_KeccakState_17 *self, size_t i, size_t j, uint64_t v) { libcrux_sha3_traits_set_ij_04(self->st, i, j, v); d1141 1 a1141 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1147 2 a1148 2 libcrux_sha3_simd_portable_rotate_left_02(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)36); d1152 1 a1152 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1158 3 a1160 2 libcrux_sha3_simd_portable__vxarq_u64_02(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_02(a ^ b); d1164 2 a1165 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1168 1 a1168 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1174 2 a1175 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_02(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_02(a, b); d1179 1 a1179 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1185 2 a1186 2 libcrux_sha3_simd_portable_rotate_left_ac(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)3); d1190 1 a1190 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1196 3 a1198 2 libcrux_sha3_simd_portable__vxarq_u64_ac(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_ac(a ^ b); d1202 2 a1203 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1206 1 a1206 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1212 2 a1213 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_ac(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_ac(a, b); d1217 1 a1217 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1223 2 a1224 2 libcrux_sha3_simd_portable_rotate_left_020(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)41); d1228 1 a1228 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1234 3 a1236 2 libcrux_sha3_simd_portable__vxarq_u64_020(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_020(a ^ b); d1240 2 a1241 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1244 1 a1244 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1250 2 a1251 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_020(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_020(a, b); d1255 1 a1255 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1261 2 a1262 2 libcrux_sha3_simd_portable_rotate_left_a9(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)18); d1266 1 a1266 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1272 3 a1274 2 libcrux_sha3_simd_portable__vxarq_u64_a9(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_a9(a ^ b); d1278 2 a1279 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1282 1 a1282 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1288 2 a1289 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_a9(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_a9(a, b); d1293 1 a1293 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1299 3 a1301 2 libcrux_sha3_simd_portable__vxarq_u64_76(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_76(a ^ b); d1305 2 a1306 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1309 1 a1309 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1315 2 a1316 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_76(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_76(a, b); d1320 1 a1320 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1326 2 a1327 2 libcrux_sha3_simd_portable_rotate_left_58(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)44); d1331 1 a1331 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1337 3 a1339 2 libcrux_sha3_simd_portable__vxarq_u64_58(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_58(a ^ b); d1343 2 a1344 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1347 1 a1347 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1353 2 a1354 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_58(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_58(a, b); d1358 1 a1358 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1364 2 a1365 2 libcrux_sha3_simd_portable_rotate_left_e0(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)10); d1369 1 a1369 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1375 3 a1377 2 libcrux_sha3_simd_portable__vxarq_u64_e0(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_e0(a ^ b); d1381 2 a1382 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1385 1 a1385 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1391 2 a1392 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_e0(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_e0(a, b); d1396 1 a1396 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1402 2 a1403 2 libcrux_sha3_simd_portable_rotate_left_63(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)45); d1407 1 a1407 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1413 3 a1415 2 libcrux_sha3_simd_portable__vxarq_u64_63(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_63(a ^ b); d1419 2 a1420 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1423 1 a1423 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1429 2 a1430 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_63(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_63(a, b); d1434 1 a1434 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1440 2 a1441 2 libcrux_sha3_simd_portable_rotate_left_6a(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)2); d1445 1 a1445 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1451 3 a1453 2 libcrux_sha3_simd_portable__vxarq_u64_6a(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_6a(a ^ b); d1457 2 a1458 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1461 1 a1461 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1467 2 a1468 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_6a(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_6a(a, b); d1472 1 a1472 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1478 2 a1479 2 libcrux_sha3_simd_portable_rotate_left_ab(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)62); d1483 1 a1483 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1489 3 a1491 2 libcrux_sha3_simd_portable__vxarq_u64_ab(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_ab(a ^ b); d1495 2 a1496 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1499 1 a1499 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1505 2 a1506 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_ab(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_ab(a, b); d1510 1 a1510 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1516 2 a1517 2 libcrux_sha3_simd_portable_rotate_left_5b(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)6); d1521 1 a1521 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1527 3 a1529 2 libcrux_sha3_simd_portable__vxarq_u64_5b(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_5b(a ^ b); d1533 2 a1534 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1537 1 a1537 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1543 2 a1544 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_5b(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_5b(a, b); d1548 1 a1548 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1554 2 a1555 2 libcrux_sha3_simd_portable_rotate_left_6f(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)43); d1559 1 a1559 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1565 3 a1567 2 libcrux_sha3_simd_portable__vxarq_u64_6f(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_6f(a ^ b); d1571 2 a1572 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1575 1 a1575 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1581 2 a1582 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_6f(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_6f(a, b); d1586 1 a1586 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1592 2 a1593 2 libcrux_sha3_simd_portable_rotate_left_62(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)15); d1597 1 a1597 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1603 3 a1605 2 libcrux_sha3_simd_portable__vxarq_u64_62(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_62(a ^ b); d1609 2 a1610 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1613 1 a1613 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1619 2 a1620 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_62(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_62(a, b); d1624 1 a1624 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1630 2 a1631 2 libcrux_sha3_simd_portable_rotate_left_23(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)61); d1635 1 a1635 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1641 3 a1643 2 libcrux_sha3_simd_portable__vxarq_u64_23(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_23(a ^ b); d1647 2 a1648 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1651 1 a1651 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1657 2 a1658 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_23(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_23(a, b); d1662 1 a1662 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1668 2 a1669 2 libcrux_sha3_simd_portable_rotate_left_37(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)28); d1673 1 a1673 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1679 3 a1681 2 libcrux_sha3_simd_portable__vxarq_u64_37(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_37(a ^ b); d1685 2 a1686 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1689 1 a1689 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1695 2 a1696 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_37(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_37(a, b); d1700 1 a1700 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1706 2 a1707 2 libcrux_sha3_simd_portable_rotate_left_bb(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)55); d1711 1 a1711 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1717 3 a1719 2 libcrux_sha3_simd_portable__vxarq_u64_bb(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_bb(a ^ b); d1723 2 a1724 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1727 1 a1727 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1733 2 a1734 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_bb(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_bb(a, b); d1738 1 a1738 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1744 2 a1745 2 libcrux_sha3_simd_portable_rotate_left_b9(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)25); d1749 1 a1749 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1755 3 a1757 2 libcrux_sha3_simd_portable__vxarq_u64_b9(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_b9(a ^ b); d1761 2 a1762 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1765 1 a1765 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1771 2 a1772 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_b9(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_b9(a, b); d1776 1 a1776 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1782 2 a1783 2 libcrux_sha3_simd_portable_rotate_left_54(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)21); d1787 1 a1787 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1793 3 a1795 2 libcrux_sha3_simd_portable__vxarq_u64_54(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_54(a ^ b); d1799 2 a1800 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1803 1 a1803 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1809 2 a1810 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_54(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_54(a, b); d1814 1 a1814 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1820 2 a1821 2 libcrux_sha3_simd_portable_rotate_left_4c(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)56); d1825 1 a1825 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1831 3 a1833 2 libcrux_sha3_simd_portable__vxarq_u64_4c(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_4c(a ^ b); d1837 2 a1838 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1841 1 a1841 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1847 2 a1848 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_4c(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_4c(a, b); d1852 1 a1852 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1858 2 a1859 2 libcrux_sha3_simd_portable_rotate_left_ce(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)27); d1863 1 a1863 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1869 3 a1871 2 libcrux_sha3_simd_portable__vxarq_u64_ce(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_ce(a ^ b); d1875 2 a1876 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1879 1 a1879 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1885 2 a1886 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_ce(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_ce(a, b); d1890 1 a1890 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1896 2 a1897 2 libcrux_sha3_simd_portable_rotate_left_77(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)20); d1901 1 a1901 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1907 3 a1909 2 libcrux_sha3_simd_portable__vxarq_u64_77(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_77(a ^ b); d1913 2 a1914 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1917 1 a1917 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1923 2 a1924 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_77(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_77(a, b); d1928 1 a1928 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1934 2 a1935 2 libcrux_sha3_simd_portable_rotate_left_25(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)39); d1939 1 a1939 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1945 3 a1947 2 libcrux_sha3_simd_portable__vxarq_u64_25(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_25(a ^ b); d1951 2 a1952 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1955 1 a1955 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1961 2 a1962 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_25(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_25(a, b); d1966 1 a1966 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1972 2 a1973 2 libcrux_sha3_simd_portable_rotate_left_af(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)8); d1977 1 a1977 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1983 3 a1985 2 libcrux_sha3_simd_portable__vxarq_u64_af(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_af(a ^ b); d1989 2 a1990 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1993 1 a1993 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1999 2 a2000 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_af(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_af(a, b); d2004 1 a2004 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d2010 2 a2011 2 libcrux_sha3_simd_portable_rotate_left_fd(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)14); d2015 1 a2015 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d2021 3 a2023 2 libcrux_sha3_simd_portable__vxarq_u64_fd(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_fd(a ^ b); d2027 2 a2028 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d2031 1 a2031 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d2037 2 a2038 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_fd(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_fd(a, b); d2042 1 a2042 5 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.rho_80 d2047 84 a2130 201 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_rho_80_04( libcrux_sha3_generic_keccak_KeccakState_17 *self, uint64_t t[5U]) { libcrux_sha3_generic_keccak_set_80_04( self, (size_t)0U, (size_t)0U, libcrux_sha3_simd_portable_xor_d2( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)0U}))[0U], t[0U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____0 = self; libcrux_sha3_generic_keccak_set_80_04( uu____0, (size_t)1U, (size_t)0U, libcrux_sha3_simd_portable_xor_and_rotate_d2_02( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)0U}))[0U], t[0U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____1 = self; libcrux_sha3_generic_keccak_set_80_04( uu____1, (size_t)2U, (size_t)0U, libcrux_sha3_simd_portable_xor_and_rotate_d2_ac( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)0U}))[0U], t[0U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____2 = self; libcrux_sha3_generic_keccak_set_80_04( uu____2, (size_t)3U, (size_t)0U, libcrux_sha3_simd_portable_xor_and_rotate_d2_020( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)0U}))[0U], t[0U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____3 = self; libcrux_sha3_generic_keccak_set_80_04( uu____3, (size_t)4U, (size_t)0U, libcrux_sha3_simd_portable_xor_and_rotate_d2_a9( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)0U}))[0U], t[0U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____4 = self; libcrux_sha3_generic_keccak_set_80_04( uu____4, (size_t)0U, (size_t)1U, libcrux_sha3_simd_portable_xor_and_rotate_d2_76( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)1U}))[0U], t[1U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____5 = self; libcrux_sha3_generic_keccak_set_80_04( uu____5, (size_t)1U, (size_t)1U, libcrux_sha3_simd_portable_xor_and_rotate_d2_58( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)1U}))[0U], t[1U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____6 = self; libcrux_sha3_generic_keccak_set_80_04( uu____6, (size_t)2U, (size_t)1U, libcrux_sha3_simd_portable_xor_and_rotate_d2_e0( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)1U}))[0U], t[1U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____7 = self; libcrux_sha3_generic_keccak_set_80_04( uu____7, (size_t)3U, (size_t)1U, libcrux_sha3_simd_portable_xor_and_rotate_d2_63( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)1U}))[0U], t[1U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____8 = self; libcrux_sha3_generic_keccak_set_80_04( uu____8, (size_t)4U, (size_t)1U, libcrux_sha3_simd_portable_xor_and_rotate_d2_6a( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)1U}))[0U], t[1U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____9 = self; libcrux_sha3_generic_keccak_set_80_04( uu____9, (size_t)0U, (size_t)2U, libcrux_sha3_simd_portable_xor_and_rotate_d2_ab( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)2U}))[0U], t[2U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____10 = self; libcrux_sha3_generic_keccak_set_80_04( uu____10, (size_t)1U, (size_t)2U, libcrux_sha3_simd_portable_xor_and_rotate_d2_5b( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)2U}))[0U], t[2U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____11 = self; libcrux_sha3_generic_keccak_set_80_04( uu____11, (size_t)2U, (size_t)2U, libcrux_sha3_simd_portable_xor_and_rotate_d2_6f( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)2U}))[0U], t[2U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____12 = self; libcrux_sha3_generic_keccak_set_80_04( uu____12, (size_t)3U, (size_t)2U, libcrux_sha3_simd_portable_xor_and_rotate_d2_62( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)2U}))[0U], t[2U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____13 = self; libcrux_sha3_generic_keccak_set_80_04( uu____13, (size_t)4U, (size_t)2U, libcrux_sha3_simd_portable_xor_and_rotate_d2_23( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)2U}))[0U], t[2U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____14 = self; libcrux_sha3_generic_keccak_set_80_04( uu____14, (size_t)0U, (size_t)3U, libcrux_sha3_simd_portable_xor_and_rotate_d2_37( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)3U}))[0U], t[3U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____15 = self; libcrux_sha3_generic_keccak_set_80_04( uu____15, (size_t)1U, (size_t)3U, libcrux_sha3_simd_portable_xor_and_rotate_d2_bb( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)3U}))[0U], t[3U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____16 = self; libcrux_sha3_generic_keccak_set_80_04( uu____16, (size_t)2U, (size_t)3U, libcrux_sha3_simd_portable_xor_and_rotate_d2_b9( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)3U}))[0U], t[3U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____17 = self; libcrux_sha3_generic_keccak_set_80_04( uu____17, (size_t)3U, (size_t)3U, libcrux_sha3_simd_portable_xor_and_rotate_d2_54( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)3U}))[0U], t[3U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____18 = self; libcrux_sha3_generic_keccak_set_80_04( uu____18, (size_t)4U, (size_t)3U, libcrux_sha3_simd_portable_xor_and_rotate_d2_4c( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)3U}))[0U], t[3U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____19 = self; libcrux_sha3_generic_keccak_set_80_04( uu____19, (size_t)0U, (size_t)4U, libcrux_sha3_simd_portable_xor_and_rotate_d2_ce( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)4U}))[0U], t[4U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____20 = self; libcrux_sha3_generic_keccak_set_80_04( uu____20, (size_t)1U, (size_t)4U, libcrux_sha3_simd_portable_xor_and_rotate_d2_77( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)4U}))[0U], t[4U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____21 = self; libcrux_sha3_generic_keccak_set_80_04( uu____21, (size_t)2U, (size_t)4U, libcrux_sha3_simd_portable_xor_and_rotate_d2_25( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)4U}))[0U], t[4U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____22 = self; libcrux_sha3_generic_keccak_set_80_04( uu____22, (size_t)3U, (size_t)4U, libcrux_sha3_simd_portable_xor_and_rotate_d2_af( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)4U}))[0U], t[4U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____23 = self; libcrux_sha3_generic_keccak_set_80_04( uu____23, (size_t)4U, (size_t)4U, libcrux_sha3_simd_portable_xor_and_rotate_d2_fd( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)4U}))[0U], t[4U])); d2134 1 a2134 5 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.pi_80 d2139 28 a2166 123 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_pi_80_04( libcrux_sha3_generic_keccak_KeccakState_17 *self) { libcrux_sha3_generic_keccak_KeccakState_17 old = self[0U]; libcrux_sha3_generic_keccak_set_80_04( self, (size_t)1U, (size_t)0U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)3U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)2U, (size_t)0U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)1U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)3U, (size_t)0U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)4U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)4U, (size_t)0U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)2U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)0U, (size_t)1U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)1U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)1U, (size_t)1U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)4U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)2U, (size_t)1U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)2U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)3U, (size_t)1U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)0U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)4U, (size_t)1U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)3U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)0U, (size_t)2U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)2U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)1U, (size_t)2U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)0U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)2U, (size_t)2U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)3U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)3U, (size_t)2U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)1U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)4U, (size_t)2U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)4U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)0U, (size_t)3U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)3U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)1U, (size_t)3U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)1U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)2U, (size_t)3U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)4U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)3U, (size_t)3U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)2U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)4U, (size_t)3U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)0U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)0U, (size_t)4U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)4U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)1U, (size_t)4U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)2U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)2U, (size_t)4U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)0U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)3U, (size_t)4U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)3U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)4U, (size_t)4U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)1U}))[0U]); d2170 1 a2170 5 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.chi_80 d2175 4 a2178 3 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_chi_80_04( libcrux_sha3_generic_keccak_KeccakState_17 *self) { libcrux_sha3_generic_keccak_KeccakState_17 old = self[0U]; d2183 3 a2185 13 libcrux_sha3_generic_keccak_set_80_04( self, i1, j, libcrux_sha3_simd_portable_and_not_xor_d2( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = i1, .snd = j}))[0U], libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){ .fst = i1, .snd = (j + (size_t)2U) % (size_t)5U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){ .fst = i1, .snd = (j + (size_t)1U) % (size_t)5U}))[0U])); d2191 1 a2191 5 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.iota_80 d2196 4 a2199 9 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_iota_80_04( libcrux_sha3_generic_keccak_KeccakState_17 *self, size_t i) { libcrux_sha3_generic_keccak_set_80_04( self, (size_t)0U, (size_t)0U, libcrux_sha3_simd_portable_xor_constant_d2( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)0U}))[0U], libcrux_sha3_generic_keccak_constants_ROUNDCONSTANTS[i])); d2203 1 a2203 5 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.keccakf1600_80 d2208 2 a2209 2 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_keccakf1600_80_04( libcrux_sha3_generic_keccak_KeccakState_17 *self) { d2212 4 a2215 9 uint64_t t[5U]; libcrux_sha3_generic_keccak_theta_80_04(self, t); libcrux_sha3_generic_keccak_KeccakState_17 *uu____0 = self; uint64_t uu____1[5U]; memcpy(uu____1, t, (size_t)5U * sizeof(uint64_t)); libcrux_sha3_generic_keccak_rho_80_04(uu____0, uu____1); libcrux_sha3_generic_keccak_pi_80_04(self); libcrux_sha3_generic_keccak_chi_80_04(self); libcrux_sha3_generic_keccak_iota_80_04(self, i0); d2220 1 a2220 5 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_block_80 d2226 7 a2232 5 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_block_80_c6( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *blocks, size_t start) { libcrux_sha3_simd_portable_load_block_a1_f8(self, blocks, start); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); d2236 1 a2236 1 A monomorphic instance of libcrux_sha3.simd.portable.load_last a2238 1 - DELIMITER= 6 d2240 5 a2244 11 static KRML_MUSTINLINE void libcrux_sha3_simd_portable_load_last_96( uint64_t *state, Eurydice_slice blocks, size_t start, size_t len) { uint8_t buffer[72U] = {0U}; Eurydice_slice_copy( Eurydice_array_to_subslice3(buffer, (size_t)0U, len, uint8_t *), Eurydice_slice_subslice3(blocks, start, start + len, uint8_t *), uint8_t); buffer[len] = 6U; size_t uu____0 = (size_t)72U - (size_t)1U; buffer[uu____0] = (uint32_t)buffer[uu____0] | 128U; libcrux_sha3_simd_portable_load_block_f8( state, Eurydice_array_to_slice((size_t)72U, buffer, uint8_t), (size_t)0U); d2248 2 a2249 4 This function found in impl {libcrux_sha3::traits::Absorb<1usize> for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d2252 1 a2252 1 A monomorphic instance of libcrux_sha3.simd.portable.load_last_a1 a2254 1 - DELIMITER= 6 d2256 7 a2262 4 static inline void libcrux_sha3_simd_portable_load_last_a1_96( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *input, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_96(self->st, input[0U], start, len); d2266 1 a2266 5 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_final_80 d2273 21 a2293 5 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_final_80_9e( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *last, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_a1_96(self, last, start, len); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); d2297 1 a2297 1 A monomorphic instance of libcrux_sha3.simd.portable.store_block d2301 6 a2306 8 static KRML_MUSTINLINE void libcrux_sha3_simd_portable_store_block_f8( uint64_t *s, Eurydice_slice out, size_t start, size_t len) { size_t octets = len / (size_t)8U; for (size_t i = (size_t)0U; i < octets; i++) { size_t i0 = i; Eurydice_slice uu____0 = Eurydice_slice_subslice3( out, start + (size_t)8U * i0, start + (size_t)8U * i0 + (size_t)8U, uint8_t *); d2308 1 a2308 3 core_num__u64__to_le_bytes( libcrux_sha3_traits_get_ij_04(s, i0 / (size_t)5U, i0 % (size_t)5U)[0U], ret); a2311 14 size_t remaining = len % (size_t)8U; if (remaining > (size_t)0U) { Eurydice_slice uu____1 = Eurydice_slice_subslice3( out, start + len - remaining, start + len, uint8_t *); uint8_t ret[8U]; core_num__u64__to_le_bytes( libcrux_sha3_traits_get_ij_04(s, octets / (size_t)5U, octets % (size_t)5U)[0U], ret); Eurydice_slice_copy( uu____1, Eurydice_array_to_subslice3(ret, (size_t)0U, remaining, uint8_t *), uint8_t); } d2315 19 a2333 4 This function found in impl {libcrux_sha3::traits::Squeeze1 for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d2336 1 a2336 1 A monomorphic instance of libcrux_sha3.simd.portable.squeeze_13 d2340 3 a2342 4 static inline void libcrux_sha3_simd_portable_squeeze_13_f8( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice out, size_t start, size_t len) { libcrux_sha3_simd_portable_store_block_f8(self->st, out, start, len); d2346 2 a2347 1 A monomorphic instance of libcrux_sha3.generic_keccak.portable.keccak1 d2349 1 a2350 1 - DELIM= 6 d2352 6 a2357 6 static inline void libcrux_sha3_generic_keccak_portable_keccak1_96( Eurydice_slice data, Eurydice_slice out) { libcrux_sha3_generic_keccak_KeccakState_17 s = libcrux_sha3_generic_keccak_new_80_04(); size_t data_len = Eurydice_slice_len(data, uint8_t); for (size_t i = (size_t)0U; i < data_len / (size_t)72U; i++) { d2359 10 a2368 23 Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_block_80_c6(&s, buf, i0 * (size_t)72U); } size_t rem = data_len % (size_t)72U; Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_final_80_9e(&s, buf, data_len - rem, rem); size_t outlen = Eurydice_slice_len(out, uint8_t); size_t blocks = outlen / (size_t)72U; size_t last = outlen - outlen % (size_t)72U; if (blocks == (size_t)0U) { libcrux_sha3_simd_portable_squeeze_13_f8(&s, out, (size_t)0U, outlen); } else { libcrux_sha3_simd_portable_squeeze_13_f8(&s, out, (size_t)0U, (size_t)72U); for (size_t i = (size_t)1U; i < blocks; i++) { size_t i0 = i; libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_f8(&s, out, i0 * (size_t)72U, (size_t)72U); } if (last < outlen) { libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_f8(&s, out, last, outlen - last); } d2373 7 a2379 1 A portable SHA3 512 implementation. d2381 3 a2383 3 static KRML_MUSTINLINE void libcrux_sha3_portable_sha512(Eurydice_slice digest, Eurydice_slice data) { libcrux_sha3_generic_keccak_portable_keccak1_96(data, digest); d2387 2 a2388 1 A monomorphic instance of libcrux_sha3.simd.portable.load_block d2390 2 a2391 1 - RATE= 136 d2393 149 a2541 3 static KRML_MUSTINLINE void libcrux_sha3_simd_portable_load_block_5b( uint64_t *state, Eurydice_slice blocks, size_t start) { uint64_t state_flat[25U] = {0U}; a2543 1 size_t offset = start + (size_t)8U * i0; d2545 1 a2545 1 Result_15 dst; d2548 8 a2555 13 Eurydice_slice_subslice3(blocks, offset, offset + (size_t)8U, uint8_t *), Eurydice_slice, uint8_t[8U], TryFromSliceError); unwrap_26_68(dst, uu____0); state_flat[i0] = core_num__u64__from_le_bytes(uu____0); } for (size_t i = (size_t)0U; i < (size_t)136U / (size_t)8U; i++) { size_t i0 = i; libcrux_sha3_traits_set_ij_04( state, i0 / (size_t)5U, i0 % (size_t)5U, libcrux_sha3_traits_get_ij_04(state, i0 / (size_t)5U, i0 % (size_t)5U)[0U] ^ state_flat[i0]); d2560 2 a2561 4 This function found in impl {libcrux_sha3::traits::Absorb<1usize> for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d2564 1 a2564 1 A monomorphic instance of libcrux_sha3.simd.portable.load_block_a1 d2568 7 a2574 4 static inline void libcrux_sha3_simd_portable_load_block_a1_5b( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *input, size_t start) { libcrux_sha3_simd_portable_load_block_5b(self->st, input[0U], start); d2578 1 a2578 5 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_block_80 d2584 7 a2590 5 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_block_80_c60( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *blocks, size_t start) { libcrux_sha3_simd_portable_load_block_a1_5b(self, blocks, start); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); d2594 1 a2594 1 A monomorphic instance of libcrux_sha3.simd.portable.load_last a2596 1 - DELIMITER= 6 d2598 5 a2602 12 static KRML_MUSTINLINE void libcrux_sha3_simd_portable_load_last_ad( uint64_t *state, Eurydice_slice blocks, size_t start, size_t len) { uint8_t buffer[136U] = {0U}; Eurydice_slice_copy( Eurydice_array_to_subslice3(buffer, (size_t)0U, len, uint8_t *), Eurydice_slice_subslice3(blocks, start, start + len, uint8_t *), uint8_t); buffer[len] = 6U; size_t uu____0 = (size_t)136U - (size_t)1U; buffer[uu____0] = (uint32_t)buffer[uu____0] | 128U; libcrux_sha3_simd_portable_load_block_5b( state, Eurydice_array_to_slice((size_t)136U, buffer, uint8_t), (size_t)0U); d2606 2 a2607 4 This function found in impl {libcrux_sha3::traits::Absorb<1usize> for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d2610 1 a2610 1 A monomorphic instance of libcrux_sha3.simd.portable.load_last_a1 a2612 1 - DELIMITER= 6 d2614 7 a2620 4 static inline void libcrux_sha3_simd_portable_load_last_a1_ad( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *input, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_ad(self->st, input[0U], start, len); d2624 1 a2624 5 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_final_80 d2631 21 a2651 5 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_final_80_9e0( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *last, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_a1_ad(self, last, start, len); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); d2655 1 a2655 1 A monomorphic instance of libcrux_sha3.simd.portable.store_block d2659 6 a2664 8 static KRML_MUSTINLINE void libcrux_sha3_simd_portable_store_block_5b( uint64_t *s, Eurydice_slice out, size_t start, size_t len) { size_t octets = len / (size_t)8U; for (size_t i = (size_t)0U; i < octets; i++) { size_t i0 = i; Eurydice_slice uu____0 = Eurydice_slice_subslice3( out, start + (size_t)8U * i0, start + (size_t)8U * i0 + (size_t)8U, uint8_t *); d2666 1 a2666 3 core_num__u64__to_le_bytes( libcrux_sha3_traits_get_ij_04(s, i0 / (size_t)5U, i0 % (size_t)5U)[0U], ret); d2670 53 a2722 9 size_t remaining = len % (size_t)8U; if (remaining > (size_t)0U) { Eurydice_slice uu____1 = Eurydice_slice_subslice3( out, start + len - remaining, start + len, uint8_t *); uint8_t ret[8U]; core_num__u64__to_le_bytes( libcrux_sha3_traits_get_ij_04(s, octets / (size_t)5U, octets % (size_t)5U)[0U], ret); d2724 3 a2726 2 uu____1, Eurydice_array_to_subslice3(ret, (size_t)0U, remaining, uint8_t *), d2732 31 a2762 4 This function found in impl {libcrux_sha3::traits::Squeeze1 for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d2764 6 d2771 2 a2772 1 A monomorphic instance of libcrux_sha3.simd.portable.squeeze_13 d2774 1 d2777 18 a2794 4 static inline void libcrux_sha3_simd_portable_squeeze_13_5b( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice out, size_t start, size_t len) { libcrux_sha3_simd_portable_store_block_5b(self->st, out, start, len); d2798 2 a2799 1 A monomorphic instance of libcrux_sha3.generic_keccak.portable.keccak1 d2801 1 d2805 6 a2810 6 static inline void libcrux_sha3_generic_keccak_portable_keccak1_ad( Eurydice_slice data, Eurydice_slice out) { libcrux_sha3_generic_keccak_KeccakState_17 s = libcrux_sha3_generic_keccak_new_80_04(); size_t data_len = Eurydice_slice_len(data, uint8_t); for (size_t i = (size_t)0U; i < data_len / (size_t)136U; i++) { d2812 8 a2819 2 Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_block_80_c60(&s, buf, i0 * (size_t)136U); d2821 10 a2830 4 size_t rem = data_len % (size_t)136U; Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_final_80_9e0(&s, buf, data_len - rem, rem); size_t outlen = Eurydice_slice_len(out, uint8_t); d2834 1 a2834 1 libcrux_sha3_simd_portable_squeeze_13_5b(&s, out, (size_t)0U, outlen); d2836 27 a2862 6 libcrux_sha3_simd_portable_squeeze_13_5b(&s, out, (size_t)0U, (size_t)136U); for (size_t i = (size_t)1U; i < blocks; i++) { size_t i0 = i; libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_5b(&s, out, i0 * (size_t)136U, (size_t)136U); d2865 1 a2865 2 libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_5b(&s, out, last, outlen - last); d2871 1 a2871 9 A portable SHA3 256 implementation. */ static KRML_MUSTINLINE void libcrux_sha3_portable_sha256(Eurydice_slice digest, Eurydice_slice data) { libcrux_sha3_generic_keccak_portable_keccak1_ad(data, digest); } /** A monomorphic instance of libcrux_sha3.simd.portable.load_last d2874 1 a2874 1 - DELIMITER= 31 d2876 6 a2881 12 static KRML_MUSTINLINE void libcrux_sha3_simd_portable_load_last_ad0( uint64_t *state, Eurydice_slice blocks, size_t start, size_t len) { uint8_t buffer[136U] = {0U}; Eurydice_slice_copy( Eurydice_array_to_subslice3(buffer, (size_t)0U, len, uint8_t *), Eurydice_slice_subslice3(blocks, start, start + len, uint8_t *), uint8_t); buffer[len] = 31U; size_t uu____0 = (size_t)136U - (size_t)1U; buffer[uu____0] = (uint32_t)buffer[uu____0] | 128U; libcrux_sha3_simd_portable_load_block_5b( state, Eurydice_array_to_slice((size_t)136U, buffer, uint8_t), (size_t)0U); d2885 1 a2885 4 This function found in impl {libcrux_sha3::traits::Absorb<1usize> for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d2887 5 a2891 10 /** A monomorphic instance of libcrux_sha3.simd.portable.load_last_a1 with const generics - RATE= 136 - DELIMITER= 31 */ static inline void libcrux_sha3_simd_portable_load_last_a1_ad0( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *input, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_ad0(self->st, input[0U], start, len); d2895 1 a2895 5 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_final_80 d2902 21 a2922 5 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_final_80_9e1( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *last, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_a1_ad0(self, last, start, len); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); d2926 2 a2927 1 A monomorphic instance of libcrux_sha3.generic_keccak.portable.keccak1 d2929 1 d2933 6 a2938 6 static inline void libcrux_sha3_generic_keccak_portable_keccak1_ad0( Eurydice_slice data, Eurydice_slice out) { libcrux_sha3_generic_keccak_KeccakState_17 s = libcrux_sha3_generic_keccak_new_80_04(); size_t data_len = Eurydice_slice_len(data, uint8_t); for (size_t i = (size_t)0U; i < data_len / (size_t)136U; i++) { d2940 8 a2947 2 Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_block_80_c60(&s, buf, i0 * (size_t)136U); d2949 10 a2958 4 size_t rem = data_len % (size_t)136U; Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_final_80_9e1(&s, buf, data_len - rem, rem); size_t outlen = Eurydice_slice_len(out, uint8_t); d2962 1 a2962 1 libcrux_sha3_simd_portable_squeeze_13_5b(&s, out, (size_t)0U, outlen); d2964 27 a2990 6 libcrux_sha3_simd_portable_squeeze_13_5b(&s, out, (size_t)0U, (size_t)136U); for (size_t i = (size_t)1U; i < blocks; i++) { size_t i0 = i; libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_5b(&s, out, i0 * (size_t)136U, (size_t)136U); d2993 1 a2993 2 libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_5b(&s, out, last, outlen - last); d2999 14 d3017 3 a3019 1 libcrux_sha3_generic_keccak_portable_keccak1_ad0(data, digest); d3022 1 a3022 1 typedef libcrux_sha3_generic_keccak_KeccakState_17 d3028 1 a3028 1 static KRML_MUSTINLINE libcrux_sha3_generic_keccak_KeccakState_17 d3030 1 a3030 1 return libcrux_sha3_generic_keccak_new_80_04(); d3034 1 a3034 1 A monomorphic instance of libcrux_sha3.simd.portable.load_block d3038 2 a3039 3 static KRML_MUSTINLINE void libcrux_sha3_simd_portable_load_block_3a( uint64_t *state, Eurydice_slice blocks, size_t start) { uint64_t state_flat[25U] = {0U}; a3041 1 size_t offset = start + (size_t)8U * i0; d3043 1 a3043 1 Result_15 dst; d3046 8 a3053 13 Eurydice_slice_subslice3(blocks, offset, offset + (size_t)8U, uint8_t *), Eurydice_slice, uint8_t[8U], TryFromSliceError); unwrap_26_68(dst, uu____0); state_flat[i0] = core_num__u64__from_le_bytes(uu____0); } for (size_t i = (size_t)0U; i < (size_t)168U / (size_t)8U; i++) { size_t i0 = i; libcrux_sha3_traits_set_ij_04( state, i0 / (size_t)5U, i0 % (size_t)5U, libcrux_sha3_traits_get_ij_04(state, i0 / (size_t)5U, i0 % (size_t)5U)[0U] ^ state_flat[i0]); d3058 1 a3058 1 A monomorphic instance of libcrux_sha3.simd.portable.load_last a3060 1 - DELIMITER= 31 d3062 5 a3066 12 static KRML_MUSTINLINE void libcrux_sha3_simd_portable_load_last_c6( uint64_t *state, Eurydice_slice blocks, size_t start, size_t len) { uint8_t buffer[168U] = {0U}; Eurydice_slice_copy( Eurydice_array_to_subslice3(buffer, (size_t)0U, len, uint8_t *), Eurydice_slice_subslice3(blocks, start, start + len, uint8_t *), uint8_t); buffer[len] = 31U; size_t uu____0 = (size_t)168U - (size_t)1U; buffer[uu____0] = (uint32_t)buffer[uu____0] | 128U; libcrux_sha3_simd_portable_load_block_3a( state, Eurydice_array_to_slice((size_t)168U, buffer, uint8_t), (size_t)0U); d3070 2 a3071 4 This function found in impl {libcrux_sha3::traits::Absorb<1usize> for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d3074 1 a3074 1 A monomorphic instance of libcrux_sha3.simd.portable.load_last_a1 a3076 1 - DELIMITER= 31 d3078 7 a3084 4 static inline void libcrux_sha3_simd_portable_load_last_a1_c6( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *input, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_c6(self->st, input[0U], start, len); d3088 1 a3088 5 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_final_80 d3095 21 a3115 5 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_final_80_9e2( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *last, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_a1_c6(self, last, start, len); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); d3123 3 a3125 5 libcrux_sha3_generic_keccak_KeccakState_17 *s, Eurydice_slice data0) { libcrux_sha3_generic_keccak_KeccakState_17 *uu____0 = s; Eurydice_slice uu____1[1U] = {data0}; libcrux_sha3_generic_keccak_absorb_final_80_9e2( uu____0, uu____1, (size_t)0U, Eurydice_slice_len(data0, uint8_t)); d3129 1 a3129 1 A monomorphic instance of libcrux_sha3.simd.portable.store_block d3133 6 a3138 8 static KRML_MUSTINLINE void libcrux_sha3_simd_portable_store_block_3a( uint64_t *s, Eurydice_slice out, size_t start, size_t len) { size_t octets = len / (size_t)8U; for (size_t i = (size_t)0U; i < octets; i++) { size_t i0 = i; Eurydice_slice uu____0 = Eurydice_slice_subslice3( out, start + (size_t)8U * i0, start + (size_t)8U * i0 + (size_t)8U, uint8_t *); d3140 1 a3140 3 core_num__u64__to_le_bytes( libcrux_sha3_traits_get_ij_04(s, i0 / (size_t)5U, i0 % (size_t)5U)[0U], ret); a3143 14 size_t remaining = len % (size_t)8U; if (remaining > (size_t)0U) { Eurydice_slice uu____1 = Eurydice_slice_subslice3( out, start + len - remaining, start + len, uint8_t *); uint8_t ret[8U]; core_num__u64__to_le_bytes( libcrux_sha3_traits_get_ij_04(s, octets / (size_t)5U, octets % (size_t)5U)[0U], ret); Eurydice_slice_copy( uu____1, Eurydice_array_to_subslice3(ret, (size_t)0U, remaining, uint8_t *), uint8_t); } d3147 2 a3148 4 This function found in impl {libcrux_sha3::traits::Squeeze1 for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d3151 1 a3151 1 A monomorphic instance of libcrux_sha3.simd.portable.squeeze_13 d3155 3 a3157 4 static inline void libcrux_sha3_simd_portable_squeeze_13_3a( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice out, size_t start, size_t len) { libcrux_sha3_simd_portable_store_block_3a(self->st, out, start, len); d3161 4 a3164 9 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.portable.squeeze_first_three_blocks_b4 with const generics d3167 4 a3170 10 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_portable_squeeze_first_three_blocks_b4_3a( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice out) { libcrux_sha3_simd_portable_squeeze_13_3a(self, out, (size_t)0U, (size_t)168U); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); libcrux_sha3_simd_portable_squeeze_13_3a(self, out, (size_t)168U, (size_t)168U); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); libcrux_sha3_simd_portable_squeeze_13_3a(self, out, (size_t)2U * (size_t)168U, (size_t)168U); d3174 1 a3174 1 Squeeze three blocks d3177 4 a3180 4 libcrux_sha3_portable_incremental_shake128_squeeze_first_three_blocks( libcrux_sha3_generic_keccak_KeccakState_17 *s, Eurydice_slice out0) { libcrux_sha3_generic_keccak_portable_squeeze_first_three_blocks_b4_3a(s, out0); d3184 5 a3188 4 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d3190 5 d3196 4 a3199 2 A monomorphic instance of libcrux_sha3.generic_keccak.portable.squeeze_next_block_b4 with const generics d3203 17 a3219 5 libcrux_sha3_generic_keccak_portable_squeeze_next_block_b4_3a( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice out, size_t start) { libcrux_sha3_generic_keccak_keccakf1600_80_04(self); libcrux_sha3_simd_portable_squeeze_13_3a(self, out, start, (size_t)168U); d3223 1 a3223 1 Squeeze another block d3226 4 a3229 4 libcrux_sha3_portable_incremental_shake128_squeeze_next_block( libcrux_sha3_generic_keccak_KeccakState_17 *s, Eurydice_slice out0) { libcrux_sha3_generic_keccak_portable_squeeze_next_block_b4_3a(s, out0, (size_t)0U); d3232 4 a3235 4 #define libcrux_sha3_Algorithm_Sha224 1 #define libcrux_sha3_Algorithm_Sha256 2 #define libcrux_sha3_Algorithm_Sha384 3 #define libcrux_sha3_Algorithm_Sha512 4 a3238 8 typedef uint8_t libcrux_sha3_Sha3_224Digest[28U]; typedef uint8_t libcrux_sha3_Sha3_256Digest[32U]; typedef uint8_t libcrux_sha3_Sha3_384Digest[48U]; typedef uint8_t libcrux_sha3_Sha3_512Digest[64U]; d3243 1 d3245 2 a3246 1 case libcrux_sha3_Algorithm_Sha224: { d3249 3 a3251 2 case libcrux_sha3_Algorithm_Sha256: { return (size_t)32U; d3253 3 a3255 2 case libcrux_sha3_Algorithm_Sha384: { return (size_t)48U; d3257 3 a3259 2 case libcrux_sha3_Algorithm_Sha512: { return (size_t)64U; d3267 1 a3267 1 return (size_t)28U; d3271 1 a3271 1 A monomorphic instance of libcrux_sha3.simd.portable.load_block d3275 2 a3276 3 static KRML_MUSTINLINE void libcrux_sha3_simd_portable_load_block_2c( uint64_t *state, Eurydice_slice blocks, size_t start) { uint64_t state_flat[25U] = {0U}; a3278 1 size_t offset = start + (size_t)8U * i0; d3280 1 a3280 1 Result_15 dst; d3283 8 a3290 13 Eurydice_slice_subslice3(blocks, offset, offset + (size_t)8U, uint8_t *), Eurydice_slice, uint8_t[8U], TryFromSliceError); unwrap_26_68(dst, uu____0); state_flat[i0] = core_num__u64__from_le_bytes(uu____0); } for (size_t i = (size_t)0U; i < (size_t)144U / (size_t)8U; i++) { size_t i0 = i; libcrux_sha3_traits_set_ij_04( state, i0 / (size_t)5U, i0 % (size_t)5U, libcrux_sha3_traits_get_ij_04(state, i0 / (size_t)5U, i0 % (size_t)5U)[0U] ^ state_flat[i0]); d3295 2 a3296 4 This function found in impl {libcrux_sha3::traits::Absorb<1usize> for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d3299 1 a3299 1 A monomorphic instance of libcrux_sha3.simd.portable.load_block_a1 d3303 7 a3309 4 static inline void libcrux_sha3_simd_portable_load_block_a1_2c( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *input, size_t start) { libcrux_sha3_simd_portable_load_block_2c(self->st, input[0U], start); d3313 1 a3313 5 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_block_80 d3319 7 a3325 5 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_block_80_c61( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *blocks, size_t start) { libcrux_sha3_simd_portable_load_block_a1_2c(self, blocks, start); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); d3329 1 a3329 1 A monomorphic instance of libcrux_sha3.simd.portable.load_last a3331 1 - DELIMITER= 6 d3333 5 a3337 12 static KRML_MUSTINLINE void libcrux_sha3_simd_portable_load_last_1e( uint64_t *state, Eurydice_slice blocks, size_t start, size_t len) { uint8_t buffer[144U] = {0U}; Eurydice_slice_copy( Eurydice_array_to_subslice3(buffer, (size_t)0U, len, uint8_t *), Eurydice_slice_subslice3(blocks, start, start + len, uint8_t *), uint8_t); buffer[len] = 6U; size_t uu____0 = (size_t)144U - (size_t)1U; buffer[uu____0] = (uint32_t)buffer[uu____0] | 128U; libcrux_sha3_simd_portable_load_block_2c( state, Eurydice_array_to_slice((size_t)144U, buffer, uint8_t), (size_t)0U); d3341 2 a3342 4 This function found in impl {libcrux_sha3::traits::Absorb<1usize> for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d3345 1 a3345 1 A monomorphic instance of libcrux_sha3.simd.portable.load_last_a1 a3347 1 - DELIMITER= 6 d3349 7 a3355 4 static inline void libcrux_sha3_simd_portable_load_last_a1_1e( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *input, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_1e(self->st, input[0U], start, len); d3359 1 a3359 5 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_final_80 d3366 21 a3386 5 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_final_80_9e3( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *last, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_a1_1e(self, last, start, len); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); d3390 1 a3390 1 A monomorphic instance of libcrux_sha3.simd.portable.store_block d3394 6 a3399 8 static KRML_MUSTINLINE void libcrux_sha3_simd_portable_store_block_2c( uint64_t *s, Eurydice_slice out, size_t start, size_t len) { size_t octets = len / (size_t)8U; for (size_t i = (size_t)0U; i < octets; i++) { size_t i0 = i; Eurydice_slice uu____0 = Eurydice_slice_subslice3( out, start + (size_t)8U * i0, start + (size_t)8U * i0 + (size_t)8U, uint8_t *); d3401 1 a3401 3 core_num__u64__to_le_bytes( libcrux_sha3_traits_get_ij_04(s, i0 / (size_t)5U, i0 % (size_t)5U)[0U], ret); d3405 53 a3457 9 size_t remaining = len % (size_t)8U; if (remaining > (size_t)0U) { Eurydice_slice uu____1 = Eurydice_slice_subslice3( out, start + len - remaining, start + len, uint8_t *); uint8_t ret[8U]; core_num__u64__to_le_bytes( libcrux_sha3_traits_get_ij_04(s, octets / (size_t)5U, octets % (size_t)5U)[0U], ret); d3459 3 a3461 2 uu____1, Eurydice_array_to_subslice3(ret, (size_t)0U, remaining, uint8_t *), d3467 31 a3497 4 This function found in impl {libcrux_sha3::traits::Squeeze1 for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d3499 6 d3506 2 a3507 1 A monomorphic instance of libcrux_sha3.simd.portable.squeeze_13 d3509 1 d3512 18 a3529 4 static inline void libcrux_sha3_simd_portable_squeeze_13_2c( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice out, size_t start, size_t len) { libcrux_sha3_simd_portable_store_block_2c(self->st, out, start, len); d3533 2 a3534 1 A monomorphic instance of libcrux_sha3.generic_keccak.portable.keccak1 d3536 1 d3540 6 a3545 6 static inline void libcrux_sha3_generic_keccak_portable_keccak1_1e( Eurydice_slice data, Eurydice_slice out) { libcrux_sha3_generic_keccak_KeccakState_17 s = libcrux_sha3_generic_keccak_new_80_04(); size_t data_len = Eurydice_slice_len(data, uint8_t); for (size_t i = (size_t)0U; i < data_len / (size_t)144U; i++) { d3547 8 a3554 2 Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_block_80_c61(&s, buf, i0 * (size_t)144U); d3556 10 a3565 4 size_t rem = data_len % (size_t)144U; Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_final_80_9e3(&s, buf, data_len - rem, rem); size_t outlen = Eurydice_slice_len(out, uint8_t); d3569 1 a3569 1 libcrux_sha3_simd_portable_squeeze_13_2c(&s, out, (size_t)0U, outlen); d3571 27 a3597 6 libcrux_sha3_simd_portable_squeeze_13_2c(&s, out, (size_t)0U, (size_t)144U); for (size_t i = (size_t)1U; i < blocks; i++) { size_t i0 = i; libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_2c(&s, out, i0 * (size_t)144U, (size_t)144U); d3600 1 a3600 2 libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_2c(&s, out, last, outlen - last); d3606 14 d3624 3 a3626 1 libcrux_sha3_generic_keccak_portable_keccak1_1e(data, digest); d3630 1 a3630 1 A monomorphic instance of libcrux_sha3.simd.portable.load_block d3634 2 a3635 3 static KRML_MUSTINLINE void libcrux_sha3_simd_portable_load_block_7a( uint64_t *state, Eurydice_slice blocks, size_t start) { uint64_t state_flat[25U] = {0U}; a3637 1 size_t offset = start + (size_t)8U * i0; d3639 1 a3639 1 Result_15 dst; d3642 8 a3649 13 Eurydice_slice_subslice3(blocks, offset, offset + (size_t)8U, uint8_t *), Eurydice_slice, uint8_t[8U], TryFromSliceError); unwrap_26_68(dst, uu____0); state_flat[i0] = core_num__u64__from_le_bytes(uu____0); } for (size_t i = (size_t)0U; i < (size_t)104U / (size_t)8U; i++) { size_t i0 = i; libcrux_sha3_traits_set_ij_04( state, i0 / (size_t)5U, i0 % (size_t)5U, libcrux_sha3_traits_get_ij_04(state, i0 / (size_t)5U, i0 % (size_t)5U)[0U] ^ state_flat[i0]); d3654 2 a3655 4 This function found in impl {libcrux_sha3::traits::Absorb<1usize> for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d3658 1 a3658 1 A monomorphic instance of libcrux_sha3.simd.portable.load_block_a1 d3662 7 a3668 4 static inline void libcrux_sha3_simd_portable_load_block_a1_7a( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *input, size_t start) { libcrux_sha3_simd_portable_load_block_7a(self->st, input[0U], start); d3672 1 a3672 5 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_block_80 d3678 7 a3684 5 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_block_80_c62( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *blocks, size_t start) { libcrux_sha3_simd_portable_load_block_a1_7a(self, blocks, start); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); d3688 1 a3688 1 A monomorphic instance of libcrux_sha3.simd.portable.load_last a3690 1 - DELIMITER= 6 d3692 5 a3696 12 static KRML_MUSTINLINE void libcrux_sha3_simd_portable_load_last_7c( uint64_t *state, Eurydice_slice blocks, size_t start, size_t len) { uint8_t buffer[104U] = {0U}; Eurydice_slice_copy( Eurydice_array_to_subslice3(buffer, (size_t)0U, len, uint8_t *), Eurydice_slice_subslice3(blocks, start, start + len, uint8_t *), uint8_t); buffer[len] = 6U; size_t uu____0 = (size_t)104U - (size_t)1U; buffer[uu____0] = (uint32_t)buffer[uu____0] | 128U; libcrux_sha3_simd_portable_load_block_7a( state, Eurydice_array_to_slice((size_t)104U, buffer, uint8_t), (size_t)0U); d3700 2 a3701 4 This function found in impl {libcrux_sha3::traits::Absorb<1usize> for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d3704 1 a3704 1 A monomorphic instance of libcrux_sha3.simd.portable.load_last_a1 a3706 1 - DELIMITER= 6 d3708 7 a3714 4 static inline void libcrux_sha3_simd_portable_load_last_a1_7c( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *input, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_7c(self->st, input[0U], start, len); d3718 1 a3718 5 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_final_80 d3725 21 a3745 5 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_final_80_9e4( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *last, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_a1_7c(self, last, start, len); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); d3749 1 a3749 1 A monomorphic instance of libcrux_sha3.simd.portable.store_block d3753 6 a3758 8 static KRML_MUSTINLINE void libcrux_sha3_simd_portable_store_block_7a( uint64_t *s, Eurydice_slice out, size_t start, size_t len) { size_t octets = len / (size_t)8U; for (size_t i = (size_t)0U; i < octets; i++) { size_t i0 = i; Eurydice_slice uu____0 = Eurydice_slice_subslice3( out, start + (size_t)8U * i0, start + (size_t)8U * i0 + (size_t)8U, uint8_t *); d3760 1 a3760 3 core_num__u64__to_le_bytes( libcrux_sha3_traits_get_ij_04(s, i0 / (size_t)5U, i0 % (size_t)5U)[0U], ret); d3764 53 a3816 9 size_t remaining = len % (size_t)8U; if (remaining > (size_t)0U) { Eurydice_slice uu____1 = Eurydice_slice_subslice3( out, start + len - remaining, start + len, uint8_t *); uint8_t ret[8U]; core_num__u64__to_le_bytes( libcrux_sha3_traits_get_ij_04(s, octets / (size_t)5U, octets % (size_t)5U)[0U], ret); d3818 3 a3820 2 uu____1, Eurydice_array_to_subslice3(ret, (size_t)0U, remaining, uint8_t *), d3826 31 a3856 4 This function found in impl {libcrux_sha3::traits::Squeeze1 for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d3858 6 d3865 2 a3866 1 A monomorphic instance of libcrux_sha3.simd.portable.squeeze_13 d3868 1 d3871 18 a3888 4 static inline void libcrux_sha3_simd_portable_squeeze_13_7a( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice out, size_t start, size_t len) { libcrux_sha3_simd_portable_store_block_7a(self->st, out, start, len); d3892 2 a3893 1 A monomorphic instance of libcrux_sha3.generic_keccak.portable.keccak1 d3895 1 d3899 6 a3904 6 static inline void libcrux_sha3_generic_keccak_portable_keccak1_7c( Eurydice_slice data, Eurydice_slice out) { libcrux_sha3_generic_keccak_KeccakState_17 s = libcrux_sha3_generic_keccak_new_80_04(); size_t data_len = Eurydice_slice_len(data, uint8_t); for (size_t i = (size_t)0U; i < data_len / (size_t)104U; i++) { d3906 8 a3913 2 Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_block_80_c62(&s, buf, i0 * (size_t)104U); d3915 10 a3924 4 size_t rem = data_len % (size_t)104U; Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_final_80_9e4(&s, buf, data_len - rem, rem); size_t outlen = Eurydice_slice_len(out, uint8_t); d3928 1 a3928 1 libcrux_sha3_simd_portable_squeeze_13_7a(&s, out, (size_t)0U, outlen); d3930 27 a3956 6 libcrux_sha3_simd_portable_squeeze_13_7a(&s, out, (size_t)0U, (size_t)104U); for (size_t i = (size_t)1U; i < blocks; i++) { size_t i0 = i; libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_7a(&s, out, i0 * (size_t)104U, (size_t)104U); d3959 1 a3959 2 libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_7a(&s, out, last, outlen - last); d3965 14 d3983 3 a3985 1 libcrux_sha3_generic_keccak_portable_keccak1_7c(data, digest); d3994 2 a3995 2 static inline void libcrux_sha3_sha224_ema(Eurydice_slice digest, Eurydice_slice payload) { d4002 2 a4003 1 static inline void libcrux_sha3_sha224(Eurydice_slice data, uint8_t ret[28U]) { d4013 2 a4014 2 static inline void libcrux_sha3_sha256_ema(Eurydice_slice digest, Eurydice_slice payload) { d4021 2 a4022 1 static inline void libcrux_sha3_sha256(Eurydice_slice data, uint8_t ret[32U]) { d4032 2 a4033 2 static inline void libcrux_sha3_sha384_ema(Eurydice_slice digest, Eurydice_slice payload) { d4040 2 a4041 1 static inline void libcrux_sha3_sha384(Eurydice_slice data, uint8_t ret[48U]) { d4051 2 a4052 2 static inline void libcrux_sha3_sha512_ema(Eurydice_slice digest, Eurydice_slice payload) { d4059 2 a4060 1 static inline void libcrux_sha3_sha512(Eurydice_slice data, uint8_t ret[64U]) { d4068 53 a4120 4 This function found in impl {libcrux_sha3::traits::Absorb<1usize> for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d4123 1 a4123 1 A monomorphic instance of libcrux_sha3.simd.portable.load_block_a1 d4127 4 a4130 4 static inline void libcrux_sha3_simd_portable_load_block_a1_3a( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *input, size_t start) { libcrux_sha3_simd_portable_load_block_3a(self->st, input[0U], start); d4134 5 a4138 2 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} d4140 20 d4161 1 a4161 1 A monomorphic instance of libcrux_sha3.generic_keccak.absorb_block_80 d4167 18 a4184 5 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_block_80_c63( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *blocks, size_t start) { libcrux_sha3_simd_portable_load_block_a1_3a(self, blocks, start); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); d4188 2 a4189 1 A monomorphic instance of libcrux_sha3.generic_keccak.portable.keccak1 d4191 1 d4195 6 a4200 6 static inline void libcrux_sha3_generic_keccak_portable_keccak1_c6( Eurydice_slice data, Eurydice_slice out) { libcrux_sha3_generic_keccak_KeccakState_17 s = libcrux_sha3_generic_keccak_new_80_04(); size_t data_len = Eurydice_slice_len(data, uint8_t); for (size_t i = (size_t)0U; i < data_len / (size_t)168U; i++) { d4202 8 a4209 2 Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_block_80_c63(&s, buf, i0 * (size_t)168U); d4211 10 a4220 4 size_t rem = data_len % (size_t)168U; Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_final_80_9e2(&s, buf, data_len - rem, rem); size_t outlen = Eurydice_slice_len(out, uint8_t); d4224 1 a4224 1 libcrux_sha3_simd_portable_squeeze_13_3a(&s, out, (size_t)0U, outlen); d4226 27 a4252 6 libcrux_sha3_simd_portable_squeeze_13_3a(&s, out, (size_t)0U, (size_t)168U); for (size_t i = (size_t)1U; i < blocks; i++) { size_t i0 = i; libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_3a(&s, out, i0 * (size_t)168U, (size_t)168U); d4255 1 a4255 2 libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_3a(&s, out, last, outlen - last); d4261 14 d4279 3 a4281 1 libcrux_sha3_generic_keccak_portable_keccak1_c6(data, digest); d4289 2 a4290 2 static inline void libcrux_sha3_shake128_ema(Eurydice_slice out, Eurydice_slice data) { d4299 2 a4300 2 static inline void libcrux_sha3_shake256_ema(Eurydice_slice out, Eurydice_slice data) { d4304 14 d4319 1 a4319 4 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d4321 7 d4329 1 a4329 4 A monomorphic instance of libcrux_sha3.generic_keccak.portable.squeeze_first_five_blocks_b4 with const generics - RATE= 168 d4331 5 a4335 16 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_portable_squeeze_first_five_blocks_b4_3a( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice out) { libcrux_sha3_simd_portable_squeeze_13_3a(self, out, (size_t)0U, (size_t)168U); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); libcrux_sha3_simd_portable_squeeze_13_3a(self, out, (size_t)168U, (size_t)168U); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); libcrux_sha3_simd_portable_squeeze_13_3a(self, out, (size_t)2U * (size_t)168U, (size_t)168U); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); libcrux_sha3_simd_portable_squeeze_13_3a(self, out, (size_t)3U * (size_t)168U, (size_t)168U); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); libcrux_sha3_simd_portable_squeeze_13_3a(self, out, (size_t)4U * (size_t)168U, (size_t)168U); d4339 1 a4339 1 Squeeze five blocks d4341 5 a4345 4 static KRML_MUSTINLINE void libcrux_sha3_portable_incremental_shake128_squeeze_first_five_blocks( libcrux_sha3_generic_keccak_KeccakState_17 *s, Eurydice_slice out0) { libcrux_sha3_generic_keccak_portable_squeeze_first_five_blocks_b4_3a(s, out0); d4349 1 a4349 1 Absorb some data for SHAKE-256 for the last time d4351 5 a4355 7 static KRML_MUSTINLINE void libcrux_sha3_portable_incremental_shake256_absorb_final( libcrux_sha3_generic_keccak_KeccakState_17 *s, Eurydice_slice data) { libcrux_sha3_generic_keccak_KeccakState_17 *uu____0 = s; Eurydice_slice uu____1[1U] = {data}; libcrux_sha3_generic_keccak_absorb_final_80_9e1( uu____0, uu____1, (size_t)0U, Eurydice_slice_len(data, uint8_t)); d4359 3 a4361 1 Create a new SHAKE-256 state object. d4363 7 a4369 3 static KRML_MUSTINLINE libcrux_sha3_generic_keccak_KeccakState_17 libcrux_sha3_portable_incremental_shake256_init(void) { return libcrux_sha3_generic_keccak_new_80_04(); d4372 4 d4377 1 a4377 4 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d4379 7 d4387 1 a4387 3 A monomorphic instance of libcrux_sha3.generic_keccak.portable.squeeze_first_block_b4 with const generics - RATE= 136 d4390 6 a4395 3 libcrux_sha3_generic_keccak_portable_squeeze_first_block_b4_5b( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice out) { libcrux_sha3_simd_portable_squeeze_13_5b(self, out, (size_t)0U, (size_t)136U); d4399 2 a4400 1 Squeeze the first SHAKE-256 block d4403 80 a4482 3 libcrux_sha3_portable_incremental_shake256_squeeze_first_block( libcrux_sha3_generic_keccak_KeccakState_17 *s, Eurydice_slice out) { libcrux_sha3_generic_keccak_portable_squeeze_first_block_b4_5b(s, out); d4486 1 a4486 4 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d4488 5 d4494 1 a4494 3 A monomorphic instance of libcrux_sha3.generic_keccak.portable.squeeze_next_block_b4 with const generics - RATE= 136 d4497 4 a4500 5 libcrux_sha3_generic_keccak_portable_squeeze_next_block_b4_5b( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice out, size_t start) { libcrux_sha3_generic_keccak_keccakf1600_80_04(self); libcrux_sha3_simd_portable_squeeze_13_5b(self, out, start, (size_t)136U); d4508 3 a4510 3 libcrux_sha3_generic_keccak_KeccakState_17 *s, Eurydice_slice out) { libcrux_sha3_generic_keccak_portable_squeeze_next_block_b4_5b(s, out, (size_t)0U); d4514 1 a4514 1 A monomorphic instance of libcrux_sha3.generic_keccak.xof.KeccakXofState d4520 2 a4521 2 typedef struct libcrux_sha3_generic_keccak_xof_KeccakXofState_e2_s { libcrux_sha3_generic_keccak_KeccakState_17 inner; d4525 1 a4525 1 } libcrux_sha3_generic_keccak_xof_KeccakXofState_e2; d4527 6 a4532 2 typedef libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 libcrux_sha3_portable_incremental_Shake256Xof; d4534 5 d4540 2 a4541 3 This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} d4544 1 a4544 1 A monomorphic instance of libcrux_sha3.generic_keccak.xof.fill_buffer_35 d4550 3 a4552 3 static inline size_t libcrux_sha3_generic_keccak_xof_fill_buffer_35_c6( libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 *self, Eurydice_slice *inputs) { d4561 1 a4561 2 (size_t)136U, self->buf[i0], self->buf_len, uint8_t, size_t, uint8_t[]); d4564 1 a4564 2 Eurydice_slice_subslice_to(inputs[i0], consumed, uint8_t, size_t, uint8_t[]), d4574 2 a4575 3 This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} d4578 1 a4578 1 A monomorphic instance of libcrux_sha3.generic_keccak.xof.absorb_full_35 d4584 7 a4590 3 static inline size_t libcrux_sha3_generic_keccak_xof_absorb_full_35_c6( libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 *self, Eurydice_slice *inputs) { d4592 1 a4592 1 libcrux_sha3_generic_keccak_xof_fill_buffer_35_c6(self, inputs); d4597 2 a4598 2 borrowed[i] = core_array___Array_T__N___as_slice((size_t)136U, buf, uint8_t, Eurydice_slice); d4605 5 a4609 3 libcrux_sha3_simd_portable_load_block_a1_5b(&self->inner, borrowed, (size_t)0U); libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); d4618 9 a4626 3 libcrux_sha3_simd_portable_load_block_a1_5b( &self->inner, inputs, input_consumed + i0 * (size_t)136U); libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); d4632 14 a4645 3 This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} d4648 1 a4648 1 A monomorphic instance of libcrux_sha3.generic_keccak.xof.absorb_35 d4654 7 a4660 3 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_xof_absorb_35_c6( libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 *self, Eurydice_slice *inputs) { d4662 1 a4662 1 libcrux_sha3_generic_keccak_xof_absorb_full_35_c6(self, inputs); d4667 8 a4674 7 Eurydice_slice_copy(Eurydice_array_to_subslice3( self->buf[i0], self->buf_len, self->buf_len + input_remainder_len, uint8_t *), Eurydice_slice_subslice_from( inputs[i0], input_len - input_remainder_len, uint8_t, size_t, uint8_t[]), uint8_t); d4684 3 a4686 2 This function found in impl {libcrux_sha3::portable::incremental::Xof<136usize> for libcrux_sha3::portable::incremental::Shake256Xof} d4688 2 a4689 3 static inline void libcrux_sha3_portable_incremental_absorb_42( libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 *self, Eurydice_slice input) { d4691 1 a4691 1 libcrux_sha3_generic_keccak_xof_absorb_35_c6(self, buf); d4694 9 d4704 2 a4705 3 This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} d4708 1 a4708 1 A monomorphic instance of libcrux_sha3.generic_keccak.xof.absorb_final_35 d4715 11 a4725 10 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_xof_absorb_final_35_9e( libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 *self, Eurydice_slice *inputs) { libcrux_sha3_generic_keccak_xof_absorb_35_c6(self, inputs); Eurydice_slice borrowed[1U]; for (size_t i = (size_t)0U; i < (size_t)1U; i++) { uint8_t buf[136U] = {0U}; borrowed[i] = core_array___Array_T__N___as_slice((size_t)136U, buf, uint8_t, Eurydice_slice); } d4728 28 a4755 6 borrowed[i0] = Eurydice_array_to_slice((size_t)136U, self->buf[i0], uint8_t); } libcrux_sha3_simd_portable_load_last_a1_ad0(&self->inner, borrowed, (size_t)0U, self->buf_len); libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); d4762 3 a4764 2 This function found in impl {libcrux_sha3::portable::incremental::Xof<136usize> for libcrux_sha3::portable::incremental::Shake256Xof} d4766 3 a4768 3 static inline void libcrux_sha3_portable_incremental_absorb_final_42( libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 *self, Eurydice_slice input) { d4770 2 a4771 1 libcrux_sha3_generic_keccak_xof_absorb_final_35_9e(self, buf); d4775 5 a4779 3 This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} d4782 1 a4782 1 A monomorphic instance of libcrux_sha3.generic_keccak.xof.zero_block_35 d4788 1 a4788 1 static inline void libcrux_sha3_generic_keccak_xof_zero_block_35_c6( d4790 136 a4925 1 memset(ret, 0U, 136U * sizeof(uint8_t)); d4929 5 a4933 3 This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} d4936 1 a4936 1 A monomorphic instance of libcrux_sha3.generic_keccak.xof.new_35 d4942 7 a4948 9 static inline libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 libcrux_sha3_generic_keccak_xof_new_35_c6(void) { libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 lit; lit.inner = libcrux_sha3_generic_keccak_new_80_04(); uint8_t repeat_expression[1U][136U]; for (size_t i = (size_t)0U; i < (size_t)1U; i++) { libcrux_sha3_generic_keccak_xof_zero_block_35_c6(repeat_expression[i]); } memcpy(lit.buf, repeat_expression, (size_t)1U * sizeof(uint8_t[136U])); a4957 12 This function found in impl {libcrux_sha3::portable::incremental::Xof<136usize> for libcrux_sha3::portable::incremental::Shake256Xof} */ static inline libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 libcrux_sha3_portable_incremental_new_42(void) { return libcrux_sha3_generic_keccak_xof_new_35_c6(); } /** Squeeze `N` x `LEN` bytes. Only `N = 1` for now. */ /** d4959 2 a4960 45 {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.xof.squeeze_85 with types uint64_t with const generics - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_xof_squeeze_85_c7( libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 *self, Eurydice_slice out) { if (self->sponge) { libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); } size_t out_len = Eurydice_slice_len(out, uint8_t); if (out_len > (size_t)0U) { if (out_len <= (size_t)136U) { libcrux_sha3_simd_portable_squeeze_13_5b(&self->inner, out, (size_t)0U, out_len); } else { size_t blocks = out_len / (size_t)136U; for (size_t i = (size_t)0U; i < blocks; i++) { size_t i0 = i; libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); libcrux_sha3_simd_portable_squeeze_13_5b( &self->inner, out, i0 * (size_t)136U, (size_t)136U); } size_t remaining = out_len % (size_t)136U; if (remaining > (size_t)0U) { libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); libcrux_sha3_simd_portable_squeeze_13_5b( &self->inner, out, blocks * (size_t)136U, remaining); } } self->sponge = true; } } /** Shake256 squeeze */ /** This function found in impl {libcrux_sha3::portable::incremental::Xof<136usize> for libcrux_sha3::portable::incremental::Shake256Xof} d4962 3 a4964 4 static inline void libcrux_sha3_portable_incremental_squeeze_42( libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 *self, Eurydice_slice out) { libcrux_sha3_generic_keccak_xof_squeeze_85_c7(self, out); d4968 1 a4968 1 A monomorphic instance of libcrux_sha3.generic_keccak.xof.KeccakXofState d4974 2 a4975 2 typedef struct libcrux_sha3_generic_keccak_xof_KeccakXofState_97_s { libcrux_sha3_generic_keccak_KeccakState_17 inner; d4979 4 a4982 1 } libcrux_sha3_generic_keccak_xof_KeccakXofState_97; d4984 3 a4986 2 typedef libcrux_sha3_generic_keccak_xof_KeccakXofState_97 libcrux_sha3_portable_incremental_Shake128Xof; d4988 5 d4994 2 a4995 3 This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} d4998 1 a4998 1 A monomorphic instance of libcrux_sha3.generic_keccak.xof.fill_buffer_35 d5004 3 a5006 3 static inline size_t libcrux_sha3_generic_keccak_xof_fill_buffer_35_c60( libcrux_sha3_generic_keccak_xof_KeccakXofState_97 *self, Eurydice_slice *inputs) { d5015 1 a5015 2 (size_t)168U, self->buf[i0], self->buf_len, uint8_t, size_t, uint8_t[]); d5018 1 a5018 2 Eurydice_slice_subslice_to(inputs[i0], consumed, uint8_t, size_t, uint8_t[]), d5028 2 a5029 3 This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} d5032 1 a5032 1 A monomorphic instance of libcrux_sha3.generic_keccak.xof.absorb_full_35 d5038 7 a5044 3 static inline size_t libcrux_sha3_generic_keccak_xof_absorb_full_35_c60( libcrux_sha3_generic_keccak_xof_KeccakXofState_97 *self, Eurydice_slice *inputs) { d5046 1 a5046 1 libcrux_sha3_generic_keccak_xof_fill_buffer_35_c60(self, inputs); d5051 2 a5052 2 borrowed[i] = core_array___Array_T__N___as_slice((size_t)168U, buf, uint8_t, Eurydice_slice); d5059 5 a5063 3 libcrux_sha3_simd_portable_load_block_a1_3a(&self->inner, borrowed, (size_t)0U); libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); d5072 9 a5080 3 libcrux_sha3_simd_portable_load_block_a1_3a( &self->inner, inputs, input_consumed + i0 * (size_t)168U); libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); d5086 14 a5099 3 This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} d5102 1 a5102 1 A monomorphic instance of libcrux_sha3.generic_keccak.xof.absorb_35 d5108 7 a5114 3 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_xof_absorb_35_c60( libcrux_sha3_generic_keccak_xof_KeccakXofState_97 *self, Eurydice_slice *inputs) { d5116 1 a5116 1 libcrux_sha3_generic_keccak_xof_absorb_full_35_c60(self, inputs); d5121 8 a5128 7 Eurydice_slice_copy(Eurydice_array_to_subslice3( self->buf[i0], self->buf_len, self->buf_len + input_remainder_len, uint8_t *), Eurydice_slice_subslice_from( inputs[i0], input_len - input_remainder_len, uint8_t, size_t, uint8_t[]), uint8_t); d5135 3 a5137 2 This function found in impl {libcrux_sha3::portable::incremental::Xof<168usize> for libcrux_sha3::portable::incremental::Shake128Xof} d5139 2 a5140 3 static inline void libcrux_sha3_portable_incremental_absorb_26( libcrux_sha3_generic_keccak_xof_KeccakXofState_97 *self, Eurydice_slice input) { d5142 1 a5142 1 libcrux_sha3_generic_keccak_xof_absorb_35_c60(self, buf); d5145 9 d5155 2 a5156 3 This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} d5159 1 a5159 1 A monomorphic instance of libcrux_sha3.generic_keccak.xof.absorb_final_35 d5166 11 a5176 10 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_xof_absorb_final_35_9e0( libcrux_sha3_generic_keccak_xof_KeccakXofState_97 *self, Eurydice_slice *inputs) { libcrux_sha3_generic_keccak_xof_absorb_35_c60(self, inputs); Eurydice_slice borrowed[1U]; for (size_t i = (size_t)0U; i < (size_t)1U; i++) { uint8_t buf[168U] = {0U}; borrowed[i] = core_array___Array_T__N___as_slice((size_t)168U, buf, uint8_t, Eurydice_slice); } d5179 28 a5206 6 borrowed[i0] = Eurydice_array_to_slice((size_t)168U, self->buf[i0], uint8_t); } libcrux_sha3_simd_portable_load_last_a1_c6(&self->inner, borrowed, (size_t)0U, self->buf_len); libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); d5210 3 a5212 2 This function found in impl {libcrux_sha3::portable::incremental::Xof<168usize> for libcrux_sha3::portable::incremental::Shake128Xof} d5214 3 a5216 3 static inline void libcrux_sha3_portable_incremental_absorb_final_26( libcrux_sha3_generic_keccak_xof_KeccakXofState_97 *self, Eurydice_slice input) { d5218 2 a5219 1 libcrux_sha3_generic_keccak_xof_absorb_final_35_9e0(self, buf); d5223 5 a5227 3 This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} d5230 1 a5230 1 A monomorphic instance of libcrux_sha3.generic_keccak.xof.zero_block_35 d5236 1 a5236 1 static inline void libcrux_sha3_generic_keccak_xof_zero_block_35_c60( d5238 168 a5405 1 memset(ret, 0U, 168U * sizeof(uint8_t)); d5409 5 a5413 3 This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} d5416 1 a5416 1 A monomorphic instance of libcrux_sha3.generic_keccak.xof.new_35 d5422 7 a5428 9 static inline libcrux_sha3_generic_keccak_xof_KeccakXofState_97 libcrux_sha3_generic_keccak_xof_new_35_c60(void) { libcrux_sha3_generic_keccak_xof_KeccakXofState_97 lit; lit.inner = libcrux_sha3_generic_keccak_new_80_04(); uint8_t repeat_expression[1U][168U]; for (size_t i = (size_t)0U; i < (size_t)1U; i++) { libcrux_sha3_generic_keccak_xof_zero_block_35_c60(repeat_expression[i]); } memcpy(lit.buf, repeat_expression, (size_t)1U * sizeof(uint8_t[168U])); d5435 61 a5495 2 This function found in impl {libcrux_sha3::portable::incremental::Xof<168usize> for libcrux_sha3::portable::incremental::Shake128Xof} d5497 50 a5546 3 static inline libcrux_sha3_generic_keccak_xof_KeccakXofState_97 libcrux_sha3_portable_incremental_new_26(void) { return libcrux_sha3_generic_keccak_xof_new_35_c60(); d5550 1 a5550 1 Squeeze `N` x `LEN` bytes. Only `N = 1` for now. d5554 15 a5568 2 {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} d5571 40 a5610 1 A monomorphic instance of libcrux_sha3.generic_keccak.xof.squeeze_85 d5613 1 d5616 3 a5618 3 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_xof_squeeze_85_13( libcrux_sha3_generic_keccak_xof_KeccakXofState_97 *self, Eurydice_slice out) { d5620 10 a5629 1 libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); d5631 17 a5647 5 size_t out_len = Eurydice_slice_len(out, uint8_t); if (out_len > (size_t)0U) { if (out_len <= (size_t)168U) { libcrux_sha3_simd_portable_squeeze_13_3a(&self->inner, out, (size_t)0U, out_len); d5649 15 a5663 15 size_t blocks = out_len / (size_t)168U; for (size_t i = (size_t)0U; i < blocks; i++) { size_t i0 = i; libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); libcrux_sha3_simd_portable_squeeze_13_3a( &self->inner, out, i0 * (size_t)168U, (size_t)168U); } size_t remaining = out_len % (size_t)168U; if (remaining > (size_t)0U) { libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); libcrux_sha3_simd_portable_squeeze_13_3a( &self->inner, out, blocks * (size_t)168U, remaining); } } self->sponge = true; d5665 1 d5672 3 a5674 2 This function found in impl {libcrux_sha3::portable::incremental::Xof<168usize> for libcrux_sha3::portable::incremental::Shake128Xof} d5676 4 a5679 4 static inline void libcrux_sha3_portable_incremental_squeeze_26( libcrux_sha3_generic_keccak_xof_KeccakXofState_97 *self, Eurydice_slice out) { libcrux_sha3_generic_keccak_xof_squeeze_85_13(self, out); d5683 2 a5684 2 This function found in impl {core::clone::Clone for libcrux_sha3::portable::KeccakState} d5686 3 a5688 3 static inline libcrux_sha3_generic_keccak_KeccakState_17 libcrux_sha3_portable_clone_fe( libcrux_sha3_generic_keccak_KeccakState_17 *self) { d5693 2 a5694 2 This function found in impl {core::convert::From for u32} d5696 2 a5697 1 static inline uint32_t libcrux_sha3_from_6c(libcrux_sha3_Algorithm v) { d5699 2 a5700 1 case libcrux_sha3_Algorithm_Sha224: { d5703 3 a5705 2 case libcrux_sha3_Algorithm_Sha256: { return 2U; d5707 3 a5709 2 case libcrux_sha3_Algorithm_Sha384: { return 3U; d5711 3 a5713 2 case libcrux_sha3_Algorithm_Sha512: { return 4U; d5721 1 a5721 1 return 1U; d5725 2 a5726 2 This function found in impl {core::convert::From for libcrux_sha3::Algorithm} d5728 2 a5729 1 static inline libcrux_sha3_Algorithm libcrux_sha3_from_29(uint32_t v) { d5732 1 d5736 2 a5737 1 return libcrux_sha3_Algorithm_Sha256; d5740 2 a5741 1 return libcrux_sha3_Algorithm_Sha384; d5744 2 a5745 1 return libcrux_sha3_Algorithm_Sha512; d5753 1 a5753 1 return libcrux_sha3_Algorithm_Sha224; d5756 8 d5768 2 a5769 2 #define libcrux_sha3_portable_H_DEFINED #endif /* libcrux_sha3_portable_H */ d5771 1 a5771 1 /* from libcrux/libcrux-ml-kem/extracts/c_header_only/generated/libcrux_mlkem768_portable.h */ d5773 1 a5773 1 * SPDX-FileCopyrightText: 2025 Cryspen Sarl d5778 5 a5782 5 * Charon: 667d2fc98984ff7f3df989c2367e6c1fa4a000e7 * Eurydice: 2381cbc416ef2ad0b561c362c500bc84f36b6785 * Karamel: 80f5435f2fc505973c469a4afcc8d875cddd0d8b * F*: 71d8221589d4d438af3706d89cb653cf53e18aab * Libcrux: 68dfed5a4a9e40277f62828471c029afed1ecdcc d5785 2 a5786 3 #ifndef libcrux_mlkem768_portable_H #define libcrux_mlkem768_portable_H d5793 6 a5798 1 static inline void libcrux_ml_kem_hash_functions_portable_G( d5806 1 a5806 1 static inline void libcrux_ml_kem_hash_functions_portable_H( d5814 9 d5857 1 a5857 3 static KRML_MUSTINLINE int16_t libcrux_ml_kem_polynomial_zeta(size_t i) { return libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[i]; } d5859 3 a5861 1 #define LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT ((size_t)16U) d5863 1 a5863 1 #define LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR ((size_t)16U) a5867 2 #define LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS ((int16_t)3329) d5880 1 a5880 1 Result_0a dst; d5882 3 a5884 3 &dst, Eurydice_slice_subslice3(array, (size_t)0U, (size_t)16U, int16_t *), Eurydice_slice, int16_t[16U], TryFromSliceError); unwrap_26_00(dst, ret); d5890 2 a5891 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d5894 135 a6028 3 libcrux_ml_kem_vector_portable_from_i16_array_b8(Eurydice_slice array) { return libcrux_ml_kem_vector_portable_vector_type_from_i16_array( libcrux_secrets_int_classify_public_classify_ref_9b_39(array)); d6042 63 d6108 16 a6123 4 int16_t ret[16U]; int16_t buf[16U] = {0U}; libcrux_secrets_int_public_integers_classify_27_46(buf, ret); memcpy(lit.elements, ret, (size_t)16U * sizeof(int16_t)); d6127 569 d6697 2 a6698 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d6701 1 a6701 1 libcrux_ml_kem_vector_portable_ZERO_b8(void) { d6719 2 a6720 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d6723 1 a6723 1 libcrux_ml_kem_vector_portable_add_b8( d6743 2 a6744 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d6747 1 a6747 1 libcrux_ml_kem_vector_portable_sub_b8( d6755 1 a6755 1 libcrux_ml_kem_vector_portable_vector_type_PortableVector vec, int16_t c) { d6760 1 a6760 1 vec.elements[uu____0] = vec.elements[uu____0] * c; d6762 1 a6762 1 return vec; d6766 2 a6767 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d6770 15 a6784 3 libcrux_ml_kem_vector_portable_multiply_by_constant_b8( libcrux_ml_kem_vector_portable_vector_type_PortableVector vec, int16_t c) { return libcrux_ml_kem_vector_portable_arithmetic_multiply_by_constant(vec, c); d6788 2 a6789 2 Note: This function is not secret independent Only use with public values. d6791 7 d6800 18 a6817 8 libcrux_ml_kem_vector_portable_vector_type_PortableVector vec) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; if (libcrux_secrets_int_public_integers_declassify_d8_39( vec.elements[i0]) >= (int16_t)3329) { size_t uu____0 = i0; vec.elements[uu____0] = vec.elements[uu____0] - (int16_t)3329; d6819 1 a6820 1 return vec; d6824 2 a6825 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d6828 1 a6828 1 libcrux_ml_kem_vector_portable_cond_subtract_3329_b8( d6836 1 a6836 1 #define LIBCRUX_ML_KEM_VECTOR_TRAITS_BARRETT_SHIFT ((int32_t)26) d6838 3 a6840 2 #define LIBCRUX_ML_KEM_VECTOR_TRAITS_BARRETT_R \ ((int32_t)1 << (uint32_t)LIBCRUX_ML_KEM_VECTOR_TRAITS_BARRETT_SHIFT) d6853 1 a6853 3 Note: The input bound is 28296 to prevent overflow in the multiplication of quotient by FIELD_MODULUS d6858 1 a6858 1 int32_t t = libcrux_secrets_int_as_i32_f5(value) * d6860 5 a6864 3 (LIBCRUX_ML_KEM_VECTOR_TRAITS_BARRETT_R >> 1U); int16_t quotient = libcrux_secrets_int_as_i16_36( t >> (uint32_t)LIBCRUX_ML_KEM_VECTOR_TRAITS_BARRETT_SHIFT); d6870 1 a6870 1 libcrux_ml_kem_vector_portable_vector_type_PortableVector vec) { d6874 1 a6874 1 int16_t vi = d6876 1 a6876 2 vec.elements[i0]); vec.elements[i0] = vi; d6878 1 a6878 1 return vec; d6882 2 a6883 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d6886 3 a6888 3 libcrux_ml_kem_vector_portable_barrett_reduce_b8( libcrux_ml_kem_vector_portable_vector_type_PortableVector vector) { return libcrux_ml_kem_vector_portable_arithmetic_barrett_reduce(vector); d6893 4 d6906 1 a6906 5 `|result| ≤ ceil(|value| / MONTGOMERY_R) + 1665 In particular, if `|value| ≤ FIELD_MODULUS-1 * FIELD_MODULUS-1`, then `|o| <= FIELD_MODULUS-1`. And, if `|value| ≤ pow2 16 * FIELD_MODULUS-1`, then `|o| <= FIELD_MODULUS + 1664 d6908 2 d6915 2 a6916 4 libcrux_secrets_int_as_i32_f5(libcrux_secrets_int_as_i16_36(value)) * libcrux_secrets_int_as_i32_b8( libcrux_secrets_int_public_integers_classify_27_df( LIBCRUX_ML_KEM_VECTOR_TRAITS_INVERSE_OF_MODULUS_MOD_MONTGOMERY_R)); d6918 9 a6926 10 libcrux_secrets_int_as_i32_f5(libcrux_secrets_int_as_i16_36(k)) * libcrux_secrets_int_as_i32_f5( libcrux_secrets_int_public_integers_classify_27_39( LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS)); int16_t c = libcrux_secrets_int_as_i16_36( k_times_modulus >> (uint32_t)LIBCRUX_ML_KEM_VECTOR_PORTABLE_ARITHMETIC_MONTGOMERY_SHIFT); int16_t value_high = libcrux_secrets_int_as_i16_36( value >> (uint32_t)LIBCRUX_ML_KEM_VECTOR_PORTABLE_ARITHMETIC_MONTGOMERY_SHIFT); a6943 2 int32_t product = libcrux_secrets_int_as_i32_f5(fe) * libcrux_secrets_int_as_i32_f5(fer); d6945 1 a6945 1 product); d6950 1 a6950 1 libcrux_ml_kem_vector_portable_vector_type_PortableVector vec, int16_t c) { d6954 1 a6954 1 vec.elements[i0] = d6956 1 a6956 1 vec.elements[i0], c); d6958 1 a6958 1 return vec; d6962 2 a6963 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d6966 2 a6967 3 libcrux_ml_kem_vector_portable_montgomery_multiply_by_constant_b8( libcrux_ml_kem_vector_portable_vector_type_PortableVector vector, int16_t constant) { d6969 1 a6969 51 vector, libcrux_secrets_int_public_integers_classify_27_39(constant)); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_arithmetic_bitwise_and_with_constant( libcrux_ml_kem_vector_portable_vector_type_PortableVector vec, int16_t c) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; size_t uu____0 = i0; vec.elements[uu____0] = vec.elements[uu____0] & c; } return vec; } /** A monomorphic instance of libcrux_ml_kem.vector.portable.arithmetic.shift_right with const generics - SHIFT_BY= 15 */ static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_arithmetic_shift_right_ef( libcrux_ml_kem_vector_portable_vector_type_PortableVector vec) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; vec.elements[i0] = vec.elements[i0] >> (uint32_t)(int32_t)15; } return vec; } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_arithmetic_to_unsigned_representative( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { libcrux_ml_kem_vector_portable_vector_type_PortableVector t = libcrux_ml_kem_vector_portable_arithmetic_shift_right_ef(a); libcrux_ml_kem_vector_portable_vector_type_PortableVector fm = libcrux_ml_kem_vector_portable_arithmetic_bitwise_and_with_constant( t, LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS); return libcrux_ml_kem_vector_portable_arithmetic_add(a, &fm); } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_to_unsigned_representative_b8( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { return libcrux_ml_kem_vector_portable_arithmetic_to_unsigned_representative( a); d6997 1 a6997 3 int16_t shifted = libcrux_secrets_int_public_integers_classify_27_39((int16_t)1664) - libcrux_secrets_int_as_i16_ca(fe); d7001 1 a7001 3 int16_t r0 = shifted_positive_in_range >> 15U; int16_t r1 = r0 & (int16_t)1; return libcrux_secrets_int_as_u8_f5(r1); d7006 1 a7006 1 libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { d7010 1 a7010 1 a.elements[i0] = libcrux_secrets_int_as_i16_59( d7012 1 a7012 1 libcrux_secrets_int_as_u16_f5(a.elements[i0]))); d7014 1 a7014 1 return a; d7018 2 a7019 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d7022 3 a7024 3 libcrux_ml_kem_vector_portable_compress_1_b8( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { return libcrux_ml_kem_vector_portable_compress_compress_1(a); d7036 1 a7036 2 uint64_t compressed = libcrux_secrets_int_as_u64_ca(fe) << (uint32_t)coefficient_bits; d7040 1 a7040 1 return libcrux_secrets_int_as_i16_b8( d7042 1 a7042 24 coefficient_bits, libcrux_secrets_int_as_u32_a3(compressed))); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_compress_decompress_1( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { libcrux_ml_kem_vector_portable_vector_type_PortableVector z = libcrux_ml_kem_vector_portable_vector_type_zero(); libcrux_ml_kem_vector_portable_vector_type_PortableVector s = libcrux_ml_kem_vector_portable_arithmetic_sub(z, &a); libcrux_ml_kem_vector_portable_vector_type_PortableVector res = libcrux_ml_kem_vector_portable_arithmetic_bitwise_and_with_constant( s, (int16_t)1665); return res; } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_decompress_1_b8( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { return libcrux_ml_kem_vector_portable_compress_decompress_1(a); d7046 2 a7047 2 libcrux_ml_kem_vector_portable_vector_type_PortableVector *vec, int16_t zeta, size_t i, size_t j) { d7050 3 a7052 6 vec->elements[j], libcrux_secrets_int_public_integers_classify_27_39(zeta)); int16_t a_minus_t = vec->elements[i] - t; int16_t a_plus_t = vec->elements[i] + t; vec->elements[j] = a_minus_t; vec->elements[i] = a_plus_t; d7057 3 a7059 3 libcrux_ml_kem_vector_portable_vector_type_PortableVector vec, int16_t zeta0, int16_t zeta1, int16_t zeta2, int16_t zeta3) { libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta0, (size_t)0U, d7061 1 a7061 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta0, (size_t)1U, d7063 1 a7063 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta1, (size_t)4U, d7065 1 a7065 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta1, (size_t)5U, d7067 1 a7067 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta2, (size_t)8U, d7069 1 a7069 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta2, (size_t)9U, d7071 1 a7071 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta3, (size_t)12U, d7073 1 a7073 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta3, (size_t)13U, d7075 1 a7075 1 return vec; d7079 2 a7080 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d7083 1 a7083 1 libcrux_ml_kem_vector_portable_ntt_layer_1_step_b8( d7092 3 a7094 3 libcrux_ml_kem_vector_portable_vector_type_PortableVector vec, int16_t zeta0, int16_t zeta1) { libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta0, (size_t)0U, d7096 1 a7096 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta0, (size_t)1U, d7098 1 a7098 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta0, (size_t)2U, d7100 1 a7100 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta0, (size_t)3U, d7102 1 a7102 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta1, (size_t)8U, d7104 1 a7104 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta1, (size_t)9U, d7106 1 a7106 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta1, (size_t)10U, d7108 1 a7108 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta1, (size_t)11U, d7110 1 a7110 1 return vec; d7114 2 a7115 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d7118 1 a7118 1 libcrux_ml_kem_vector_portable_ntt_layer_2_step_b8( d7126 4 a7129 7 libcrux_ml_kem_vector_portable_vector_type_PortableVector vec, int16_t zeta) { libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta, (size_t)0U, (size_t)8U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta, (size_t)1U, (size_t)9U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta, (size_t)2U, d7131 1 a7131 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta, (size_t)3U, d7133 1 a7133 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta, (size_t)4U, d7135 1 a7135 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta, (size_t)5U, d7137 1 a7137 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta, (size_t)6U, d7139 1 a7139 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta, (size_t)7U, d7141 1 a7141 1 return vec; d7145 2 a7146 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d7149 1 a7149 1 libcrux_ml_kem_vector_portable_ntt_layer_3_step_b8( d7155 7 a7161 7 libcrux_ml_kem_vector_portable_vector_type_PortableVector *vec, int16_t zeta, size_t i, size_t j) { int16_t a_minus_b = vec->elements[j] - vec->elements[i]; int16_t a_plus_b = vec->elements[j] + vec->elements[i]; int16_t o0 = libcrux_ml_kem_vector_portable_arithmetic_barrett_reduce_element( a_plus_b); int16_t o1 = d7163 1 a7163 3 a_minus_b, libcrux_secrets_int_public_integers_classify_27_39(zeta)); vec->elements[i] = o0; vec->elements[j] = o1; d7168 3 a7170 3 libcrux_ml_kem_vector_portable_vector_type_PortableVector vec, int16_t zeta0, int16_t zeta1, int16_t zeta2, int16_t zeta3) { libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta0, (size_t)0U, d7172 1 a7172 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta0, (size_t)1U, d7174 1 a7174 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta1, (size_t)4U, d7176 1 a7176 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta1, (size_t)5U, d7178 1 a7178 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta2, (size_t)8U, d7180 1 a7180 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta2, (size_t)9U, d7182 1 a7182 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta3, (size_t)12U, d7184 1 a7184 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta3, (size_t)13U, d7186 1 a7186 1 return vec; d7190 2 a7191 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d7194 1 a7194 1 libcrux_ml_kem_vector_portable_inv_ntt_layer_1_step_b8( d7203 3 a7205 3 libcrux_ml_kem_vector_portable_vector_type_PortableVector vec, int16_t zeta0, int16_t zeta1) { libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta0, (size_t)0U, d7207 1 a7207 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta0, (size_t)1U, d7209 1 a7209 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta0, (size_t)2U, d7211 1 a7211 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta0, (size_t)3U, d7213 1 a7213 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta1, (size_t)8U, d7215 1 a7215 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta1, (size_t)9U, d7217 1 a7217 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta1, (size_t)10U, d7219 1 a7219 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta1, (size_t)11U, d7221 1 a7221 1 return vec; d7225 2 a7226 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d7229 1 a7229 1 libcrux_ml_kem_vector_portable_inv_ntt_layer_2_step_b8( d7238 2 a7239 3 libcrux_ml_kem_vector_portable_vector_type_PortableVector vec, int16_t zeta) { libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta, (size_t)0U, d7241 1 a7241 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta, (size_t)1U, d7243 1 a7243 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta, (size_t)2U, d7245 1 a7245 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta, (size_t)3U, d7247 1 a7247 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta, (size_t)4U, d7249 1 a7249 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta, (size_t)5U, d7251 1 a7251 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta, (size_t)6U, d7253 1 a7253 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta, (size_t)7U, d7255 1 a7255 1 return vec; d7259 2 a7260 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d7263 1 a7263 1 libcrux_ml_kem_vector_portable_inv_ntt_layer_3_step_b8( d7294 8 a7301 23 size_t i, libcrux_ml_kem_vector_portable_vector_type_PortableVector *out) { int16_t ai = a->elements[(size_t)2U * i]; int16_t bi = b->elements[(size_t)2U * i]; int16_t aj = a->elements[(size_t)2U * i + (size_t)1U]; int16_t bj = b->elements[(size_t)2U * i + (size_t)1U]; int32_t ai_bi = libcrux_secrets_int_as_i32_f5(ai) * libcrux_secrets_int_as_i32_f5(bi); int32_t aj_bj_ = libcrux_secrets_int_as_i32_f5(aj) * libcrux_secrets_int_as_i32_f5(bj); int16_t aj_bj = libcrux_ml_kem_vector_portable_arithmetic_montgomery_reduce_element( aj_bj_); int32_t aj_bj_zeta = libcrux_secrets_int_as_i32_f5(aj_bj) * libcrux_secrets_int_as_i32_f5(zeta); int32_t ai_bi_aj_bj = ai_bi + aj_bj_zeta; int16_t o0 = libcrux_ml_kem_vector_portable_arithmetic_montgomery_reduce_element( ai_bi_aj_bj); int32_t ai_bj = libcrux_secrets_int_as_i32_f5(ai) * libcrux_secrets_int_as_i32_f5(bj); int32_t aj_bi = libcrux_secrets_int_as_i32_f5(aj) * libcrux_secrets_int_as_i32_f5(bi); int32_t ai_bj_aj_bi = ai_bj + aj_bi; d7304 4 a7307 3 ai_bj_aj_bi); out->elements[(size_t)2U * i] = o0; out->elements[(size_t)2U * i + (size_t)1U] = o1; a7314 4 int16_t nzeta0 = -zeta0; int16_t nzeta1 = -zeta1; int16_t nzeta2 = -zeta2; int16_t nzeta3 = -zeta3; d7318 1 a7318 2 lhs, rhs, libcrux_secrets_int_public_integers_classify_27_39(zeta0), (size_t)0U, &out); d7320 1 a7320 2 lhs, rhs, libcrux_secrets_int_public_integers_classify_27_39(nzeta0), (size_t)1U, &out); d7322 1 a7322 2 lhs, rhs, libcrux_secrets_int_public_integers_classify_27_39(zeta1), (size_t)2U, &out); d7324 1 a7324 2 lhs, rhs, libcrux_secrets_int_public_integers_classify_27_39(nzeta1), (size_t)3U, &out); d7326 1 a7326 2 lhs, rhs, libcrux_secrets_int_public_integers_classify_27_39(zeta2), (size_t)4U, &out); d7328 1 a7328 2 lhs, rhs, libcrux_secrets_int_public_integers_classify_27_39(nzeta2), (size_t)5U, &out); d7330 1 a7330 2 lhs, rhs, libcrux_secrets_int_public_integers_classify_27_39(zeta3), (size_t)6U, &out); d7332 1 a7332 2 lhs, rhs, libcrux_secrets_int_public_integers_classify_27_39(nzeta3), (size_t)7U, &out); d7337 2 a7338 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d7341 1 a7341 1 libcrux_ml_kem_vector_portable_ntt_multiply_b8( d7353 15 a7367 28 uint8_t result0 = (((((((uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[0U]) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[1U]) << 1U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[2U]) << 2U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[3U]) << 3U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[4U]) << 4U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[5U]) << 5U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[6U]) << 6U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[7U]) << 7U; uint8_t result1 = (((((((uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[8U]) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[9U]) << 1U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[10U]) << 2U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[11U]) << 3U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[12U]) << 4U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[13U]) << 5U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[14U]) << 6U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[15U]) << 7U; ret[0U] = result0; ret[1U] = result1; } static inline void libcrux_ml_kem_vector_portable_serialize_1( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, uint8_t ret[2U]) { uint8_t ret0[2U]; libcrux_ml_kem_vector_portable_serialize_serialize_1(a, ret0); libcrux_secrets_int_public_integers_declassify_d8_d4(ret0, ret); d7371 2 a7372 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d7374 1 a7374 1 static inline void libcrux_ml_kem_vector_portable_serialize_1_b8( d7377 1 a7377 1 libcrux_ml_kem_vector_portable_serialize_1(a, ret); d7382 18 a7399 57 int16_t result0 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)0U, uint8_t, uint8_t *) & 1U); int16_t result1 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)0U, uint8_t, uint8_t *) >> 1U & 1U); int16_t result2 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)0U, uint8_t, uint8_t *) >> 2U & 1U); int16_t result3 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)0U, uint8_t, uint8_t *) >> 3U & 1U); int16_t result4 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)0U, uint8_t, uint8_t *) >> 4U & 1U); int16_t result5 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)0U, uint8_t, uint8_t *) >> 5U & 1U); int16_t result6 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)0U, uint8_t, uint8_t *) >> 6U & 1U); int16_t result7 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)0U, uint8_t, uint8_t *) >> 7U & 1U); int16_t result8 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)1U, uint8_t, uint8_t *) & 1U); int16_t result9 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)1U, uint8_t, uint8_t *) >> 1U & 1U); int16_t result10 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)1U, uint8_t, uint8_t *) >> 2U & 1U); int16_t result11 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)1U, uint8_t, uint8_t *) >> 3U & 1U); int16_t result12 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)1U, uint8_t, uint8_t *) >> 4U & 1U); int16_t result13 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)1U, uint8_t, uint8_t *) >> 5U & 1U); int16_t result14 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)1U, uint8_t, uint8_t *) >> 6U & 1U); int16_t result15 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)1U, uint8_t, uint8_t *) >> 7U & 1U); return ( KRML_CLITERAL(libcrux_ml_kem_vector_portable_vector_type_PortableVector){ .elements = {result0, result1, result2, result3, result4, result5, result6, result7, result8, result9, result10, result11, result12, result13, result14, result15}}); } static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_deserialize_1(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_serialize_deserialize_1( libcrux_secrets_int_classify_public_classify_ref_9b_90(a)); d7403 2 a7404 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d7407 2 a7408 2 libcrux_ml_kem_vector_portable_deserialize_1_b8(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_deserialize_1(a); d7420 21 a7440 21 uint8_t result0 = (uint32_t)libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)1U, int16_t, int16_t *)) << 4U | (uint32_t)libcrux_secrets_int_as_u8_f5(Eurydice_slice_index( v, (size_t)0U, int16_t, int16_t *)); uint8_t result1 = (uint32_t)libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)3U, int16_t, int16_t *)) << 4U | (uint32_t)libcrux_secrets_int_as_u8_f5(Eurydice_slice_index( v, (size_t)2U, int16_t, int16_t *)); uint8_t result2 = (uint32_t)libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)5U, int16_t, int16_t *)) << 4U | (uint32_t)libcrux_secrets_int_as_u8_f5(Eurydice_slice_index( v, (size_t)4U, int16_t, int16_t *)); uint8_t result3 = (uint32_t)libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)7U, int16_t, int16_t *)) << 4U | (uint32_t)libcrux_secrets_int_as_u8_f5(Eurydice_slice_index( v, (size_t)6U, int16_t, int16_t *)); return (KRML_CLITERAL(uint8_t_x4){ d7450 2 a7451 2 Eurydice_array_to_subslice3(v.elements, (size_t)0U, (size_t)8U, int16_t *)); d7454 12 a7465 18 Eurydice_array_to_subslice3(v.elements, (size_t)8U, (size_t)16U, int16_t *)); ret[0U] = result0_3.fst; ret[1U] = result0_3.snd; ret[2U] = result0_3.thd; ret[3U] = result0_3.f3; ret[4U] = result4_7.fst; ret[5U] = result4_7.snd; ret[6U] = result4_7.thd; ret[7U] = result4_7.f3; } static inline void libcrux_ml_kem_vector_portable_serialize_4( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, uint8_t ret[8U]) { uint8_t ret0[8U]; libcrux_ml_kem_vector_portable_serialize_serialize_4(a, ret0); libcrux_secrets_int_public_integers_declassify_d8_76(ret0, ret); d7469 2 a7470 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d7472 1 a7472 1 static inline void libcrux_ml_kem_vector_portable_serialize_4_b8( d7475 1 a7475 1 libcrux_ml_kem_vector_portable_serialize_4(a, ret); d7481 36 a7516 36 int16_t v0 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(bytes, (size_t)0U, uint8_t, uint8_t *) & 15U); int16_t v1 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(bytes, (size_t)0U, uint8_t, uint8_t *) >> 4U & 15U); int16_t v2 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *) & 15U); int16_t v3 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *) >> 4U & 15U); int16_t v4 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(bytes, (size_t)2U, uint8_t, uint8_t *) & 15U); int16_t v5 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(bytes, (size_t)2U, uint8_t, uint8_t *) >> 4U & 15U); int16_t v6 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(bytes, (size_t)3U, uint8_t, uint8_t *) & 15U); int16_t v7 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(bytes, (size_t)3U, uint8_t, uint8_t *) >> 4U & 15U); return (KRML_CLITERAL(int16_t_x8){.fst = v0, .snd = v1, .thd = v2, .f3 = v3, .f4 = v4, .f5 = v5, .f6 = v6, .f7 = v7}); d7522 1 a7522 1 Eurydice_slice_subslice3(bytes, (size_t)0U, (size_t)4U, uint8_t *)); d7524 20 a7543 12 Eurydice_slice_subslice3(bytes, (size_t)4U, (size_t)8U, uint8_t *)); return ( KRML_CLITERAL(libcrux_ml_kem_vector_portable_vector_type_PortableVector){ .elements = {v0_7.fst, v0_7.snd, v0_7.thd, v0_7.f3, v0_7.f4, v0_7.f5, v0_7.f6, v0_7.f7, v8_15.fst, v8_15.snd, v8_15.thd, v8_15.f3, v8_15.f4, v8_15.f5, v8_15.f6, v8_15.f7}}); } static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_deserialize_4(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_serialize_deserialize_4( libcrux_secrets_int_classify_public_classify_ref_9b_90(a)); d7547 2 a7548 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d7551 2 a7552 2 libcrux_ml_kem_vector_portable_deserialize_4_b8(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_deserialize_4(a); d7564 4 a7567 3 libcrux_ml_kem_vector_portable_serialize_serialize_10_int(Eurydice_slice v) { uint8_t r0 = libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)0U, int16_t, int16_t *) & (int16_t)255); d7569 4 a7572 6 (uint32_t)libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)1U, int16_t, int16_t *) & (int16_t)63) << 2U | (uint32_t)libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)0U, int16_t, int16_t *) >> 8U & (int16_t)3); d7574 2 a7575 6 (uint32_t)libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)2U, int16_t, int16_t *) & (int16_t)15) << 4U | (uint32_t)libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)1U, int16_t, int16_t *) >> 6U & (int16_t)15); d7577 165 a7741 10 (uint32_t)libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)3U, int16_t, int16_t *) & (int16_t)3) << 6U | (uint32_t)libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)2U, int16_t, int16_t *) >> 4U & (int16_t)63); uint8_t r4 = libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)3U, int16_t, int16_t *) >> 2U & (int16_t)255); return (KRML_CLITERAL(uint8_t_x5){ d7750 1 a7750 2 Eurydice_array_to_subslice3(v.elements, (size_t)0U, (size_t)4U, int16_t *)); d7752 1 a7752 2 Eurydice_array_to_subslice3(v.elements, (size_t)4U, (size_t)8U, int16_t *)); d7754 2 a7755 2 Eurydice_array_to_subslice3(v.elements, (size_t)8U, (size_t)12U, int16_t *)); d7757 24 a7780 30 Eurydice_array_to_subslice3(v.elements, (size_t)12U, (size_t)16U, int16_t *)); ret[0U] = r0_4.fst; ret[1U] = r0_4.snd; ret[2U] = r0_4.thd; ret[3U] = r0_4.f3; ret[4U] = r0_4.f4; ret[5U] = r5_9.fst; ret[6U] = r5_9.snd; ret[7U] = r5_9.thd; ret[8U] = r5_9.f3; ret[9U] = r5_9.f4; ret[10U] = r10_14.fst; ret[11U] = r10_14.snd; ret[12U] = r10_14.thd; ret[13U] = r10_14.f3; ret[14U] = r10_14.f4; ret[15U] = r15_19.fst; ret[16U] = r15_19.snd; ret[17U] = r15_19.thd; ret[18U] = r15_19.f3; ret[19U] = r15_19.f4; } static inline void libcrux_ml_kem_vector_portable_serialize_10( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, uint8_t ret[20U]) { uint8_t ret0[20U]; libcrux_ml_kem_vector_portable_serialize_serialize_10(a, ret0); libcrux_secrets_int_public_integers_declassify_d8_57(ret0, ret); d7784 2 a7785 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d7787 1 a7787 1 static inline void libcrux_ml_kem_vector_portable_serialize_10_b8( d7790 1 a7790 1 libcrux_ml_kem_vector_portable_serialize_10(a, ret); d7796 2 a7797 3 int16_t r0 = libcrux_secrets_int_as_i16_f5( (libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *)) & d7800 4 a7803 6 (libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)0U, uint8_t, uint8_t *)) & (int16_t)255)); int16_t r1 = libcrux_secrets_int_as_i16_f5( (libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)2U, uint8_t, uint8_t *)) & d7806 4 a7809 6 libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *)) >> 2U); int16_t r2 = libcrux_secrets_int_as_i16_f5( (libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)3U, uint8_t, uint8_t *)) & d7812 4 a7815 6 libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)2U, uint8_t, uint8_t *)) >> 4U); int16_t r3 = libcrux_secrets_int_as_i16_f5( libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)4U, uint8_t, uint8_t *)) d7817 4 a7820 6 libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)3U, uint8_t, uint8_t *)) >> 6U); int16_t r4 = libcrux_secrets_int_as_i16_f5( (libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)6U, uint8_t, uint8_t *)) & d7823 4 a7826 6 (libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)5U, uint8_t, uint8_t *)) & (int16_t)255)); int16_t r5 = libcrux_secrets_int_as_i16_f5( (libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)7U, uint8_t, uint8_t *)) & d7829 4 a7832 6 libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)6U, uint8_t, uint8_t *)) >> 2U); int16_t r6 = libcrux_secrets_int_as_i16_f5( (libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)8U, uint8_t, uint8_t *)) & d7835 4 a7838 6 libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)7U, uint8_t, uint8_t *)) >> 4U); int16_t r7 = libcrux_secrets_int_as_i16_f5( libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)9U, uint8_t, uint8_t *)) d7840 10 a7849 11 libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)8U, uint8_t, uint8_t *)) >> 6U); return (KRML_CLITERAL(int16_t_x8){.fst = r0, .snd = r1, .thd = r2, .f3 = r3, .f4 = r4, .f5 = r5, .f6 = r6, .f7 = r7}); d7855 1 a7855 1 Eurydice_slice_subslice3(bytes, (size_t)0U, (size_t)10U, uint8_t *)); d7858 20 a7877 12 Eurydice_slice_subslice3(bytes, (size_t)10U, (size_t)20U, uint8_t *)); return ( KRML_CLITERAL(libcrux_ml_kem_vector_portable_vector_type_PortableVector){ .elements = {v0_7.fst, v0_7.snd, v0_7.thd, v0_7.f3, v0_7.f4, v0_7.f5, v0_7.f6, v0_7.f7, v8_15.fst, v8_15.snd, v8_15.thd, v8_15.f3, v8_15.f4, v8_15.f5, v8_15.f6, v8_15.f7}}); } static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_deserialize_10(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_serialize_deserialize_10( libcrux_secrets_int_classify_public_classify_ref_9b_90(a)); d7881 2 a7882 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d7885 2 a7886 2 libcrux_ml_kem_vector_portable_deserialize_10_b8(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_deserialize_10(a); d7897 12 a7908 10 uint8_t r0 = libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)0U, int16_t, int16_t *) & (int16_t)255); uint8_t r1 = libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)0U, int16_t, int16_t *) >> 8U | (Eurydice_slice_index(v, (size_t)1U, int16_t, int16_t *) & (int16_t)15) << 4U); uint8_t r2 = libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)1U, int16_t, int16_t *) >> 4U & (int16_t)255); return (KRML_CLITERAL(uint8_t_x3){.fst = r0, .snd = r1, .thd = r2}); d7916 1 a7916 2 Eurydice_array_to_subslice3(v.elements, (size_t)0U, (size_t)2U, int16_t *)); d7918 1 a7918 2 Eurydice_array_to_subslice3(v.elements, (size_t)2U, (size_t)4U, int16_t *)); d7920 1 a7920 2 Eurydice_array_to_subslice3(v.elements, (size_t)4U, (size_t)6U, int16_t *)); d7922 1 a7922 2 Eurydice_array_to_subslice3(v.elements, (size_t)6U, (size_t)8U, int16_t *)); d7924 2 a7925 2 Eurydice_array_to_subslice3(v.elements, (size_t)8U, (size_t)10U, int16_t *)); d7927 2 a7928 2 Eurydice_array_to_subslice3(v.elements, (size_t)10U, (size_t)12U, int16_t *)); d7930 2 a7931 2 Eurydice_array_to_subslice3(v.elements, (size_t)12U, (size_t)14U, int16_t *)); d7933 28 a7960 34 Eurydice_array_to_subslice3(v.elements, (size_t)14U, (size_t)16U, int16_t *)); ret[0U] = r0_2.fst; ret[1U] = r0_2.snd; ret[2U] = r0_2.thd; ret[3U] = r3_5.fst; ret[4U] = r3_5.snd; ret[5U] = r3_5.thd; ret[6U] = r6_8.fst; ret[7U] = r6_8.snd; ret[8U] = r6_8.thd; ret[9U] = r9_11.fst; ret[10U] = r9_11.snd; ret[11U] = r9_11.thd; ret[12U] = r12_14.fst; ret[13U] = r12_14.snd; ret[14U] = r12_14.thd; ret[15U] = r15_17.fst; ret[16U] = r15_17.snd; ret[17U] = r15_17.thd; ret[18U] = r18_20.fst; ret[19U] = r18_20.snd; ret[20U] = r18_20.thd; ret[21U] = r21_23.fst; ret[22U] = r21_23.snd; ret[23U] = r21_23.thd; } static inline void libcrux_ml_kem_vector_portable_serialize_12( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, uint8_t ret[24U]) { uint8_t ret0[24U]; libcrux_ml_kem_vector_portable_serialize_serialize_12(a, ret0); libcrux_secrets_int_public_integers_declassify_d8_d2(ret0, ret); d7964 2 a7965 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d7967 1 a7967 1 static inline void libcrux_ml_kem_vector_portable_serialize_12_b8( d7970 1 a7970 1 libcrux_ml_kem_vector_portable_serialize_12(a, ret); d7981 6 a7986 6 int16_t byte0 = libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)0U, uint8_t, uint8_t *)); int16_t byte1 = libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *)); int16_t byte2 = libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)2U, uint8_t, uint8_t *)); d7989 1 a7989 1 return (KRML_CLITERAL(int16_t_x2){.fst = r0, .snd = r1}); d7995 1 a7995 1 Eurydice_slice_subslice3(bytes, (size_t)0U, (size_t)3U, uint8_t *)); d7997 1 a7997 1 Eurydice_slice_subslice3(bytes, (size_t)3U, (size_t)6U, uint8_t *)); d7999 1 a7999 1 Eurydice_slice_subslice3(bytes, (size_t)6U, (size_t)9U, uint8_t *)); d8001 1 a8001 1 Eurydice_slice_subslice3(bytes, (size_t)9U, (size_t)12U, uint8_t *)); d8003 1 a8003 1 Eurydice_slice_subslice3(bytes, (size_t)12U, (size_t)15U, uint8_t *)); d8006 1 a8006 1 Eurydice_slice_subslice3(bytes, (size_t)15U, (size_t)18U, uint8_t *)); d8009 1 a8009 1 Eurydice_slice_subslice3(bytes, (size_t)18U, (size_t)21U, uint8_t *)); d8012 20 a8031 13 Eurydice_slice_subslice3(bytes, (size_t)21U, (size_t)24U, uint8_t *)); return ( KRML_CLITERAL(libcrux_ml_kem_vector_portable_vector_type_PortableVector){ .elements = {v0_1.fst, v0_1.snd, v2_3.fst, v2_3.snd, v4_5.fst, v4_5.snd, v6_7.fst, v6_7.snd, v8_9.fst, v8_9.snd, v10_11.fst, v10_11.snd, v12_13.fst, v12_13.snd, v14_15.fst, v14_15.snd}}); } static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_deserialize_12(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_serialize_deserialize_12( libcrux_secrets_int_classify_public_classify_ref_9b_90(a)); d8035 2 a8036 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d8039 2 a8040 2 libcrux_ml_kem_vector_portable_deserialize_12_b8(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_deserialize_12(a); d8058 7 d8069 15 d8086 10 a8095 3 if (d2 < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS) { if (sampled < (size_t)16U) { Eurydice_slice_index(result, sampled, int16_t, int16_t *) = d2; d8097 1 d8105 2 a8106 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d8108 1 a8108 1 static inline size_t libcrux_ml_kem_vector_portable_rej_sample_b8( d8113 1 a8113 1 #define LIBCRUX_ML_KEM_MLKEM768_VECTOR_U_COMPRESSION_FACTOR ((size_t)10U) d8115 1 a8115 1 #define LIBCRUX_ML_KEM_MLKEM768_C1_BLOCK_SIZE \ d8117 1 a8117 1 LIBCRUX_ML_KEM_MLKEM768_VECTOR_U_COMPRESSION_FACTOR / (size_t)8U) d8119 1 a8119 1 #define LIBCRUX_ML_KEM_MLKEM768_RANK ((size_t)3U) d8121 2 a8122 2 #define LIBCRUX_ML_KEM_MLKEM768_C1_SIZE \ (LIBCRUX_ML_KEM_MLKEM768_C1_BLOCK_SIZE * LIBCRUX_ML_KEM_MLKEM768_RANK) d8124 1 a8124 1 #define LIBCRUX_ML_KEM_MLKEM768_VECTOR_V_COMPRESSION_FACTOR ((size_t)4U) d8126 1 a8126 1 #define LIBCRUX_ML_KEM_MLKEM768_C2_SIZE \ d8128 1 a8128 1 LIBCRUX_ML_KEM_MLKEM768_VECTOR_V_COMPRESSION_FACTOR / (size_t)8U) d8130 2 a8131 2 #define LIBCRUX_ML_KEM_MLKEM768_CPA_PKE_CIPHERTEXT_SIZE \ (LIBCRUX_ML_KEM_MLKEM768_C1_SIZE + LIBCRUX_ML_KEM_MLKEM768_C2_SIZE) d8133 2 a8134 2 #define LIBCRUX_ML_KEM_MLKEM768_T_AS_NTT_ENCODED_SIZE \ (LIBCRUX_ML_KEM_MLKEM768_RANK * \ d8138 2 a8139 2 #define LIBCRUX_ML_KEM_MLKEM768_CPA_PKE_PUBLIC_KEY_SIZE \ (LIBCRUX_ML_KEM_MLKEM768_T_AS_NTT_ENCODED_SIZE + (size_t)32U) d8141 3 a8143 3 #define LIBCRUX_ML_KEM_MLKEM768_CPA_PKE_SECRET_KEY_SIZE \ (LIBCRUX_ML_KEM_MLKEM768_RANK * \ LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT * \ d8158 1 a8158 1 LIBCRUX_ML_KEM_MLKEM768_CPA_PKE_CIPHERTEXT_SIZE) d8160 1 a8160 1 typedef libcrux_ml_kem_types_MlKemPrivateKey_d9 d8163 1 a8163 1 typedef libcrux_ml_kem_types_MlKemPublicKey_30 d8166 2 a8167 2 #define LIBCRUX_ML_KEM_MLKEM768_RANKED_BYTES_PER_RING_ELEMENT \ (LIBCRUX_ML_KEM_MLKEM768_RANK * \ d8170 4 a8173 4 #define LIBCRUX_ML_KEM_MLKEM768_SECRET_KEY_SIZE \ (LIBCRUX_ML_KEM_MLKEM768_CPA_PKE_SECRET_KEY_SIZE + \ LIBCRUX_ML_KEM_MLKEM768_CPA_PKE_PUBLIC_KEY_SIZE + \ LIBCRUX_ML_KEM_CONSTANTS_H_DIGEST_SIZE + \ d8181 1 a8181 1 typedef struct libcrux_ml_kem_polynomial_PolynomialRingElement_1d_s { d8183 1 a8183 11 } libcrux_ml_kem_polynomial_PolynomialRingElement_1d; /** A monomorphic instance of libcrux_ml_kem.ind_cpa.unpacked.IndCpaPrivateKeyUnpacked with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - $3size_t */ typedef struct libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_a0_s { libcrux_ml_kem_polynomial_PolynomialRingElement_1d secret_as_ntt[3U]; } libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_a0; d8187 1 a8187 2 {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]} d8190 1 a8190 1 A monomorphic instance of libcrux_ml_kem.polynomial.ZERO_d6 d8195 19 a8213 11 static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_polynomial_ZERO_d6_ea(void) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d lit; libcrux_ml_kem_vector_portable_vector_type_PortableVector repeat_expression[16U]; for (size_t i = (size_t)0U; i < (size_t)16U; i++) { repeat_expression[i] = libcrux_ml_kem_vector_portable_ZERO_b8(); } memcpy(lit.coefficients, repeat_expression, (size_t)16U * sizeof(libcrux_ml_kem_vector_portable_vector_type_PortableVector)); d8218 1 a8218 8 This function found in impl {core::ops::function::FnMut<(usize), libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]> for libcrux_ml_kem::ind_cpa::decrypt::closure[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.decrypt.call_mut_0b a8221 4 - CIPHERTEXT_SIZE= 1088 - VECTOR_U_ENCODED_SIZE= 960 - U_COMPRESSION_FACTOR= 10 - V_COMPRESSION_FACTOR= 4 d8223 3 a8225 3 static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_ind_cpa_decrypt_call_mut_0b_42(void **_, size_t tupled_args) { return libcrux_ml_kem_polynomial_ZERO_d6_ea(); d8234 2 a8235 2 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_serialize_deserialize_to_uncompressed_ring_element_ea( d8237 2 a8238 2 libcrux_ml_kem_polynomial_PolynomialRingElement_1d re = libcrux_ml_kem_polynomial_ZERO_d6_ea(); d8242 2 a8243 3 Eurydice_slice bytes = Eurydice_slice_subslice3(serialized, i0 * (size_t)24U, i0 * (size_t)24U + (size_t)24U, uint8_t *); d8245 1 a8245 1 libcrux_ml_kem_vector_portable_deserialize_12_b8(bytes); d8255 1 a8255 1 A monomorphic instance of libcrux_ml_kem.ind_cpa.deserialize_vector d8260 1 a8260 1 static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_deserialize_vector_1b( d8262 2 a8263 1 libcrux_ml_kem_polynomial_PolynomialRingElement_1d *secret_as_ntt) { d8265 6 d8272 8 a8279 8 libcrux_ml_kem_polynomial_PolynomialRingElement_1d uu____0 = libcrux_ml_kem_serialize_deserialize_to_uncompressed_ring_element_ea( Eurydice_slice_subslice3( secret_key, i0 * LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT, (i0 + (size_t)1U) * LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT, uint8_t *)); d8282 3 d8288 4 a8291 5 This function found in impl {core::ops::function::FnMut<(usize), libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]> for libcrux_ml_kem::ind_cpa::deserialize_then_decompress_u::closure[TraitClause@@0, TraitClause@@1]} d8293 4 d8299 1 a8299 1 libcrux_ml_kem.ind_cpa.deserialize_then_decompress_u.call_mut_35 with types d8305 3 a8307 4 static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_ind_cpa_deserialize_then_decompress_u_call_mut_35_6c( void **_, size_t tupled_args) { return libcrux_ml_kem_polynomial_ZERO_d6_ea(); d8317 2 a8318 2 libcrux_ml_kem_vector_portable_compress_decompress_ciphertext_coefficient_ef( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { d8322 2 a8323 5 int32_t decompressed = libcrux_secrets_int_as_i32_f5(a.elements[i0]) * libcrux_secrets_int_as_i32_f5( libcrux_secrets_int_public_integers_classify_27_39( LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS)); d8326 1 a8326 1 a.elements[i0] = libcrux_secrets_int_as_i16_36(decompressed); d8328 1 a8328 1 return a; d8332 2 a8333 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d8337 1 a8337 1 libcrux_ml_kem.vector.portable.decompress_ciphertext_coefficient_b8 with const d8342 4 a8345 4 libcrux_ml_kem_vector_portable_decompress_ciphertext_coefficient_b8_ef( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { return libcrux_ml_kem_vector_portable_compress_decompress_ciphertext_coefficient_ef( a); d8354 2 a8355 2 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_serialize_deserialize_then_decompress_10_ea( d8357 2 a8358 2 libcrux_ml_kem_polynomial_PolynomialRingElement_1d re = libcrux_ml_kem_polynomial_ZERO_d6_ea(); d8362 2 a8363 3 Eurydice_slice bytes = Eurydice_slice_subslice3(serialized, i0 * (size_t)20U, i0 * (size_t)20U + (size_t)20U, uint8_t *); d8365 1 a8365 1 libcrux_ml_kem_vector_portable_deserialize_10_b8(bytes); d8367 1 a8367 1 libcrux_ml_kem_vector_portable_decompress_ciphertext_coefficient_b8_ef( d8376 3 a8378 3 libcrux_ml_kem.serialize.deserialize_then_decompress_ring_element_u with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - COMPRESSION_FACTOR= 10 d8380 68 a8447 4 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_serialize_deserialize_then_decompress_ring_element_u_0a( Eurydice_slice serialized) { return libcrux_ml_kem_serialize_deserialize_then_decompress_10_ea(serialized); d8456 13 d8476 1 a8476 1 libcrux_ml_kem_ntt_ntt_layer_int_vec_step_ea( d8481 6 a8486 7 libcrux_ml_kem_vector_portable_montgomery_multiply_by_constant_b8(b, zeta_r); b = libcrux_ml_kem_vector_portable_sub_b8(a, &t); a = libcrux_ml_kem_vector_portable_add_b8(a, &t); return (KRML_CLITERAL( libcrux_ml_kem_vector_portable_vector_type_PortableVector_x2){.fst = a, .snd = b}); d8495 2 a8496 2 static KRML_MUSTINLINE void libcrux_ml_kem_ntt_ntt_at_layer_4_plus_ea( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re, d8508 1 a8508 1 libcrux_ml_kem_ntt_ntt_layer_int_vec_step_ea( d8510 1 a8510 1 libcrux_ml_kem_polynomial_zeta(zeta_i[0U])); d8525 3 a8527 3 static KRML_MUSTINLINE void libcrux_ml_kem_ntt_ntt_at_layer_3_ea( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re, size_t _initial_coefficient_bound) { d8532 1 a8532 1 libcrux_ml_kem_vector_portable_ntt_layer_3_step_b8( d8534 1 a8534 1 libcrux_ml_kem_polynomial_zeta(zeta_i[0U])); d8545 3 a8547 3 static KRML_MUSTINLINE void libcrux_ml_kem_ntt_ntt_at_layer_2_ea( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re, size_t _initial_coefficient_bound) { d8552 5 a8556 3 libcrux_ml_kem_vector_portable_ntt_layer_2_step_b8( re->coefficients[round], libcrux_ml_kem_polynomial_zeta(zeta_i[0U]), libcrux_ml_kem_polynomial_zeta(zeta_i[0U] + (size_t)1U)); d8567 3 a8569 3 static KRML_MUSTINLINE void libcrux_ml_kem_ntt_ntt_at_layer_1_ea( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re, size_t _initial_coefficient_bound) { d8574 9 a8582 5 libcrux_ml_kem_vector_portable_ntt_layer_1_step_b8( re->coefficients[round], libcrux_ml_kem_polynomial_zeta(zeta_i[0U]), libcrux_ml_kem_polynomial_zeta(zeta_i[0U] + (size_t)1U), libcrux_ml_kem_polynomial_zeta(zeta_i[0U] + (size_t)2U), libcrux_ml_kem_polynomial_zeta(zeta_i[0U] + (size_t)3U)); d8588 5 a8592 1 A monomorphic instance of libcrux_ml_kem.polynomial.poly_barrett_reduce d8597 2 a8598 2 static KRML_MUSTINLINE void libcrux_ml_kem_polynomial_poly_barrett_reduce_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *myself) { d8603 3 a8605 3 libcrux_ml_kem_vector_portable_barrett_reduce_b8( myself->coefficients[i0]); myself->coefficients[i0] = uu____0; a8609 16 This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.poly_barrett_reduce_d6 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_polynomial_poly_barrett_reduce_d6_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *self) { libcrux_ml_kem_polynomial_poly_barrett_reduce_ea(self); } /** d8615 2 a8616 2 static KRML_MUSTINLINE void libcrux_ml_kem_ntt_ntt_vector_u_0a( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re) { d8618 3 a8620 1 libcrux_ml_kem_ntt_ntt_at_layer_4_plus_ea(&zeta_i, re, (size_t)7U, d8622 8 a8629 10 libcrux_ml_kem_ntt_ntt_at_layer_4_plus_ea(&zeta_i, re, (size_t)6U, (size_t)2U * (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_4_plus_ea(&zeta_i, re, (size_t)5U, (size_t)3U * (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_4_plus_ea(&zeta_i, re, (size_t)4U, (size_t)4U * (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_3_ea(&zeta_i, re, (size_t)5U * (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_2_ea(&zeta_i, re, (size_t)6U * (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_1_ea(&zeta_i, re, (size_t)7U * (size_t)3328U); libcrux_ml_kem_polynomial_poly_barrett_reduce_d6_ea(re); d8645 1 a8645 1 libcrux_ml_kem_ind_cpa_deserialize_then_decompress_u_6c( d8647 2 a8648 2 libcrux_ml_kem_polynomial_PolynomialRingElement_1d ret[3U]) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d u_as_ntt[3U]; d8650 1 a8650 5 /* original Rust expression is not an lvalue in C */ void *lvalue = (void *)0U; u_as_ntt[i] = libcrux_ml_kem_ind_cpa_deserialize_then_decompress_u_call_mut_35_6c( &lvalue, i); d8660 1 a8660 1 Eurydice_slice u_bytes = Eurydice_array_to_subslice3( d8668 1 a8668 1 uint8_t *); d8670 1 a8670 1 libcrux_ml_kem_serialize_deserialize_then_decompress_ring_element_u_0a( d8672 1 a8672 1 libcrux_ml_kem_ntt_ntt_vector_u_0a(&u_as_ntt[i0]); d8676 1 a8676 1 (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); d8686 2 a8687 2 libcrux_ml_kem_vector_portable_compress_decompress_ciphertext_coefficient_d1( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { d8691 2 a8692 5 int32_t decompressed = libcrux_secrets_int_as_i32_f5(a.elements[i0]) * libcrux_secrets_int_as_i32_f5( libcrux_secrets_int_public_integers_classify_27_39( LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS)); d8695 1 a8695 1 a.elements[i0] = libcrux_secrets_int_as_i16_36(decompressed); d8697 1 a8697 1 return a; d8701 2 a8702 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d8706 1 a8706 1 libcrux_ml_kem.vector.portable.decompress_ciphertext_coefficient_b8 with const d8711 4 a8714 4 libcrux_ml_kem_vector_portable_decompress_ciphertext_coefficient_b8_d1( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { return libcrux_ml_kem_vector_portable_compress_decompress_ciphertext_coefficient_d1( a); d8723 2 a8724 2 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_serialize_deserialize_then_decompress_4_ea( d8726 2 a8727 2 libcrux_ml_kem_polynomial_PolynomialRingElement_1d re = libcrux_ml_kem_polynomial_ZERO_d6_ea(); d8731 2 a8732 2 Eurydice_slice bytes = Eurydice_slice_subslice3( serialized, i0 * (size_t)8U, i0 * (size_t)8U + (size_t)8U, uint8_t *); d8734 1 a8734 1 libcrux_ml_kem_vector_portable_deserialize_4_b8(bytes); d8736 1 a8736 1 libcrux_ml_kem_vector_portable_decompress_ciphertext_coefficient_b8_d1( d8745 28 a8772 4 libcrux_ml_kem.serialize.deserialize_then_decompress_ring_element_v with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - COMPRESSION_FACTOR= 4 d8774 5 a8778 4 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_serialize_deserialize_then_decompress_ring_element_v_89( Eurydice_slice serialized) { return libcrux_ml_kem_serialize_deserialize_then_decompress_4_ea(serialized); d8782 1 a8782 1 A monomorphic instance of libcrux_ml_kem.polynomial.ZERO d8787 16 a8802 7 static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_polynomial_ZERO_ea(void) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d lit; libcrux_ml_kem_vector_portable_vector_type_PortableVector repeat_expression[16U]; for (size_t i = (size_t)0U; i < (size_t)16U; i++) { repeat_expression[i] = libcrux_ml_kem_vector_portable_ZERO_b8(); d8804 13 a8816 4 memcpy(lit.coefficients, repeat_expression, (size_t)16U * sizeof(libcrux_ml_kem_vector_portable_vector_type_PortableVector)); return lit; d8847 5 a8851 1 A monomorphic instance of libcrux_ml_kem.polynomial.ntt_multiply d8856 6 a8861 6 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_polynomial_ntt_multiply_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *myself, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *rhs) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d out = libcrux_ml_kem_polynomial_ZERO_ea(); d8866 13 a8878 9 libcrux_ml_kem_vector_portable_ntt_multiply_b8( &myself->coefficients[i0], &rhs->coefficients[i0], libcrux_ml_kem_polynomial_zeta((size_t)64U + (size_t)4U * i0), libcrux_ml_kem_polynomial_zeta((size_t)64U + (size_t)4U * i0 + (size_t)1U), libcrux_ml_kem_polynomial_zeta((size_t)64U + (size_t)4U * i0 + (size_t)2U), libcrux_ml_kem_polynomial_zeta((size_t)64U + (size_t)4U * i0 + (size_t)3U)); d8885 2 a8886 3 This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]} d8889 2 a8890 15 A monomorphic instance of libcrux_ml_kem.polynomial.ntt_multiply_d6 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_polynomial_ntt_multiply_d6_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *self, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *rhs) { return libcrux_ml_kem_polynomial_ntt_multiply_ea(self, rhs); } /** Given two polynomial ring elements `lhs` and `rhs`, compute the pointwise sum of their constituent coefficients. d8893 1 a8893 1 A monomorphic instance of libcrux_ml_kem.polynomial.add_to_ring_element d8898 3 a8900 3 static KRML_MUSTINLINE void libcrux_ml_kem_polynomial_add_to_ring_element_1b( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *myself, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *rhs) { d8904 1 a8904 1 (size_t)16U, myself->coefficients, d8910 1 a8910 1 libcrux_ml_kem_vector_portable_add_b8(myself->coefficients[i0], d8912 1 a8912 1 myself->coefficients[i0] = uu____0; a8916 17 This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.add_to_ring_element_d6 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_polynomial_add_to_ring_element_d6_1b( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *self, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *rhs) { libcrux_ml_kem_polynomial_add_to_ring_element_1b(self, rhs); } /** d8922 3 a8924 2 static KRML_MUSTINLINE void libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_1_ea( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re) { d8929 9 a8937 5 libcrux_ml_kem_vector_portable_inv_ntt_layer_1_step_b8( re->coefficients[round], libcrux_ml_kem_polynomial_zeta(zeta_i[0U]), libcrux_ml_kem_polynomial_zeta(zeta_i[0U] - (size_t)1U), libcrux_ml_kem_polynomial_zeta(zeta_i[0U] - (size_t)2U), libcrux_ml_kem_polynomial_zeta(zeta_i[0U] - (size_t)3U)); d8948 3 a8950 2 static KRML_MUSTINLINE void libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_2_ea( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re) { d8955 5 a8959 3 libcrux_ml_kem_vector_portable_inv_ntt_layer_2_step_b8( re->coefficients[round], libcrux_ml_kem_polynomial_zeta(zeta_i[0U]), libcrux_ml_kem_polynomial_zeta(zeta_i[0U] - (size_t)1U)); d8970 3 a8972 2 static KRML_MUSTINLINE void libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_3_ea( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re) { d8977 1 a8977 1 libcrux_ml_kem_vector_portable_inv_ntt_layer_3_step_b8( d8979 1 a8979 1 libcrux_ml_kem_polynomial_zeta(zeta_i[0U])); d8992 1 a8992 1 libcrux_ml_kem_invert_ntt_inv_ntt_layer_int_vec_step_reduce_ea( d8997 7 a9003 8 libcrux_ml_kem_vector_portable_sub_b8(b, &a); a = libcrux_ml_kem_vector_portable_barrett_reduce_b8( libcrux_ml_kem_vector_portable_add_b8(a, &b)); b = libcrux_ml_kem_vector_portable_montgomery_multiply_by_constant_b8( a_minus_b, zeta_r); return (KRML_CLITERAL( libcrux_ml_kem_vector_portable_vector_type_PortableVector_x2){.fst = a, .snd = b}); d9013 2 a9014 2 libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_4_plus_ea( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re, d9028 1 a9028 1 libcrux_ml_kem_invert_ntt_inv_ntt_layer_int_vec_step_reduce_ea( d9030 1 a9030 1 libcrux_ml_kem_polynomial_zeta(zeta_i[0U])); d9045 2 a9046 2 static KRML_MUSTINLINE void libcrux_ml_kem_invert_ntt_invert_ntt_montgomery_1b( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re) { d9049 4 a9052 4 libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_1_ea(&zeta_i, re); libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_2_ea(&zeta_i, re); libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_3_ea(&zeta_i, re); libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_4_plus_ea(&zeta_i, re, d9054 1 a9054 1 libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_4_plus_ea(&zeta_i, re, d9056 1 a9056 1 libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_4_plus_ea(&zeta_i, re, d9058 1 a9058 1 libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_4_plus_ea(&zeta_i, re, d9060 1 a9060 1 libcrux_ml_kem_polynomial_poly_barrett_reduce_d6_ea(re); d9064 5 a9068 1 A monomorphic instance of libcrux_ml_kem.polynomial.subtract_reduce d9073 4 a9076 4 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_polynomial_subtract_reduce_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *myself, libcrux_ml_kem_polynomial_PolynomialRingElement_1d b) { d9082 1 a9082 1 libcrux_ml_kem_vector_portable_montgomery_multiply_by_constant_b8( d9084 5 a9088 6 libcrux_ml_kem_vector_portable_vector_type_PortableVector diff = libcrux_ml_kem_vector_portable_sub_b8(myself->coefficients[i0], &coefficient_normal_form); libcrux_ml_kem_vector_portable_vector_type_PortableVector red = libcrux_ml_kem_vector_portable_barrett_reduce_b8(diff); b.coefficients[i0] = red; a9093 18 This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.subtract_reduce_d6 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_polynomial_subtract_reduce_d6_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *self, libcrux_ml_kem_polynomial_PolynomialRingElement_1d b) { return libcrux_ml_kem_polynomial_subtract_reduce_ea(self, b); } /** d9105 7 a9111 7 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_matrix_compute_message_1b( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *v, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *secret_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *u_as_ntt) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d result = libcrux_ml_kem_polynomial_ZERO_d6_ea(); d9114 2 a9115 2 libcrux_ml_kem_polynomial_PolynomialRingElement_1d product = libcrux_ml_kem_polynomial_ntt_multiply_d6_ea(&secret_as_ntt[i0], d9117 19 a9135 1 libcrux_ml_kem_polynomial_add_to_ring_element_d6_1b(&result, &product); d9137 1 a9137 2 libcrux_ml_kem_invert_ntt_invert_ntt_montgomery_1b(&result); return libcrux_ml_kem_polynomial_subtract_reduce_d6_ea(v, result); d9141 5 a9145 2 A monomorphic instance of libcrux_ml_kem.serialize.to_unsigned_field_modulus with types libcrux_ml_kem_vector_portable_vector_type_PortableVector d9147 12 d9161 2 a9162 2 static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_serialize_to_unsigned_field_modulus_ea( d9164 6 a9169 1 return libcrux_ml_kem_vector_portable_to_unsigned_representative_b8(a); d9179 2 a9180 2 libcrux_ml_kem_serialize_compress_then_serialize_message_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d re, uint8_t ret[32U]) { d9185 1 a9185 1 libcrux_ml_kem_serialize_to_unsigned_field_modulus_ea( d9189 1 a9189 1 libcrux_ml_kem_vector_portable_compress_1_b8(coefficient); d9191 1 a9191 1 libcrux_ml_kem_vector_portable_serialize_1_b8(coefficient_compressed, d9193 2 d9196 1 a9196 3 Eurydice_array_to_subslice3(serialized, (size_t)2U * i0, (size_t)2U * i0 + (size_t)2U, uint8_t *), Eurydice_array_to_slice((size_t)2U, bytes, uint8_t), uint8_t); d9235 2 a9236 2 static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_decrypt_unpacked_42( libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_a0 *secret_key, d9238 4 a9241 4 libcrux_ml_kem_polynomial_PolynomialRingElement_1d u_as_ntt[3U]; libcrux_ml_kem_ind_cpa_deserialize_then_decompress_u_6c(ciphertext, u_as_ntt); libcrux_ml_kem_polynomial_PolynomialRingElement_1d v = libcrux_ml_kem_serialize_deserialize_then_decompress_ring_element_v_89( d9243 3 a9245 4 (size_t)960U, uint8_t, size_t, uint8_t[])); libcrux_ml_kem_polynomial_PolynomialRingElement_1d message = libcrux_ml_kem_matrix_compute_message_1b(&v, secret_key->secret_as_ntt, d9248 1 a9248 1 libcrux_ml_kem_serialize_compress_then_serialize_message_ea(message, ret0); d9262 11 a9272 3 static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_decrypt_42( Eurydice_slice secret_key, uint8_t *ciphertext, uint8_t ret[32U]) { libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_a0 a9273 6 libcrux_ml_kem_polynomial_PolynomialRingElement_1d ret0[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { /* original Rust expression is not an lvalue in C */ void *lvalue = (void *)0U; ret0[i] = libcrux_ml_kem_ind_cpa_decrypt_call_mut_0b_42(&lvalue, i); } d9275 6 a9280 8 secret_key_unpacked.secret_as_ntt, ret0, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); libcrux_ml_kem_ind_cpa_deserialize_vector_1b( secret_key, secret_key_unpacked.secret_as_ntt); uint8_t ret1[32U]; libcrux_ml_kem_ind_cpa_decrypt_unpacked_42(&secret_key_unpacked, ciphertext, ret1); memcpy(ret, ret1, (size_t)32U * sizeof(uint8_t)); d9284 2 a9285 2 This function found in impl {libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash} d9288 1 a9288 1 A monomorphic instance of libcrux_ml_kem.hash_functions.portable.G_4a d9292 1 a9292 1 static inline void libcrux_ml_kem_hash_functions_portable_G_4a_e0( d9302 1 a9302 1 static inline void libcrux_ml_kem_hash_functions_portable_PRF_9e( d9311 2 a9312 2 This function found in impl {libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash} d9315 1 a9315 1 A monomorphic instance of libcrux_ml_kem.hash_functions.portable.PRF_4a d9320 1 a9320 1 static inline void libcrux_ml_kem_hash_functions_portable_PRF_4a_41( d9322 1 a9322 1 libcrux_ml_kem_hash_functions_portable_PRF_9e(input, ret); d9327 1 a9327 1 libcrux_ml_kem.ind_cpa.unpacked.IndCpaPublicKeyUnpacked with types d9329 1 a9329 17 - $3size_t */ typedef struct libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0_s { libcrux_ml_kem_polynomial_PolynomialRingElement_1d t_as_ntt[3U]; uint8_t seed_for_A[32U]; libcrux_ml_kem_polynomial_PolynomialRingElement_1d A[3U][3U]; } libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0; /** This function found in impl {core::default::Default for libcrux_ml_kem::ind_cpa::unpacked::IndCpaPublicKeyUnpacked[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.unpacked.default_8b with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics d9332 4 a9335 26 static inline libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 libcrux_ml_kem_ind_cpa_unpacked_default_8b_1b(void) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d uu____0[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { uu____0[i] = libcrux_ml_kem_polynomial_ZERO_d6_ea(); } uint8_t uu____1[32U] = {0U}; libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 lit; memcpy( lit.t_as_ntt, uu____0, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); memcpy(lit.seed_for_A, uu____1, (size_t)32U * sizeof(uint8_t)); libcrux_ml_kem_polynomial_PolynomialRingElement_1d repeat_expression0[3U][3U]; for (size_t i0 = (size_t)0U; i0 < (size_t)3U; i0++) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d repeat_expression[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { repeat_expression[i] = libcrux_ml_kem_polynomial_ZERO_d6_ea(); } memcpy(repeat_expression0[i0], repeat_expression, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); } memcpy(lit.A, repeat_expression0, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U])); return lit; d9350 2 a9351 2 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_serialize_deserialize_to_reduced_ring_element_ea( d9353 2 a9354 2 libcrux_ml_kem_polynomial_PolynomialRingElement_1d re = libcrux_ml_kem_polynomial_ZERO_d6_ea(); d9358 2 a9359 3 Eurydice_slice bytes = Eurydice_slice_subslice3(serialized, i0 * (size_t)24U, i0 * (size_t)24U + (size_t)24U, uint8_t *); d9361 1 a9361 1 libcrux_ml_kem_vector_portable_deserialize_12_b8(bytes); d9363 1 a9363 1 libcrux_ml_kem_vector_portable_cond_subtract_3329_b8(coefficient); d9370 4 a9373 1 See [deserialize_ring_elements_reduced_out]. d9379 1 d9383 1 a9383 1 libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_1b( d9385 5 a9389 1 libcrux_ml_kem_polynomial_PolynomialRingElement_1d *deserialized_pk) { d9395 1 a9395 1 Eurydice_slice ring_element = Eurydice_slice_subslice3( d9399 3 a9401 3 uint8_t *); libcrux_ml_kem_polynomial_PolynomialRingElement_1d uu____0 = libcrux_ml_kem_serialize_deserialize_to_reduced_ring_element_ea( d9405 29 d9441 3 a9443 3 typedef struct libcrux_ml_kem_hash_functions_portable_PortableHash_88_s { libcrux_sha3_generic_keccak_KeccakState_17 shake128_state[3U]; } libcrux_ml_kem_hash_functions_portable_PortableHash_88; d9447 1 a9447 2 libcrux_ml_kem.hash_functions.portable.shake128_init_absorb_final with const generics d9450 4 a9453 5 static inline libcrux_ml_kem_hash_functions_portable_PortableHash_88 libcrux_ml_kem_hash_functions_portable_shake128_init_absorb_final_e0( uint8_t (*input)[34U]) { libcrux_ml_kem_hash_functions_portable_PortableHash_88 shake128_state; libcrux_sha3_generic_keccak_KeccakState_17 repeat_expression[3U]; d9455 1 a9455 1 repeat_expression[i] = libcrux_sha3_portable_incremental_shake128_init(); a9456 2 memcpy(shake128_state.shake128_state, repeat_expression, (size_t)3U * sizeof(libcrux_sha3_generic_keccak_KeccakState_17)); d9460 1 a9460 1 &shake128_state.shake128_state[i0], d9463 8 a9470 1 return shake128_state; d9474 2 a9475 2 This function found in impl {libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash} d9479 1 a9479 1 libcrux_ml_kem.hash_functions.portable.shake128_init_absorb_final_4a with const d9483 8 a9490 5 static inline libcrux_ml_kem_hash_functions_portable_PortableHash_88 libcrux_ml_kem_hash_functions_portable_shake128_init_absorb_final_4a_e0( uint8_t (*input)[34U]) { return libcrux_ml_kem_hash_functions_portable_shake128_init_absorb_final_e0( input); d9495 2 a9496 2 libcrux_ml_kem.hash_functions.portable.shake128_squeeze_first_three_blocks with const generics d9499 3 a9501 3 static inline void libcrux_ml_kem_hash_functions_portable_shake128_squeeze_first_three_blocks_e0( libcrux_ml_kem_hash_functions_portable_PortableHash_88 *st, d9514 2 a9515 2 This function found in impl {libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash} d9519 2 a9520 2 libcrux_ml_kem.hash_functions.portable.shake128_squeeze_first_three_blocks_4a with const generics d9523 3 a9525 3 static inline void libcrux_ml_kem_hash_functions_portable_shake128_squeeze_first_three_blocks_4a_e0( libcrux_ml_kem_hash_functions_portable_PortableHash_88 *self, d9527 2 a9528 2 libcrux_ml_kem_hash_functions_portable_shake128_squeeze_first_three_blocks_e0( self, ret); d9580 2 a9581 2 libcrux_ml_kem_sampling_sample_from_uniform_distribution_next_89( uint8_t (*randomness)[504U], size_t *sampled_coefficients, d9589 9 a9597 9 size_t sampled = libcrux_ml_kem_vector_portable_rej_sample_b8( Eurydice_array_to_subslice3(randomness[i1], r * (size_t)24U, r * (size_t)24U + (size_t)24U, uint8_t *), Eurydice_array_to_subslice3(out[i1], sampled_coefficients[i1], sampled_coefficients[i1] + (size_t)16U, int16_t *)); size_t uu____0 = i1; sampled_coefficients[uu____0] = sampled_coefficients[uu____0] + sampled; d9617 1 a9617 1 libcrux_ml_kem.hash_functions.portable.shake128_squeeze_next_block with const d9621 3 a9623 3 static inline void libcrux_ml_kem_hash_functions_portable_shake128_squeeze_next_block_e0( libcrux_ml_kem_hash_functions_portable_PortableHash_88 *st, d9636 2 a9637 2 This function found in impl {libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash} d9641 1 a9641 1 libcrux_ml_kem.hash_functions.portable.shake128_squeeze_next_block_4a with const d9645 3 a9647 3 static inline void libcrux_ml_kem_hash_functions_portable_shake128_squeeze_next_block_4a_e0( libcrux_ml_kem_hash_functions_portable_PortableHash_88 *self, d9649 1 a9649 2 libcrux_ml_kem_hash_functions_portable_shake128_squeeze_next_block_e0(self, ret); d9701 2 a9702 2 libcrux_ml_kem_sampling_sample_from_uniform_distribution_next_890( uint8_t (*randomness)[168U], size_t *sampled_coefficients, d9710 9 a9718 9 size_t sampled = libcrux_ml_kem_vector_portable_rej_sample_b8( Eurydice_array_to_subslice3(randomness[i1], r * (size_t)24U, r * (size_t)24U + (size_t)24U, uint8_t *), Eurydice_array_to_subslice3(out[i1], sampled_coefficients[i1], sampled_coefficients[i1] + (size_t)16U, int16_t *)); size_t uu____0 = i1; sampled_coefficients[uu____0] = sampled_coefficients[uu____0] + sampled; d9737 5 a9741 1 A monomorphic instance of libcrux_ml_kem.polynomial.from_i16_array d9746 4 a9749 4 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_polynomial_from_i16_array_ea(Eurydice_slice a) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d result = libcrux_ml_kem_polynomial_ZERO_ea(); d9754 3 a9756 4 libcrux_ml_kem_vector_portable_from_i16_array_b8( Eurydice_slice_subslice3(a, i0 * (size_t)16U, (i0 + (size_t)1U) * (size_t)16U, int16_t *)); d9763 5 a9767 3 This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]} d9769 6 a9774 33 /** A monomorphic instance of libcrux_ml_kem.polynomial.from_i16_array_d6 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_polynomial_from_i16_array_d6_ea(Eurydice_slice a) { return libcrux_ml_kem_polynomial_from_i16_array_ea(a); } /** This function found in impl {core::ops::function::FnMut<(@@Array), libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@2]> for libcrux_ml_kem::sampling::sample_from_xof::closure[TraitClause@@0, TraitClause@@1, TraitClause@@2, TraitClause@@3]} */ /** A monomorphic instance of libcrux_ml_kem.sampling.sample_from_xof.call_mut_e7 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 */ static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_sampling_sample_from_xof_call_mut_e7_2b( void **_, int16_t tupled_args[272U]) { int16_t s[272U]; memcpy(s, tupled_args, (size_t)272U * sizeof(int16_t)); return libcrux_ml_kem_polynomial_from_i16_array_d6_ea( Eurydice_array_to_subslice3(s, (size_t)0U, (size_t)256U, int16_t *)); } d9782 3 a9784 3 static KRML_MUSTINLINE void libcrux_ml_kem_sampling_sample_from_xof_2b( uint8_t (*seeds)[34U], libcrux_ml_kem_polynomial_PolynomialRingElement_1d ret[3U]) { d9787 6 a9792 3 libcrux_ml_kem_hash_functions_portable_PortableHash_88 xof_state = libcrux_ml_kem_hash_functions_portable_shake128_init_absorb_final_4a_e0( seeds); d9794 1 a9794 1 libcrux_ml_kem_hash_functions_portable_shake128_squeeze_first_three_blocks_4a_e0( d9796 5 a9800 2 bool done = libcrux_ml_kem_sampling_sample_from_uniform_distribution_next_89( randomness0, sampled_coefficients, out); d9806 1 a9806 1 libcrux_ml_kem_hash_functions_portable_shake128_squeeze_next_block_4a_e0( d9808 6 a9813 2 done = libcrux_ml_kem_sampling_sample_from_uniform_distribution_next_890( randomness, sampled_coefficients, out); d9819 1 a9819 1 libcrux_ml_kem_polynomial_PolynomialRingElement_1d ret0[3U]; d9821 2 a9822 4 /* original Rust expression is not an lvalue in C */ void *lvalue = (void *)0U; ret0[i] = libcrux_ml_kem_sampling_sample_from_xof_call_mut_e7_2b( &lvalue, copy_of_out[i]); d9826 1 a9826 1 (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); d9836 7 a9842 3 static KRML_MUSTINLINE void libcrux_ml_kem_matrix_sample_matrix_A_2b( libcrux_ml_kem_polynomial_PolynomialRingElement_1d (*A_transpose)[3U], uint8_t *seed, bool transpose) { d9845 3 d9850 1 a9850 2 core_array__core__clone__Clone_for__Array_T__N___clone( (size_t)34U, seed, seeds[i], uint8_t, void *); d9857 5 a9861 2 libcrux_ml_kem_polynomial_PolynomialRingElement_1d sampled[3U]; libcrux_ml_kem_sampling_sample_from_xof_2b(seeds, sampled); d9866 2 a9867 2 libcrux_ml_kem_polynomial_PolynomialRingElement_1d), libcrux_ml_kem_polynomial_PolynomialRingElement_1d); d9870 1 a9870 1 libcrux_ml_kem_polynomial_PolynomialRingElement_1d sample = sampled[j]; d9878 3 a9880 45 } /** A monomorphic instance of libcrux_ml_kem.ind_cpa.build_unpacked_public_key_mut with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - T_AS_NTT_ENCODED_SIZE= 1152 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_build_unpacked_public_key_mut_3f( Eurydice_slice public_key, libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 *unpacked_public_key) { Eurydice_slice uu____0 = Eurydice_slice_subslice_to( public_key, (size_t)1152U, uint8_t, size_t, uint8_t[]); libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_1b( uu____0, unpacked_public_key->t_as_ntt); Eurydice_slice seed = Eurydice_slice_subslice_from( public_key, (size_t)1152U, uint8_t, size_t, uint8_t[]); libcrux_ml_kem_polynomial_PolynomialRingElement_1d(*uu____1)[3U] = unpacked_public_key->A; uint8_t ret[34U]; libcrux_ml_kem_utils_into_padded_array_b6(seed, ret); libcrux_ml_kem_matrix_sample_matrix_A_2b(uu____1, ret, false); } /** A monomorphic instance of libcrux_ml_kem.ind_cpa.build_unpacked_public_key with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - T_AS_NTT_ENCODED_SIZE= 1152 */ static KRML_MUSTINLINE libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 libcrux_ml_kem_ind_cpa_build_unpacked_public_key_3f( Eurydice_slice public_key) { libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 unpacked_public_key = libcrux_ml_kem_ind_cpa_unpacked_default_8b_1b(); libcrux_ml_kem_ind_cpa_build_unpacked_public_key_mut_3f(public_key, &unpacked_public_key); return unpacked_public_key; d9886 1 a9886 3 libcrux_ml_kem_vector_portable_vector_type_PortableVector[3size_t], libcrux_ml_kem_polynomial_PolynomialRingElement libcrux_ml_kem_vector_portable_vector_type_PortableVector d9889 4 a9892 4 typedef struct tuple_ed_s { libcrux_ml_kem_polynomial_PolynomialRingElement_1d fst[3U]; libcrux_ml_kem_polynomial_PolynomialRingElement_1d snd; } tuple_ed; d9895 3 a9897 10 This function found in impl {core::ops::function::FnMut<(usize), libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@2]> for libcrux_ml_kem::ind_cpa::encrypt_c1::closure[TraitClause@@0, TraitClause@@1, TraitClause@@2, TraitClause@@3]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.encrypt_c1.call_mut_f1 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, d9901 2 a9902 7 - C1_LEN= 960 - U_COMPRESSION_FACTOR= 10 - BLOCK_LEN= 320 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 - ETA2= 2 - ETA2_RANDOMNESS_SIZE= 128 d9904 3 a9906 3 static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_ind_cpa_encrypt_c1_call_mut_f1_85(void **_, size_t tupled_args) { return libcrux_ml_kem_polynomial_ZERO_d6_ea(); d9915 1 a9915 1 static inline void libcrux_ml_kem_hash_functions_portable_PRFxN_41( d9928 2 a9929 2 This function found in impl {libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash} d9932 1 a9932 1 A monomorphic instance of libcrux_ml_kem.hash_functions.portable.PRFxN_4a d9937 1 a9937 1 static inline void libcrux_ml_kem_hash_functions_portable_PRFxN_4a_41( d9939 1 a9939 1 libcrux_ml_kem_hash_functions_portable_PRFxN_41(input, ret); d9997 2 a9998 2 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_sampling_sample_from_binomial_distribution_2_ea( d10004 1 a10004 1 Eurydice_slice byte_chunk = Eurydice_slice_subslice3( d10006 1 a10006 1 chunk_number * (size_t)4U + (size_t)4U, uint8_t *); d10022 1 a10022 1 for (uint32_t i = 0U; i < 32U / 4U; i++) { d10033 46 a10078 1 return libcrux_ml_kem_polynomial_from_i16_array_d6_ea( d10088 2 a10089 2 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_sampling_sample_from_binomial_distribution_a0( d10091 1 a10091 1 return libcrux_ml_kem_sampling_sample_from_binomial_distribution_2_ea( d10101 2 a10102 2 static KRML_MUSTINLINE void libcrux_ml_kem_ntt_ntt_at_layer_7_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re) { d10107 1 a10107 1 libcrux_ml_kem_vector_portable_multiply_by_constant_b8( d10110 1 a10110 1 libcrux_ml_kem_vector_portable_sub_b8(re->coefficients[j], &t); d10112 1 a10112 1 libcrux_ml_kem_vector_portable_add_b8(re->coefficients[j], &t); d10124 3 a10126 3 libcrux_ml_kem_ntt_ntt_binomially_sampled_ring_element_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re) { libcrux_ml_kem_ntt_ntt_at_layer_7_ea(re); d10128 10 a10137 13 libcrux_ml_kem_ntt_ntt_at_layer_4_plus_ea(&zeta_i, re, (size_t)6U, (size_t)11207U); libcrux_ml_kem_ntt_ntt_at_layer_4_plus_ea(&zeta_i, re, (size_t)5U, (size_t)11207U + (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_4_plus_ea( &zeta_i, re, (size_t)4U, (size_t)11207U + (size_t)2U * (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_3_ea( &zeta_i, re, (size_t)11207U + (size_t)3U * (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_2_ea( &zeta_i, re, (size_t)11207U + (size_t)4U * (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_1_ea( &zeta_i, re, (size_t)11207U + (size_t)5U * (size_t)3328U); libcrux_ml_kem_polynomial_poly_barrett_reduce_d6_ea(re); d10153 10 a10162 4 static KRML_MUSTINLINE uint8_t libcrux_ml_kem_ind_cpa_sample_vector_cbd_then_ntt_3b( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re_as_ntt, uint8_t *prf_input, uint8_t domain_separator) { d10165 6 a10170 2 core_array__core__clone__Clone_for__Array_T__N___clone( (size_t)33U, prf_input, prf_inputs[i], uint8_t, void *); a10171 2 domain_separator = libcrux_ml_kem_utils_prf_input_inc_e0(prf_inputs, domain_separator); d10173 1 a10173 1 libcrux_ml_kem_hash_functions_portable_PRFxN_4a_41(prf_inputs, prf_outputs); d10177 1 a10177 1 libcrux_ml_kem_sampling_sample_from_binomial_distribution_a0( d10179 1 a10179 1 libcrux_ml_kem_ntt_ntt_binomially_sampled_ring_element_ea(&re_as_ntt[i0]); d10181 11 a10191 1 return domain_separator; d10195 1 a10195 9 This function found in impl {core::ops::function::FnMut<(usize), libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@2]> for libcrux_ml_kem::ind_cpa::encrypt_c1::closure#1[TraitClause@@0, TraitClause@@1, TraitClause@@2, TraitClause@@3]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.encrypt_c1.call_mut_dd d10200 1 a10200 5 - C1_LEN= 960 - U_COMPRESSION_FACTOR= 10 - BLOCK_LEN= 320 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 a10201 1 - ETA2_RANDOMNESS_SIZE= 128 d10203 3 a10205 3 static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_ind_cpa_encrypt_c1_call_mut_dd_85(void **_, size_t tupled_args) { return libcrux_ml_kem_polynomial_ZERO_d6_ea(); d10220 10 a10229 4 static KRML_MUSTINLINE uint8_t libcrux_ml_kem_ind_cpa_sample_ring_element_cbd_3b( uint8_t *prf_input, uint8_t domain_separator, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *error_1) { d10232 6 a10237 2 core_array__core__clone__Clone_for__Array_T__N___clone( (size_t)33U, prf_input, prf_inputs[i], uint8_t, void *); a10238 2 domain_separator = libcrux_ml_kem_utils_prf_input_inc_e0(prf_inputs, domain_separator); d10240 1 a10240 1 libcrux_ml_kem_hash_functions_portable_PRFxN_4a_41(prf_inputs, prf_outputs); d10243 2 a10244 2 libcrux_ml_kem_polynomial_PolynomialRingElement_1d uu____0 = libcrux_ml_kem_sampling_sample_from_binomial_distribution_a0( d10246 1 a10246 1 error_1[i0] = uu____0; d10248 11 a10258 1 return domain_separator; d10266 1 a10266 1 static inline void libcrux_ml_kem_hash_functions_portable_PRF_a6( d10275 2 a10276 2 This function found in impl {libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash} d10279 1 a10279 1 A monomorphic instance of libcrux_ml_kem.hash_functions.portable.PRF_4a d10284 1 a10284 1 static inline void libcrux_ml_kem_hash_functions_portable_PRF_4a_410( d10286 1 a10286 1 libcrux_ml_kem_hash_functions_portable_PRF_a6(input, ret); d10290 1 a10290 7 This function found in impl {core::ops::function::FnMut<(usize), libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]> for libcrux_ml_kem::matrix::compute_vector_u::closure[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.matrix.compute_vector_u.call_mut_a8 d10295 3 a10297 4 static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_matrix_compute_vector_u_call_mut_a8_1b(void **_, size_t tupled_args) { return libcrux_ml_kem_polynomial_ZERO_d6_ea(); d10301 5 a10305 1 A monomorphic instance of libcrux_ml_kem.polynomial.add_error_reduce d10310 3 a10312 3 static KRML_MUSTINLINE void libcrux_ml_kem_polynomial_add_error_reduce_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *myself, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *error) { d10318 7 a10324 8 libcrux_ml_kem_vector_portable_montgomery_multiply_by_constant_b8( myself->coefficients[j], (int16_t)1441); libcrux_ml_kem_vector_portable_vector_type_PortableVector sum = libcrux_ml_kem_vector_portable_add_b8(coefficient_normal_form, &error->coefficients[j]); libcrux_ml_kem_vector_portable_vector_type_PortableVector red = libcrux_ml_kem_vector_portable_barrett_reduce_b8(sum); myself->coefficients[j] = red; a10328 17 This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.add_error_reduce_d6 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_polynomial_add_error_reduce_d6_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *self, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *error) { libcrux_ml_kem_polynomial_add_error_reduce_ea(self, error); } /** d10337 6 a10342 6 static KRML_MUSTINLINE void libcrux_ml_kem_matrix_compute_vector_u_1b( libcrux_ml_kem_polynomial_PolynomialRingElement_1d (*a_as_ntt)[3U], libcrux_ml_kem_polynomial_PolynomialRingElement_1d *r_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *error_1, libcrux_ml_kem_polynomial_PolynomialRingElement_1d ret[3U]) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d result[3U]; d10344 1 a10344 4 /* original Rust expression is not an lvalue in C */ void *lvalue = (void *)0U; result[i] = libcrux_ml_kem_matrix_compute_vector_u_call_mut_a8_1b(&lvalue, i); d10350 2 a10351 2 libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U]), libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U]); d10354 1 a10354 1 libcrux_ml_kem_polynomial_PolynomialRingElement_1d *row = a_as_ntt[i1]; d10359 2 a10360 2 libcrux_ml_kem_polynomial_PolynomialRingElement_1d), libcrux_ml_kem_polynomial_PolynomialRingElement_1d); d10363 4 a10366 4 libcrux_ml_kem_polynomial_PolynomialRingElement_1d *a_element = &row[j]; libcrux_ml_kem_polynomial_PolynomialRingElement_1d product = libcrux_ml_kem_polynomial_ntt_multiply_d6_ea(a_element, &r_as_ntt[j]); libcrux_ml_kem_polynomial_add_to_ring_element_d6_1b(&result[i1], d10369 2 a10370 2 libcrux_ml_kem_invert_ntt_invert_ntt_montgomery_1b(&result[i1]); libcrux_ml_kem_polynomial_add_error_reduce_d6_ea(&result[i1], &error_1[i1]); d10374 106 a10479 1 (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); d10488 2 a10489 2 libcrux_ml_kem_vector_portable_compress_compress_ef( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { d10493 1 a10493 1 int16_t uu____0 = libcrux_secrets_int_as_i16_f5( d10495 2 a10496 3 (uint8_t)(int32_t)10, libcrux_secrets_int_as_u16_f5(a.elements[i0]))); a.elements[i0] = uu____0; d10498 1 a10498 1 return a; d10502 2 a10503 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d10506 1 a10506 1 A monomorphic instance of libcrux_ml_kem.vector.portable.compress_b8 d10511 3 a10513 3 libcrux_ml_kem_vector_portable_compress_b8_ef( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { return libcrux_ml_kem_vector_portable_compress_compress_ef(a); d10523 2 a10524 2 libcrux_ml_kem_serialize_compress_then_serialize_10_ff( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re, uint8_t ret[320U]) { d10530 2 a10531 2 libcrux_ml_kem_vector_portable_compress_b8_ef( libcrux_ml_kem_serialize_to_unsigned_field_modulus_ea( d10534 64 a10597 1 libcrux_ml_kem_vector_portable_serialize_10_b8(coefficient, bytes); d10599 1 a10599 3 Eurydice_array_to_subslice3(serialized, (size_t)20U * i0, (size_t)20U * i0 + (size_t)20U, uint8_t *), Eurydice_array_to_slice((size_t)20U, bytes, uint8_t), uint8_t); d10612 2 a10613 2 libcrux_ml_kem_serialize_compress_then_serialize_ring_element_u_fe( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re, uint8_t ret[320U]) { d10615 1 a10615 1 libcrux_ml_kem_serialize_compress_then_serialize_10_ff(re, uu____0); d10631 2 a10632 2 static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_compress_then_serialize_u_43( libcrux_ml_kem_polynomial_PolynomialRingElement_1d input[3U], d10638 2 a10639 2 libcrux_ml_kem_polynomial_PolynomialRingElement_1d), libcrux_ml_kem_polynomial_PolynomialRingElement_1d); d10642 2 a10643 2 libcrux_ml_kem_polynomial_PolynomialRingElement_1d re = input[i0]; Eurydice_slice uu____0 = Eurydice_slice_subslice3( d10645 1 a10645 1 (i0 + (size_t)1U) * ((size_t)960U / (size_t)3U), uint8_t *); d10647 1 a10647 1 libcrux_ml_kem_serialize_compress_then_serialize_ring_element_u_fe(&re, d10655 3 a10657 12 A monomorphic instance of libcrux_ml_kem.ind_cpa.encrypt_c1 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - C1_LEN= 960 - U_COMPRESSION_FACTOR= 10 - BLOCK_LEN= 320 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 - ETA2= 2 - ETA2_RANDOMNESS_SIZE= 128 d10659 10 a10668 20 static KRML_MUSTINLINE tuple_ed libcrux_ml_kem_ind_cpa_encrypt_c1_85( Eurydice_slice randomness, libcrux_ml_kem_polynomial_PolynomialRingElement_1d (*matrix)[3U], Eurydice_slice ciphertext) { uint8_t prf_input[33U]; libcrux_ml_kem_utils_into_padded_array_c8(randomness, prf_input); libcrux_ml_kem_polynomial_PolynomialRingElement_1d r_as_ntt[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { /* original Rust expression is not an lvalue in C */ void *lvalue = (void *)0U; r_as_ntt[i] = libcrux_ml_kem_ind_cpa_encrypt_c1_call_mut_f1_85(&lvalue, i); } uint8_t domain_separator0 = libcrux_ml_kem_ind_cpa_sample_vector_cbd_then_ntt_3b(r_as_ntt, prf_input, 0U); libcrux_ml_kem_polynomial_PolynomialRingElement_1d error_1[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { /* original Rust expression is not an lvalue in C */ void *lvalue = (void *)0U; error_1[i] = libcrux_ml_kem_ind_cpa_encrypt_c1_call_mut_dd_85(&lvalue, i); d10670 2 a10671 28 uint8_t domain_separator = libcrux_ml_kem_ind_cpa_sample_ring_element_cbd_3b( prf_input, domain_separator0, error_1); prf_input[32U] = domain_separator; uint8_t prf_output[128U]; libcrux_ml_kem_hash_functions_portable_PRF_4a_410( Eurydice_array_to_slice((size_t)33U, prf_input, uint8_t), prf_output); libcrux_ml_kem_polynomial_PolynomialRingElement_1d error_2 = libcrux_ml_kem_sampling_sample_from_binomial_distribution_a0( Eurydice_array_to_slice((size_t)128U, prf_output, uint8_t)); libcrux_ml_kem_polynomial_PolynomialRingElement_1d u[3U]; libcrux_ml_kem_matrix_compute_vector_u_1b(matrix, r_as_ntt, error_1, u); libcrux_ml_kem_polynomial_PolynomialRingElement_1d uu____0[3U]; memcpy( uu____0, u, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); libcrux_ml_kem_ind_cpa_compress_then_serialize_u_43(uu____0, ciphertext); /* Passing arrays by value in Rust generates a copy in C */ libcrux_ml_kem_polynomial_PolynomialRingElement_1d copy_of_r_as_ntt[3U]; memcpy( copy_of_r_as_ntt, r_as_ntt, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); tuple_ed lit; memcpy( lit.fst, copy_of_r_as_ntt, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); lit.snd = error_2; return lit; } d10674 2 a10675 4 A monomorphic instance of libcrux_ml_kem.serialize.deserialize_then_decompress_message with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics a10676 20 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_serialize_deserialize_then_decompress_message_ea( uint8_t *serialized) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d re = libcrux_ml_kem_polynomial_ZERO_d6_ea(); for (size_t i = (size_t)0U; i < (size_t)16U; i++) { size_t i0 = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient_compressed = libcrux_ml_kem_vector_portable_deserialize_1_b8( Eurydice_array_to_subslice3(serialized, (size_t)2U * i0, (size_t)2U * i0 + (size_t)2U, uint8_t *)); libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_decompress_1_b8(coefficient_compressed); re.coefficients[i0] = uu____0; } return re; } d10678 1 a10678 2 A monomorphic instance of libcrux_ml_kem.polynomial.add_message_error_reduce with types libcrux_ml_kem_vector_portable_vector_type_PortableVector d10680 1 a10680 1 d10682 4 a10685 22 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_polynomial_add_message_error_reduce_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *myself, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *message, libcrux_ml_kem_polynomial_PolynomialRingElement_1d result) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT; i++) { size_t i0 = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient_normal_form = libcrux_ml_kem_vector_portable_montgomery_multiply_by_constant_b8( result.coefficients[i0], (int16_t)1441); libcrux_ml_kem_vector_portable_vector_type_PortableVector sum1 = libcrux_ml_kem_vector_portable_add_b8(myself->coefficients[i0], &message->coefficients[i0]); libcrux_ml_kem_vector_portable_vector_type_PortableVector sum2 = libcrux_ml_kem_vector_portable_add_b8(coefficient_normal_form, &sum1); libcrux_ml_kem_vector_portable_vector_type_PortableVector red = libcrux_ml_kem_vector_portable_barrett_reduce_b8(sum2); result.coefficients[i0] = red; } return result; d10689 1 a10689 6 This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.add_message_error_reduce_d6 d10694 6 a10699 27 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_polynomial_add_message_error_reduce_d6_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *self, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *message, libcrux_ml_kem_polynomial_PolynomialRingElement_1d result) { return libcrux_ml_kem_polynomial_add_message_error_reduce_ea(self, message, result); } /** Compute InverseNTT(tᵀ ◦ r̂) + e₂ + message */ /** A monomorphic instance of libcrux_ml_kem.matrix.compute_ring_element_v with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_matrix_compute_ring_element_v_1b( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *t_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *r_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *error_2, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *message) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d result = libcrux_ml_kem_polynomial_ZERO_d6_ea(); for (size_t i = (size_t)0U; i < (size_t)3U; i++) { d10701 10 a10710 4 libcrux_ml_kem_polynomial_PolynomialRingElement_1d product = libcrux_ml_kem_polynomial_ntt_multiply_d6_ea(&t_as_ntt[i0], &r_as_ntt[i0]); libcrux_ml_kem_polynomial_add_to_ring_element_d6_1b(&result, &product); a10711 3 libcrux_ml_kem_invert_ntt_invert_ntt_montgomery_1b(&result); return libcrux_ml_kem_polynomial_add_message_error_reduce_d6_ea( error_2, message, result); d10717 1 a10717 1 - COEFFICIENT_BITS= 4 d10720 2 a10721 2 libcrux_ml_kem_vector_portable_compress_compress_d1( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { d10725 1 a10725 1 int16_t uu____0 = libcrux_secrets_int_as_i16_f5( d10727 2 a10728 3 (uint8_t)(int32_t)4, libcrux_secrets_int_as_u16_f5(a.elements[i0]))); a.elements[i0] = uu____0; d10730 1 a10730 1 return a; d10734 2 a10735 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d10738 1 a10738 1 A monomorphic instance of libcrux_ml_kem.vector.portable.compress_b8 d10740 1 a10740 1 - COEFFICIENT_BITS= 4 d10743 3 a10745 3 libcrux_ml_kem_vector_portable_compress_b8_d1( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { return libcrux_ml_kem_vector_portable_compress_compress_d1(a); d10749 1 a10749 1 A monomorphic instance of libcrux_ml_kem.serialize.compress_then_serialize_4 d10755 2 a10756 2 libcrux_ml_kem_serialize_compress_then_serialize_4_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d re, d10761 3 a10763 3 libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient = libcrux_ml_kem_vector_portable_compress_b8_d1( libcrux_ml_kem_serialize_to_unsigned_field_modulus_ea( d10765 2 a10766 2 uint8_t bytes[8U]; libcrux_ml_kem_vector_portable_serialize_4_b8(coefficient, bytes); d10768 3 a10770 3 Eurydice_slice_subslice3(serialized, (size_t)8U * i0, (size_t)8U * i0 + (size_t)8U, uint8_t *), Eurydice_array_to_slice((size_t)8U, bytes, uint8_t), uint8_t); a10777 1 - K= 3 d10782 3 a10784 3 libcrux_ml_kem_serialize_compress_then_serialize_ring_element_v_6c( libcrux_ml_kem_polynomial_PolynomialRingElement_1d re, Eurydice_slice out) { libcrux_ml_kem_serialize_compress_then_serialize_4_ea(re, out); d10788 1 a10788 64 A monomorphic instance of libcrux_ml_kem.ind_cpa.encrypt_c2 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - V_COMPRESSION_FACTOR= 4 - C2_LEN= 128 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_encrypt_c2_6c( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *t_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *r_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *error_2, uint8_t *message, Eurydice_slice ciphertext) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d message_as_ring_element = libcrux_ml_kem_serialize_deserialize_then_decompress_message_ea(message); libcrux_ml_kem_polynomial_PolynomialRingElement_1d v = libcrux_ml_kem_matrix_compute_ring_element_v_1b( t_as_ntt, r_as_ntt, error_2, &message_as_ring_element); libcrux_ml_kem_serialize_compress_then_serialize_ring_element_v_6c( v, ciphertext); } /** This function implements Algorithm 13 of the NIST FIPS 203 specification; this is the Kyber CPA-PKE encryption algorithm. Algorithm 13 is reproduced below: ```plaintext Input: encryption key ekₚₖₑ ∈ 𝔹^{384k+32}. Input: message m ∈ 𝔹^{32}. Input: encryption randomness r ∈ 𝔹^{32}. Output: ciphertext c ∈ 𝔹^{32(dᵤk + dᵥ)}. N ← 0 t̂ ← ByteDecode₁₂(ekₚₖₑ[0:384k]) ρ ← ekₚₖₑ[384k: 384k + 32] for (i ← 0; i < k; i++) for(j ← 0; j < k; j++) Â[i,j] ← SampleNTT(XOF(ρ, i, j)) end for end for for(i ← 0; i < k; i++) r[i] ← SamplePolyCBD_{η₁}(PRF_{η₁}(r,N)) N ← N + 1 end for for(i ← 0; i < k; i++) e₁[i] ← SamplePolyCBD_{η₂}(PRF_{η₂}(r,N)) N ← N + 1 end for e₂ ← SamplePolyCBD_{η₂}(PRF_{η₂}(r,N)) r̂ ← NTT(r) u ← NTT-¹(Âᵀ ◦ r̂) + e₁ μ ← Decompress₁(ByteDecode₁(m))) v ← NTT-¹(t̂ᵀ ◦ rˆ) + e₂ + μ c₁ ← ByteEncode_{dᵤ}(Compress_{dᵤ}(u)) c₂ ← ByteEncode_{dᵥ}(Compress_{dᵥ}(v)) return c ← (c₁ ‖ c₂) ``` The NIST FIPS 203 standard can be found at . */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.encrypt_unpacked d10805 54 a10858 3 static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_encrypt_unpacked_2a( libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 *public_key, uint8_t *message, Eurydice_slice randomness, uint8_t ret[1088U]) { d10860 1 a10860 5 tuple_ed uu____0 = libcrux_ml_kem_ind_cpa_encrypt_c1_85( randomness, public_key->A, Eurydice_array_to_subslice3(ciphertext, (size_t)0U, (size_t)960U, uint8_t *)); libcrux_ml_kem_polynomial_PolynomialRingElement_1d r_as_ntt[3U]; d10862 9 a10870 12 r_as_ntt, uu____0.fst, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); libcrux_ml_kem_polynomial_PolynomialRingElement_1d error_2 = uu____0.snd; libcrux_ml_kem_polynomial_PolynomialRingElement_1d *uu____1 = public_key->t_as_ntt; libcrux_ml_kem_polynomial_PolynomialRingElement_1d *uu____2 = r_as_ntt; libcrux_ml_kem_polynomial_PolynomialRingElement_1d *uu____3 = &error_2; uint8_t *uu____4 = message; libcrux_ml_kem_ind_cpa_encrypt_c2_6c( uu____1, uu____2, uu____3, uu____4, Eurydice_array_to_subslice_from((size_t)1088U, ciphertext, (size_t)960U, uint8_t, size_t, uint8_t[])); d10875 2 a10876 32 A monomorphic instance of libcrux_ml_kem.ind_cpa.encrypt with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - CIPHERTEXT_SIZE= 1088 - T_AS_NTT_ENCODED_SIZE= 1152 - C1_LEN= 960 - C2_LEN= 128 - U_COMPRESSION_FACTOR= 10 - V_COMPRESSION_FACTOR= 4 - BLOCK_LEN= 320 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 - ETA2= 2 - ETA2_RANDOMNESS_SIZE= 128 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_encrypt_2a( Eurydice_slice public_key, uint8_t *message, Eurydice_slice randomness, uint8_t ret[1088U]) { libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 unpacked_public_key = libcrux_ml_kem_ind_cpa_build_unpacked_public_key_3f(public_key); uint8_t ret0[1088U]; libcrux_ml_kem_ind_cpa_encrypt_unpacked_2a(&unpacked_public_key, message, randomness, ret0); memcpy(ret, ret0, (size_t)1088U * sizeof(uint8_t)); } /** This function found in impl {libcrux_ml_kem::variant::Variant for libcrux_ml_kem::variant::MlKem} d10879 1 a10879 1 A monomorphic instance of libcrux_ml_kem.variant.kdf_39 d10885 3 a10887 2 static KRML_MUSTINLINE void libcrux_ml_kem_variant_kdf_39_d6( Eurydice_slice shared_secret, uint8_t *_, uint8_t ret[32U]) { a10894 3 This code verifies on some machines, runs out of memory on others */ /** d10916 2 a10917 2 static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_decapsulate_62( libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key, d10919 3 a10921 3 Eurydice_slice_uint8_t_x4 uu____0 = libcrux_ml_kem_types_unpack_private_key_b4( Eurydice_array_to_slice((size_t)2400U, private_key->value, uint8_t)); d10923 10 a10932 3 Eurydice_slice ind_cpa_public_key = uu____0.snd; Eurydice_slice ind_cpa_public_key_hash = uu____0.thd; Eurydice_slice implicit_rejection_value = uu____0.f3; d10934 1 a10934 1 libcrux_ml_kem_ind_cpa_decrypt_42(ind_cpa_secret_key, ciphertext->value, d10937 1 a10937 1 libcrux_ml_kem_utils_into_padded_array_24( d10942 1 a10942 1 uint8_t, size_t, uint8_t[]), d10945 1 a10945 1 libcrux_ml_kem_hash_functions_portable_G_4a_e0( d10947 1 a10947 1 Eurydice_slice_uint8_t_x2 uu____1 = Eurydice_slice_split_at( d10951 2 a10952 2 Eurydice_slice shared_secret0 = uu____1.fst; Eurydice_slice pseudorandomness = uu____1.snd; d10954 2 a10955 2 libcrux_ml_kem_utils_into_padded_array_15(implicit_rejection_value, to_hash); Eurydice_slice uu____2 = Eurydice_array_to_subslice_from( d10957 2 a10958 2 uint8_t, size_t, uint8_t[]); Eurydice_slice_copy(uu____2, libcrux_ml_kem_types_as_ref_d3_80(ciphertext), d10961 1 a10961 1 libcrux_ml_kem_hash_functions_portable_PRF_4a_41( d10964 4 d10969 1 a10969 1 libcrux_ml_kem_ind_cpa_encrypt_2a(ind_cpa_public_key, decrypted, d10972 1 a10972 1 libcrux_ml_kem_variant_kdf_39_d6( d10975 1 a10975 2 libcrux_ml_kem_types_as_slice_a9_80(ciphertext), implicit_rejection_shared_secret); d10977 1 a10977 3 libcrux_ml_kem_variant_kdf_39_d6( shared_secret0, libcrux_ml_kem_types_as_slice_a9_80(ciphertext), shared_secret); d10980 1 a10980 1 libcrux_ml_kem_types_as_ref_d3_80(ciphertext), d11013 2 a11014 2 libcrux_ml_kem_ind_cca_instantiations_portable_decapsulate_35( libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key, d11016 1 a11016 1 libcrux_ml_kem_ind_cca_decapsulate_62(private_key, ciphertext, ret); d11027 1 a11027 1 libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key, d11029 1 a11029 1 libcrux_ml_kem_ind_cca_instantiations_portable_decapsulate_35( d11034 2 a11035 2 This function found in impl {libcrux_ml_kem::variant::Variant for libcrux_ml_kem::variant::MlKem} d11038 1 a11038 1 A monomorphic instance of libcrux_ml_kem.variant.entropy_preprocess_39 d11043 1 a11043 1 static KRML_MUSTINLINE void libcrux_ml_kem_variant_entropy_preprocess_39_9c( d11052 2 a11053 2 This function found in impl {libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash} d11056 1 a11056 1 A monomorphic instance of libcrux_ml_kem.hash_functions.portable.H_4a d11060 1 a11060 1 static inline void libcrux_ml_kem_hash_functions_portable_H_4a_e0( d11078 1 a11078 1 - C1_BLOCK_SIZE= 320 d11084 3 a11086 2 static KRML_MUSTINLINE tuple_c2 libcrux_ml_kem_ind_cca_encapsulate_ca( libcrux_ml_kem_types_MlKemPublicKey_30 *public_key, uint8_t *randomness) { d11088 1 a11088 1 libcrux_ml_kem_variant_entropy_preprocess_39_9c( d11091 1 a11091 1 libcrux_ml_kem_utils_into_padded_array_24( d11095 3 a11097 3 size_t, uint8_t[]); uint8_t ret0[32U]; libcrux_ml_kem_hash_functions_portable_H_4a_e0( d11099 1 a11099 1 libcrux_ml_kem_types_as_slice_e6_d0(public_key), d11101 1 a11101 1 ret0); d11103 1 a11103 1 uu____0, Eurydice_array_to_slice((size_t)32U, ret0, uint8_t), uint8_t); d11105 1 a11105 1 libcrux_ml_kem_hash_functions_portable_G_4a_e0( d11113 5 d11119 2 a11120 5 libcrux_ml_kem_ind_cpa_encrypt_2a( Eurydice_array_to_slice((size_t)1184U, libcrux_ml_kem_types_as_slice_e6_d0(public_key), uint8_t), randomness0, pseudorandomness, ciphertext); d11124 13 a11136 5 tuple_c2 lit; lit.fst = libcrux_ml_kem_types_from_e0_80(copy_of_ciphertext); uint8_t ret[32U]; libcrux_ml_kem_variant_kdf_39_d6(shared_secret, ciphertext, ret); memcpy(lit.snd, ret, (size_t)32U * sizeof(uint8_t)); d11151 1 a11151 1 - C1_BLOCK_SIZE= 320 d11157 9 a11165 4 static inline tuple_c2 libcrux_ml_kem_ind_cca_instantiations_portable_encapsulate_cd( libcrux_ml_kem_types_MlKemPublicKey_30 *public_key, uint8_t *randomness) { return libcrux_ml_kem_ind_cca_encapsulate_ca(public_key, randomness); d11175 2 a11176 2 static inline tuple_c2 libcrux_ml_kem_mlkem768_portable_encapsulate( libcrux_ml_kem_types_MlKemPublicKey_30 *public_key, d11178 6 a11183 26 return libcrux_ml_kem_ind_cca_instantiations_portable_encapsulate_cd( public_key, randomness); } /** This function found in impl {core::default::Default for libcrux_ml_kem::ind_cpa::unpacked::IndCpaPrivateKeyUnpacked[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.unpacked.default_70 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static inline libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_a0 libcrux_ml_kem_ind_cpa_unpacked_default_70_1b(void) { libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_a0 lit; libcrux_ml_kem_polynomial_PolynomialRingElement_1d repeat_expression[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { repeat_expression[i] = libcrux_ml_kem_polynomial_ZERO_d6_ea(); } memcpy( lit.secret_as_ntt, repeat_expression, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); return lit; d11187 2 a11188 2 This function found in impl {libcrux_ml_kem::variant::Variant for libcrux_ml_kem::variant::MlKem} d11191 1 a11191 1 A monomorphic instance of libcrux_ml_kem.variant.cpa_keygen_seed_39 d11196 1 a11196 1 static KRML_MUSTINLINE void libcrux_ml_kem_variant_cpa_keygen_seed_39_9c( d11200 1 a11200 1 Eurydice_array_to_subslice3( d11202 1 a11202 1 LIBCRUX_ML_KEM_CONSTANTS_CPA_PKE_KEY_GENERATION_SEED_SIZE, uint8_t *), d11207 1 a11207 1 libcrux_ml_kem_hash_functions_portable_G_4a_e0( d11213 3 a11215 13 This function found in impl {core::ops::function::FnMut<(usize), libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@3]> for libcrux_ml_kem::ind_cpa::generate_keypair_unpacked::closure[TraitClause@@0, TraitClause@@1, TraitClause@@2, TraitClause@@3, TraitClause@@4, TraitClause@@5]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.generate_keypair_unpacked.call_mut_73 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]], libcrux_ml_kem_variant_MlKem with const generics a11216 2 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 d11218 3 a11220 4 static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_ind_cpa_generate_keypair_unpacked_call_mut_73_1c( void **_, size_t tupled_args) { return libcrux_ml_kem_polynomial_ZERO_d6_ea(); d11224 1 a11224 1 A monomorphic instance of libcrux_ml_kem.polynomial.to_standard_domain d11229 5 a11233 6 static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_polynomial_to_standard_domain_ea( libcrux_ml_kem_vector_portable_vector_type_PortableVector vector) { return libcrux_ml_kem_vector_portable_montgomery_multiply_by_constant_b8( vector, LIBCRUX_ML_KEM_VECTOR_TRAITS_MONTGOMERY_R_SQUARED_MOD_FIELD_MODULUS); d11237 5 a11241 1 A monomorphic instance of libcrux_ml_kem.polynomial.add_standard_error_reduce d11247 3 a11249 3 libcrux_ml_kem_polynomial_add_standard_error_reduce_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *myself, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *error) { d11255 7 a11261 8 libcrux_ml_kem_polynomial_to_standard_domain_ea( myself->coefficients[j]); libcrux_ml_kem_vector_portable_vector_type_PortableVector sum = libcrux_ml_kem_vector_portable_add_b8(coefficient_normal_form, &error->coefficients[j]); libcrux_ml_kem_vector_portable_vector_type_PortableVector red = libcrux_ml_kem_vector_portable_barrett_reduce_b8(sum); myself->coefficients[j] = red; d11266 1 a11266 3 This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]} d11269 1 a11269 1 A monomorphic instance of libcrux_ml_kem.polynomial.add_standard_error_reduce_d6 d11272 48 d11323 17 a11339 4 libcrux_ml_kem_polynomial_add_standard_error_reduce_d6_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *self, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *error) { libcrux_ml_kem_polynomial_add_standard_error_reduce_ea(self, error); d11343 1 a11343 1 Compute  ◦ ŝ + ê d11346 1 a11346 1 A monomorphic instance of libcrux_ml_kem.matrix.compute_As_plus_e d11350 1 d11352 4 a11355 5 static KRML_MUSTINLINE void libcrux_ml_kem_matrix_compute_As_plus_e_1b( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *t_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_1d (*matrix_A)[3U], libcrux_ml_kem_polynomial_PolynomialRingElement_1d *s_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *error_as_ntt) { d11359 3 a11361 3 (size_t)3U, matrix_A, libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U]), libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U]); d11364 9 a11372 22 libcrux_ml_kem_polynomial_PolynomialRingElement_1d *row = matrix_A[i0]; libcrux_ml_kem_polynomial_PolynomialRingElement_1d uu____0 = libcrux_ml_kem_polynomial_ZERO_d6_ea(); t_as_ntt[i0] = uu____0; for (size_t i1 = (size_t)0U; i1 < Eurydice_slice_len( Eurydice_array_to_slice( (size_t)3U, row, libcrux_ml_kem_polynomial_PolynomialRingElement_1d), libcrux_ml_kem_polynomial_PolynomialRingElement_1d); i1++) { size_t j = i1; libcrux_ml_kem_polynomial_PolynomialRingElement_1d *matrix_element = &row[j]; libcrux_ml_kem_polynomial_PolynomialRingElement_1d product = libcrux_ml_kem_polynomial_ntt_multiply_d6_ea(matrix_element, &s_as_ntt[j]); libcrux_ml_kem_polynomial_add_to_ring_element_d6_1b(&t_as_ntt[i0], &product); } libcrux_ml_kem_polynomial_add_standard_error_reduce_d6_ea( &t_as_ntt[i0], &error_as_ntt[i0]); d11374 1 d11378 26 a11403 36 This function implements most of Algorithm 12 of the NIST FIPS 203 specification; this is the Kyber CPA-PKE key generation algorithm. We say "most of" since Algorithm 12 samples the required randomness within the function itself, whereas this implementation expects it to be provided through the `key_generation_seed` parameter. Algorithm 12 is reproduced below: ```plaintext Output: encryption key ekₚₖₑ ∈ 𝔹^{384k+32}. Output: decryption key dkₚₖₑ ∈ 𝔹^{384k}. d ←$ B (ρ,σ) ← G(d) N ← 0 for (i ← 0; i < k; i++) for(j ← 0; j < k; j++) Â[i,j] ← SampleNTT(XOF(ρ, i, j)) end for end for for(i ← 0; i < k; i++) s[i] ← SamplePolyCBD_{η₁}(PRF_{η₁}(σ,N)) N ← N + 1 end for for(i ← 0; i < k; i++) e[i] ← SamplePolyCBD_{η₂}(PRF_{η₂}(σ,N)) N ← N + 1 end for ŝ ← NTT(s) ê ← NTT(e) t̂ ← Â◦ŝ + ê ekₚₖₑ ← ByteEncode₁₂(t̂) ‖ ρ dkₚₖₑ ← ByteEncode₁₂(ŝ) ``` a11404 3 The NIST FIPS 203 standard can be found at . */ d11406 1 a11406 1 A monomorphic instance of libcrux_ml_kem.ind_cpa.generate_keypair_unpacked d11411 3 d11417 2 a11418 4 static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_generate_keypair_unpacked_1c( Eurydice_slice key_generation_seed, libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_a0 *private_key, libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 *public_key) { d11420 1 a11420 1 libcrux_ml_kem_variant_cpa_keygen_seed_39_9c(key_generation_seed, hashed); d11424 1 a11424 1 Eurydice_slice seed_for_A = uu____0.fst; d11426 1 a11426 2 libcrux_ml_kem_polynomial_PolynomialRingElement_1d(*uu____1)[3U] = public_key->A; d11428 2 a11429 2 libcrux_ml_kem_utils_into_padded_array_b6(seed_for_A, ret); libcrux_ml_kem_matrix_sample_matrix_A_2b(uu____1, ret, true); d11431 29 a11459 145 libcrux_ml_kem_utils_into_padded_array_c8(seed_for_secret_and_error, prf_input); uint8_t domain_separator = libcrux_ml_kem_ind_cpa_sample_vector_cbd_then_ntt_3b( private_key->secret_as_ntt, prf_input, 0U); libcrux_ml_kem_polynomial_PolynomialRingElement_1d error_as_ntt[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { /* original Rust expression is not an lvalue in C */ void *lvalue = (void *)0U; error_as_ntt[i] = libcrux_ml_kem_ind_cpa_generate_keypair_unpacked_call_mut_73_1c(&lvalue, i); } libcrux_ml_kem_ind_cpa_sample_vector_cbd_then_ntt_3b(error_as_ntt, prf_input, domain_separator); libcrux_ml_kem_matrix_compute_As_plus_e_1b( public_key->t_as_ntt, public_key->A, private_key->secret_as_ntt, error_as_ntt); uint8_t uu____2[32U]; Result_fb dst; Eurydice_slice_to_array2(&dst, seed_for_A, Eurydice_slice, uint8_t[32U], TryFromSliceError); unwrap_26_b3(dst, uu____2); memcpy(public_key->seed_for_A, uu____2, (size_t)32U * sizeof(uint8_t)); } /** A monomorphic instance of libcrux_ml_kem.serialize.serialize_uncompressed_ring_element with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_serialize_serialize_uncompressed_ring_element_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re, uint8_t ret[384U]) { uint8_t serialized[384U] = {0U}; for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT; i++) { size_t i0 = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient = libcrux_ml_kem_serialize_to_unsigned_field_modulus_ea( re->coefficients[i0]); uint8_t bytes[24U]; libcrux_ml_kem_vector_portable_serialize_12_b8(coefficient, bytes); Eurydice_slice_copy( Eurydice_array_to_subslice3(serialized, (size_t)24U * i0, (size_t)24U * i0 + (size_t)24U, uint8_t *), Eurydice_array_to_slice((size_t)24U, bytes, uint8_t), uint8_t); } memcpy(ret, serialized, (size_t)384U * sizeof(uint8_t)); } /** Call [`serialize_uncompressed_ring_element`] for each ring element. */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.serialize_vector with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_serialize_vector_1b( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *key, Eurydice_slice out) { for (size_t i = (size_t)0U; i < Eurydice_slice_len( Eurydice_array_to_slice( (size_t)3U, key, libcrux_ml_kem_polynomial_PolynomialRingElement_1d), libcrux_ml_kem_polynomial_PolynomialRingElement_1d); i++) { size_t i0 = i; libcrux_ml_kem_polynomial_PolynomialRingElement_1d re = key[i0]; Eurydice_slice uu____0 = Eurydice_slice_subslice3( out, i0 * LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT, (i0 + (size_t)1U) * LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT, uint8_t *); uint8_t ret[384U]; libcrux_ml_kem_serialize_serialize_uncompressed_ring_element_ea(&re, ret); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)384U, ret, uint8_t), uint8_t); } } /** Concatenate `t` and `ρ` into the public key. */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.serialize_public_key_mut with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - PUBLIC_KEY_SIZE= 1184 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_serialize_public_key_mut_89( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *t_as_ntt, Eurydice_slice seed_for_a, uint8_t *serialized) { libcrux_ml_kem_ind_cpa_serialize_vector_1b( t_as_ntt, Eurydice_array_to_subslice3( serialized, (size_t)0U, libcrux_ml_kem_constants_ranked_bytes_per_ring_element((size_t)3U), uint8_t *)); Eurydice_slice_copy( Eurydice_array_to_subslice_from( (size_t)1184U, serialized, libcrux_ml_kem_constants_ranked_bytes_per_ring_element((size_t)3U), uint8_t, size_t, uint8_t[]), seed_for_a, uint8_t); } /** Concatenate `t` and `ρ` into the public key. */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.serialize_public_key with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - PUBLIC_KEY_SIZE= 1184 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_serialize_public_key_89( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *t_as_ntt, Eurydice_slice seed_for_a, uint8_t ret[1184U]) { uint8_t public_key_serialized[1184U] = {0U}; libcrux_ml_kem_ind_cpa_serialize_public_key_mut_89(t_as_ntt, seed_for_a, public_key_serialized); memcpy(ret, public_key_serialized, (size_t)1184U * sizeof(uint8_t)); } /** Serialize the secret key from the unpacked key pair generation. */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.serialize_unpacked_secret_key with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - PRIVATE_KEY_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 */ static inline libcrux_ml_kem_utils_extraction_helper_Keypair768 libcrux_ml_kem_ind_cpa_serialize_unpacked_secret_key_6c( libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 *public_key, libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_a0 *private_key) { d11461 2 a11462 3 libcrux_ml_kem_ind_cpa_serialize_public_key_89( public_key->t_as_ntt, Eurydice_array_to_slice((size_t)32U, public_key->seed_for_A, uint8_t), d11464 3 a11466 4 uint8_t secret_key_serialized[1152U] = {0U}; libcrux_ml_kem_ind_cpa_serialize_vector_1b( private_key->secret_as_ntt, Eurydice_array_to_slice((size_t)1152U, secret_key_serialized, uint8_t)); a11483 23 A monomorphic instance of libcrux_ml_kem.ind_cpa.generate_keypair with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]], libcrux_ml_kem_variant_MlKem with const generics - K= 3 - PRIVATE_KEY_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 */ static KRML_MUSTINLINE libcrux_ml_kem_utils_extraction_helper_Keypair768 libcrux_ml_kem_ind_cpa_generate_keypair_ea(Eurydice_slice key_generation_seed) { libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_a0 private_key = libcrux_ml_kem_ind_cpa_unpacked_default_70_1b(); libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 public_key = libcrux_ml_kem_ind_cpa_unpacked_default_8b_1b(); libcrux_ml_kem_ind_cpa_generate_keypair_unpacked_1c( key_generation_seed, &private_key, &public_key); return libcrux_ml_kem_ind_cpa_serialize_unpacked_secret_key_6c(&public_key, &private_key); } /** d11487 1 a11487 1 A monomorphic instance of libcrux_ml_kem.ind_cca.serialize_kem_secret_key_mut d11493 1 a11493 2 static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_serialize_kem_secret_key_mut_d6( d11495 2 a11496 1 Eurydice_slice implicit_rejection_value, uint8_t *serialized) { d11498 1 a11498 1 uint8_t *uu____0 = serialized; d11502 1 a11502 1 Eurydice_array_to_subslice3( d11504 1 a11504 1 uint8_t *), d11507 1 a11507 1 uint8_t *uu____3 = serialized; d11511 1 a11511 1 Eurydice_array_to_subslice3( d11513 1 a11513 1 uint8_t *), d11516 4 a11519 5 Eurydice_slice uu____6 = Eurydice_array_to_subslice3( serialized, pointer, pointer + LIBCRUX_ML_KEM_CONSTANTS_H_DIGEST_SIZE, uint8_t *); uint8_t ret[32U]; libcrux_ml_kem_hash_functions_portable_H_4a_e0(public_key, ret); d11521 1 a11521 1 uu____6, Eurydice_array_to_slice((size_t)32U, ret, uint8_t), uint8_t); d11523 1 a11523 1 uint8_t *uu____7 = serialized; d11527 1 a11527 1 Eurydice_array_to_subslice3( d11530 1 a11530 1 uint8_t *), a11531 15 } /** A monomorphic instance of libcrux_ml_kem.ind_cca.serialize_kem_secret_key with types libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - SERIALIZED_KEY_LEN= 2400 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_serialize_kem_secret_key_d6( Eurydice_slice private_key, Eurydice_slice public_key, Eurydice_slice implicit_rejection_value, uint8_t ret[2400U]) { uint8_t out[2400U] = {0U}; libcrux_ml_kem_ind_cca_serialize_kem_secret_key_mut_d6( private_key, public_key, implicit_rejection_value, out); d11552 1 d11556 3 a11558 3 static KRML_MUSTINLINE libcrux_ml_kem_mlkem768_MlKem768KeyPair libcrux_ml_kem_ind_cca_generate_keypair_15(uint8_t *randomness) { Eurydice_slice ind_cpa_keypair_randomness = Eurydice_array_to_subslice3( d11560 1 a11560 1 LIBCRUX_ML_KEM_CONSTANTS_CPA_PKE_KEY_GENERATION_SEED_SIZE, uint8_t *); d11564 1 a11564 1 size_t, uint8_t[]); d11566 1 a11566 1 libcrux_ml_kem_ind_cpa_generate_keypair_ea(ind_cpa_keypair_randomness); d11572 1 a11572 1 libcrux_ml_kem_ind_cca_serialize_kem_secret_key_d6( d11580 3 a11582 3 libcrux_ml_kem_types_MlKemPrivateKey_d9 private_key = libcrux_ml_kem_types_from_77_28(copy_of_secret_key_serialized); libcrux_ml_kem_types_MlKemPrivateKey_d9 uu____2 = private_key; d11586 2 a11587 2 return libcrux_ml_kem_types_from_17_74( uu____2, libcrux_ml_kem_types_from_fd_d0(copy_of_public_key)); d11601 1 d11606 6 a11611 3 libcrux_ml_kem_ind_cca_instantiations_portable_generate_keypair_ce( uint8_t *randomness) { return libcrux_ml_kem_ind_cca_generate_keypair_15(randomness); d11619 5 a11623 2 return libcrux_ml_kem_ind_cca_instantiations_portable_generate_keypair_ce( randomness); d11627 2 a11628 3 Validate an ML-KEM private key. This implements the Hash check in 7.3 3. d11631 1 a11631 1 A monomorphic instance of libcrux_ml_kem.ind_cca.validate_private_key_only d11635 1 a11635 1 - SECRET_KEY_SIZE= 2400 d11637 20 a11656 12 static KRML_MUSTINLINE bool libcrux_ml_kem_ind_cca_validate_private_key_only_d6( libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key) { uint8_t t[32U]; libcrux_ml_kem_hash_functions_portable_H_4a_e0( Eurydice_array_to_subslice3(private_key->value, (size_t)384U * (size_t)3U, (size_t)768U * (size_t)3U + (size_t)32U, uint8_t *), t); Eurydice_slice expected = Eurydice_array_to_subslice3( private_key->value, (size_t)768U * (size_t)3U + (size_t)32U, (size_t)768U * (size_t)3U + (size_t)64U, uint8_t *); return Eurydice_array_eq_slice((size_t)32U, t, &expected, uint8_t, bool); d11660 4 a11663 10 Validate an ML-KEM private key. This implements the Hash check in 7.3 3. Note that the size checks in 7.2 1 and 2 are covered by the `SECRET_KEY_SIZE` and `CIPHERTEXT_SIZE` in the `private_key` and `ciphertext` types. */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.validate_private_key with types libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics d11666 2 d11669 11 d11681 71 a11751 4 static KRML_MUSTINLINE bool libcrux_ml_kem_ind_cca_validate_private_key_37( libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key, libcrux_ml_kem_mlkem768_MlKem768Ciphertext *_ciphertext) { return libcrux_ml_kem_ind_cca_validate_private_key_only_d6(private_key); d11755 1 a11755 1 Private key validation d11759 1 a11759 1 libcrux_ml_kem.ind_cca.instantiations.portable.validate_private_key with const d11763 2 d11766 2 a11767 206 */ static KRML_MUSTINLINE bool libcrux_ml_kem_ind_cca_instantiations_portable_validate_private_key_31( libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key, libcrux_ml_kem_mlkem768_MlKem768Ciphertext *ciphertext) { return libcrux_ml_kem_ind_cca_validate_private_key_37(private_key, ciphertext); } /** Validate a private key. Returns `true` if valid, and `false` otherwise. */ static inline bool libcrux_ml_kem_mlkem768_portable_validate_private_key( libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key, libcrux_ml_kem_mlkem768_MlKem768Ciphertext *ciphertext) { return libcrux_ml_kem_ind_cca_instantiations_portable_validate_private_key_31( private_key, ciphertext); } /** Private key validation */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.instantiations.portable.validate_private_key_only with const generics - K= 3 - SECRET_KEY_SIZE= 2400 */ static KRML_MUSTINLINE bool libcrux_ml_kem_ind_cca_instantiations_portable_validate_private_key_only_41( libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key) { return libcrux_ml_kem_ind_cca_validate_private_key_only_d6(private_key); } /** Validate the private key only. Returns `true` if valid, and `false` otherwise. */ static inline bool libcrux_ml_kem_mlkem768_portable_validate_private_key_only( libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key) { return libcrux_ml_kem_ind_cca_instantiations_portable_validate_private_key_only_41( private_key); } /** This function found in impl {core::ops::function::FnMut<(usize), libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]> for libcrux_ml_kem::serialize::deserialize_ring_elements_reduced_out::closure[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.serialize.deserialize_ring_elements_reduced_out.call_mut_0b with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_out_call_mut_0b_1b( void **_, size_t tupled_args) { return libcrux_ml_kem_polynomial_ZERO_d6_ea(); } /** This function deserializes ring elements and reduces the result by the field modulus. This function MUST NOT be used on secret inputs. */ /** A monomorphic instance of libcrux_ml_kem.serialize.deserialize_ring_elements_reduced_out with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_out_1b( Eurydice_slice public_key, libcrux_ml_kem_polynomial_PolynomialRingElement_1d ret[3U]) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d deserialized_pk[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { /* original Rust expression is not an lvalue in C */ void *lvalue = (void *)0U; deserialized_pk[i] = libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_out_call_mut_0b_1b( &lvalue, i); } libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_1b( public_key, deserialized_pk); memcpy( ret, deserialized_pk, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); } /** Validate an ML-KEM public key. This implements the Modulus check in 7.2 2. Note that the size check in 7.2 1 is covered by the `PUBLIC_KEY_SIZE` in the `public_key` type. */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.validate_public_key with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - PUBLIC_KEY_SIZE= 1184 */ static KRML_MUSTINLINE bool libcrux_ml_kem_ind_cca_validate_public_key_89( uint8_t *public_key) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d deserialized_pk[3U]; libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_out_1b( Eurydice_array_to_subslice_to( (size_t)1184U, public_key, libcrux_ml_kem_constants_ranked_bytes_per_ring_element((size_t)3U), uint8_t, size_t, uint8_t[]), deserialized_pk); libcrux_ml_kem_polynomial_PolynomialRingElement_1d *uu____0 = deserialized_pk; uint8_t public_key_serialized[1184U]; libcrux_ml_kem_ind_cpa_serialize_public_key_89( uu____0, Eurydice_array_to_subslice_from( (size_t)1184U, public_key, libcrux_ml_kem_constants_ranked_bytes_per_ring_element((size_t)3U), uint8_t, size_t, uint8_t[]), public_key_serialized); return Eurydice_array_eq((size_t)1184U, public_key, public_key_serialized, uint8_t); } /** Public key validation */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.instantiations.portable.validate_public_key with const generics - K= 3 - PUBLIC_KEY_SIZE= 1184 */ static KRML_MUSTINLINE bool libcrux_ml_kem_ind_cca_instantiations_portable_validate_public_key_41( uint8_t *public_key) { return libcrux_ml_kem_ind_cca_validate_public_key_89(public_key); } /** Validate a public key. Returns `true` if valid, and `false` otherwise. */ static inline bool libcrux_ml_kem_mlkem768_portable_validate_public_key( libcrux_ml_kem_types_MlKemPublicKey_30 *public_key) { return libcrux_ml_kem_ind_cca_instantiations_portable_validate_public_key_41( public_key->value); } /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.MlKemPublicKeyUnpacked with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - $3size_t */ typedef struct libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0_s { libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 ind_cpa_public_key; uint8_t public_key_hash[32U]; } libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0; typedef libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768PublicKeyUnpacked; /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.MlKemPrivateKeyUnpacked with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - $3size_t */ typedef struct libcrux_ml_kem_ind_cca_unpacked_MlKemPrivateKeyUnpacked_a0_s { libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_a0 ind_cpa_private_key; uint8_t implicit_rejection_value[32U]; } libcrux_ml_kem_ind_cca_unpacked_MlKemPrivateKeyUnpacked_a0; typedef struct libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked_s { libcrux_ml_kem_ind_cca_unpacked_MlKemPrivateKeyUnpacked_a0 private_key; libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 public_key; } libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked; /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.decapsulate with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - SECRET_KEY_SIZE= 2400 - CPA_SECRET_KEY_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 - CIPHERTEXT_SIZE= 1088 - T_AS_NTT_ENCODED_SIZE= 1152 - C1_SIZE= 960 d11778 3 a11780 84 static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_unpacked_decapsulate_51( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *key_pair, libcrux_ml_kem_mlkem768_MlKem768Ciphertext *ciphertext, uint8_t ret[32U]) { uint8_t decrypted[32U]; libcrux_ml_kem_ind_cpa_decrypt_unpacked_42( &key_pair->private_key.ind_cpa_private_key, ciphertext->value, decrypted); uint8_t to_hash0[64U]; libcrux_ml_kem_utils_into_padded_array_24( Eurydice_array_to_slice((size_t)32U, decrypted, uint8_t), to_hash0); Eurydice_slice uu____0 = Eurydice_array_to_subslice_from( (size_t)64U, to_hash0, LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE, uint8_t, size_t, uint8_t[]); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)32U, key_pair->public_key.public_key_hash, uint8_t), uint8_t); uint8_t hashed[64U]; libcrux_ml_kem_hash_functions_portable_G_4a_e0( Eurydice_array_to_slice((size_t)64U, to_hash0, uint8_t), hashed); Eurydice_slice_uint8_t_x2 uu____1 = Eurydice_slice_split_at( Eurydice_array_to_slice((size_t)64U, hashed, uint8_t), LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice shared_secret = uu____1.fst; Eurydice_slice pseudorandomness = uu____1.snd; uint8_t to_hash[1120U]; libcrux_ml_kem_utils_into_padded_array_15( Eurydice_array_to_slice( (size_t)32U, key_pair->private_key.implicit_rejection_value, uint8_t), to_hash); Eurydice_slice uu____2 = Eurydice_array_to_subslice_from( (size_t)1120U, to_hash, LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE, uint8_t, size_t, uint8_t[]); Eurydice_slice_copy(uu____2, libcrux_ml_kem_types_as_ref_d3_80(ciphertext), uint8_t); uint8_t implicit_rejection_shared_secret[32U]; libcrux_ml_kem_hash_functions_portable_PRF_4a_41( Eurydice_array_to_slice((size_t)1120U, to_hash, uint8_t), implicit_rejection_shared_secret); uint8_t expected_ciphertext[1088U]; libcrux_ml_kem_ind_cpa_encrypt_unpacked_2a( &key_pair->public_key.ind_cpa_public_key, decrypted, pseudorandomness, expected_ciphertext); uint8_t selector = libcrux_ml_kem_constant_time_ops_compare_ciphertexts_in_constant_time( libcrux_ml_kem_types_as_ref_d3_80(ciphertext), Eurydice_array_to_slice((size_t)1088U, expected_ciphertext, uint8_t)); uint8_t ret0[32U]; libcrux_ml_kem_constant_time_ops_select_shared_secret_in_constant_time( shared_secret, Eurydice_array_to_slice((size_t)32U, implicit_rejection_shared_secret, uint8_t), selector, ret0); memcpy(ret, ret0, (size_t)32U * sizeof(uint8_t)); } /** Unpacked decapsulate */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.instantiations.portable.unpacked.decapsulate with const generics - K= 3 - SECRET_KEY_SIZE= 2400 - CPA_SECRET_KEY_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 - CIPHERTEXT_SIZE= 1088 - T_AS_NTT_ENCODED_SIZE= 1152 - C1_SIZE= 960 - C2_SIZE= 128 - VECTOR_U_COMPRESSION_FACTOR= 10 - VECTOR_V_COMPRESSION_FACTOR= 4 - C1_BLOCK_SIZE= 320 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 - ETA2= 2 - ETA2_RANDOMNESS_SIZE= 128 - IMPLICIT_REJECTION_HASH_INPUT_SIZE= 1120 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_instantiations_portable_unpacked_decapsulate_35( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *key_pair, d11782 1 a11782 1 libcrux_ml_kem_ind_cca_unpacked_decapsulate_51(key_pair, ciphertext, ret); d11786 1 a11786 1 Decapsulate ML-KEM 768 (unpacked) d11789 2 a11790 2 The input is a reference to an unpacked key pair of type [`MlKem768KeyPairUnpacked`] and an [`MlKem768Ciphertext`]. d11792 2 a11793 3 static inline void libcrux_ml_kem_mlkem768_portable_unpacked_decapsulate( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *private_key, d11795 1 a11795 1 libcrux_ml_kem_ind_cca_instantiations_portable_unpacked_decapsulate_35( d11800 5 a11804 1 A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.encaps_prepare d11809 3 a11811 13 static inline void libcrux_ml_kem_ind_cca_unpacked_encaps_prepare_9c( Eurydice_slice randomness, Eurydice_slice pk_hash, uint8_t ret[64U]) { uint8_t to_hash[64U]; libcrux_ml_kem_utils_into_padded_array_24(randomness, to_hash); Eurydice_slice_copy( Eurydice_array_to_subslice_from((size_t)64U, to_hash, LIBCRUX_ML_KEM_CONSTANTS_H_DIGEST_SIZE, uint8_t, size_t, uint8_t[]), pk_hash, uint8_t); uint8_t ret0[64U]; libcrux_ml_kem_hash_functions_portable_G_4a_e0( Eurydice_array_to_slice((size_t)64U, to_hash, uint8_t), ret0); memcpy(ret, ret0, (size_t)64U * sizeof(uint8_t)); d11815 1 a11815 1 A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.encapsulate d11817 2 a11818 2 libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics d11833 20 a11852 3 static KRML_MUSTINLINE tuple_c2 libcrux_ml_kem_ind_cca_unpacked_encapsulate_0c( libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 *public_key, uint8_t *randomness) { d11854 3 a11856 6 libcrux_ml_kem_ind_cca_unpacked_encaps_prepare_9c( Eurydice_array_to_slice((size_t)32U, randomness, uint8_t), Eurydice_array_to_slice((size_t)32U, public_key->public_key_hash, uint8_t), hashed); Eurydice_slice_uint8_t_x2 uu____0 = Eurydice_slice_split_at( d11860 7 a11866 2 Eurydice_slice shared_secret = uu____0.fst; Eurydice_slice pseudorandomness = uu____0.snd; d11868 2 a11869 7 libcrux_ml_kem_ind_cpa_encrypt_unpacked_2a(&public_key->ind_cpa_public_key, randomness, pseudorandomness, ciphertext); uint8_t shared_secret_array[32U] = {0U}; Eurydice_slice_copy( Eurydice_array_to_slice((size_t)32U, shared_secret_array, uint8_t), shared_secret, uint8_t); d11873 6 a11878 2 libcrux_ml_kem_mlkem768_MlKem768Ciphertext uu____2 = libcrux_ml_kem_types_from_e0_80(copy_of_ciphertext); d11883 2 a11884 2 tuple_c2 lit; lit.fst = uu____2; d11890 1 a11890 1 Unpacked encapsulate d11894 1 a11894 1 libcrux_ml_kem.ind_cca.instantiations.portable.unpacked.encapsulate with const d11910 3 a11912 17 static KRML_MUSTINLINE tuple_c2 libcrux_ml_kem_ind_cca_instantiations_portable_unpacked_encapsulate_cd( libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 *public_key, uint8_t *randomness) { return libcrux_ml_kem_ind_cca_unpacked_encapsulate_0c(public_key, randomness); } /** Encapsulate ML-KEM 768 (unpacked) Generates an ([`MlKem768Ciphertext`], [`MlKemSharedSecret`]) tuple. The input is a reference to an unpacked public key of type [`MlKem768PublicKeyUnpacked`], the SHA3-256 hash of this public key, and [`SHARED_SECRET_SIZE`] bytes of `randomness`. */ static inline tuple_c2 libcrux_ml_kem_mlkem768_portable_unpacked_encapsulate( libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 *public_key, d11914 1 a11914 185 return libcrux_ml_kem_ind_cca_instantiations_portable_unpacked_encapsulate_cd( public_key, randomness); } /** This function found in impl {core::ops::function::FnMut<(usize), libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]> for libcrux_ml_kem::ind_cca::unpacked::transpose_a::closure::closure[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.transpose_a.closure.call_mut_b4 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_ind_cca_unpacked_transpose_a_closure_call_mut_b4_1b( void **_, size_t tupled_args) { return libcrux_ml_kem_polynomial_ZERO_d6_ea(); } /** This function found in impl {core::ops::function::FnMut<(usize), @@Array[TraitClause@@0, TraitClause@@1], K>> for libcrux_ml_kem::ind_cca::unpacked::transpose_a::closure[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.transpose_a.call_mut_7b with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static inline void libcrux_ml_kem_ind_cca_unpacked_transpose_a_call_mut_7b_1b( void **_, size_t tupled_args, libcrux_ml_kem_polynomial_PolynomialRingElement_1d ret[3U]) { for (size_t i = (size_t)0U; i < (size_t)3U; i++) { /* original Rust expression is not an lvalue in C */ void *lvalue = (void *)0U; ret[i] = libcrux_ml_kem_ind_cca_unpacked_transpose_a_closure_call_mut_b4_1b( &lvalue, i); } } /** This function found in impl {core::clone::Clone for libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@2]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.clone_c1 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_polynomial_clone_c1_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *self) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d lit; libcrux_ml_kem_vector_portable_vector_type_PortableVector ret[16U]; core_array__core__clone__Clone_for__Array_T__N___clone( (size_t)16U, self->coefficients, ret, libcrux_ml_kem_vector_portable_vector_type_PortableVector, void *); memcpy(lit.coefficients, ret, (size_t)16U * sizeof(libcrux_ml_kem_vector_portable_vector_type_PortableVector)); return lit; } /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.transpose_a with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static inline void libcrux_ml_kem_ind_cca_unpacked_transpose_a_1b( libcrux_ml_kem_polynomial_PolynomialRingElement_1d ind_cpa_a[3U][3U], libcrux_ml_kem_polynomial_PolynomialRingElement_1d ret[3U][3U]) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d A[3U][3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { /* original Rust expression is not an lvalue in C */ void *lvalue = (void *)0U; libcrux_ml_kem_ind_cca_unpacked_transpose_a_call_mut_7b_1b(&lvalue, i, A[i]); } for (size_t i = (size_t)0U; i < (size_t)3U; i++) { size_t i0 = i; libcrux_ml_kem_polynomial_PolynomialRingElement_1d _a_i[3U][3U]; memcpy(_a_i, A, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U])); for (size_t i1 = (size_t)0U; i1 < (size_t)3U; i1++) { size_t j = i1; libcrux_ml_kem_polynomial_PolynomialRingElement_1d uu____0 = libcrux_ml_kem_polynomial_clone_c1_ea(&ind_cpa_a[j][i0]); A[i0][j] = uu____0; } } memcpy(ret, A, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U])); } /** Generate Unpacked Keys */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.generate_keypair with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]], libcrux_ml_kem_variant_MlKem with const generics - K= 3 - CPA_PRIVATE_KEY_SIZE= 1152 - PRIVATE_KEY_SIZE= 2400 - PUBLIC_KEY_SIZE= 1184 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_unpacked_generate_keypair_15( uint8_t randomness[64U], libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *out) { Eurydice_slice ind_cpa_keypair_randomness = Eurydice_array_to_subslice3( randomness, (size_t)0U, LIBCRUX_ML_KEM_CONSTANTS_CPA_PKE_KEY_GENERATION_SEED_SIZE, uint8_t *); Eurydice_slice implicit_rejection_value = Eurydice_array_to_subslice_from( (size_t)64U, randomness, LIBCRUX_ML_KEM_CONSTANTS_CPA_PKE_KEY_GENERATION_SEED_SIZE, uint8_t, size_t, uint8_t[]); libcrux_ml_kem_ind_cpa_generate_keypair_unpacked_1c( ind_cpa_keypair_randomness, &out->private_key.ind_cpa_private_key, &out->public_key.ind_cpa_public_key); libcrux_ml_kem_polynomial_PolynomialRingElement_1d uu____0[3U][3U]; memcpy(uu____0, out->public_key.ind_cpa_public_key.A, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U])); libcrux_ml_kem_polynomial_PolynomialRingElement_1d A[3U][3U]; libcrux_ml_kem_ind_cca_unpacked_transpose_a_1b(uu____0, A); libcrux_ml_kem_polynomial_PolynomialRingElement_1d uu____1[3U][3U]; memcpy(uu____1, A, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U])); memcpy(out->public_key.ind_cpa_public_key.A, uu____1, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U])); uint8_t pk_serialized[1184U]; libcrux_ml_kem_ind_cpa_serialize_public_key_89( out->public_key.ind_cpa_public_key.t_as_ntt, Eurydice_array_to_slice( (size_t)32U, out->public_key.ind_cpa_public_key.seed_for_A, uint8_t), pk_serialized); uint8_t uu____2[32U]; libcrux_ml_kem_hash_functions_portable_H_4a_e0( Eurydice_array_to_slice((size_t)1184U, pk_serialized, uint8_t), uu____2); memcpy(out->public_key.public_key_hash, uu____2, (size_t)32U * sizeof(uint8_t)); uint8_t uu____3[32U]; Result_fb dst; Eurydice_slice_to_array2(&dst, implicit_rejection_value, Eurydice_slice, uint8_t[32U], TryFromSliceError); unwrap_26_b3(dst, uu____3); memcpy(out->private_key.implicit_rejection_value, uu____3, (size_t)32U * sizeof(uint8_t)); } /** Generate a key pair */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.instantiations.portable.unpacked.generate_keypair with const generics - K= 3 - CPA_PRIVATE_KEY_SIZE= 1152 - PRIVATE_KEY_SIZE= 2400 - PUBLIC_KEY_SIZE= 1184 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_instantiations_portable_unpacked_generate_keypair_ce( uint8_t randomness[64U], libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *out) { d11916 3 a11918 3 uint8_t copy_of_randomness[64U]; memcpy(copy_of_randomness, randomness, (size_t)64U * sizeof(uint8_t)); libcrux_ml_kem_ind_cca_unpacked_generate_keypair_15(copy_of_randomness, out); d11922 1 a11922 13 Generate ML-KEM 768 Key Pair in "unpacked" form. */ static inline void libcrux_ml_kem_mlkem768_portable_unpacked_generate_key_pair_mut( uint8_t randomness[64U], libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *key_pair) { /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_randomness[64U]; memcpy(copy_of_randomness, randomness, (size_t)64U * sizeof(uint8_t)); libcrux_ml_kem_ind_cca_instantiations_portable_unpacked_generate_keypair_ce( copy_of_randomness, key_pair); } d11924 3 a11926 85 /** This function found in impl {core::default::Default for libcrux_ml_kem::ind_cca::unpacked::MlKemPublicKeyUnpacked[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.default_30 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 libcrux_ml_kem_ind_cca_unpacked_default_30_1b(void) { return ( KRML_CLITERAL(libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0){ .ind_cpa_public_key = libcrux_ml_kem_ind_cpa_unpacked_default_8b_1b(), .public_key_hash = {0U}}); } /** This function found in impl {core::default::Default for libcrux_ml_kem::ind_cca::unpacked::MlKemKeyPairUnpacked[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.default_7b with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked libcrux_ml_kem_ind_cca_unpacked_default_7b_1b(void) { libcrux_ml_kem_ind_cca_unpacked_MlKemPrivateKeyUnpacked_a0 uu____0 = { .ind_cpa_private_key = libcrux_ml_kem_ind_cpa_unpacked_default_70_1b(), .implicit_rejection_value = {0U}}; return (KRML_CLITERAL( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked){ .private_key = uu____0, .public_key = libcrux_ml_kem_ind_cca_unpacked_default_30_1b()}); } /** Generate ML-KEM 768 Key Pair in "unpacked" form. */ static inline libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked libcrux_ml_kem_mlkem768_portable_unpacked_generate_key_pair( uint8_t randomness[64U]) { libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked key_pair = libcrux_ml_kem_ind_cca_unpacked_default_7b_1b(); uint8_t uu____0[64U]; memcpy(uu____0, randomness, (size_t)64U * sizeof(uint8_t)); libcrux_ml_kem_mlkem768_portable_unpacked_generate_key_pair_mut(uu____0, &key_pair); return key_pair; } /** Create a new, empty unpacked key. */ static inline libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked libcrux_ml_kem_mlkem768_portable_unpacked_init_key_pair(void) { return libcrux_ml_kem_ind_cca_unpacked_default_7b_1b(); } /** Create a new, empty unpacked public key. */ static inline libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 libcrux_ml_kem_mlkem768_portable_unpacked_init_public_key(void) { return libcrux_ml_kem_ind_cca_unpacked_default_30_1b(); } /** Take a serialized private key and generate an unpacked key pair from it. */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.keys_from_private_key with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - SECRET_KEY_SIZE= 2400 - CPA_SECRET_KEY_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 - T_AS_NTT_ENCODED_SIZE= 1152 d11928 9 a11936 32 static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_unpacked_keys_from_private_key_42( libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key, libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *key_pair) { Eurydice_slice_uint8_t_x4 uu____0 = libcrux_ml_kem_types_unpack_private_key_b4( Eurydice_array_to_slice((size_t)2400U, private_key->value, uint8_t)); Eurydice_slice ind_cpa_secret_key = uu____0.fst; Eurydice_slice ind_cpa_public_key = uu____0.snd; Eurydice_slice ind_cpa_public_key_hash = uu____0.thd; Eurydice_slice implicit_rejection_value = uu____0.f3; libcrux_ml_kem_ind_cpa_deserialize_vector_1b( ind_cpa_secret_key, key_pair->private_key.ind_cpa_private_key.secret_as_ntt); libcrux_ml_kem_ind_cpa_build_unpacked_public_key_mut_3f( ind_cpa_public_key, &key_pair->public_key.ind_cpa_public_key); Eurydice_slice_copy( Eurydice_array_to_slice((size_t)32U, key_pair->public_key.public_key_hash, uint8_t), ind_cpa_public_key_hash, uint8_t); Eurydice_slice_copy( Eurydice_array_to_slice( (size_t)32U, key_pair->private_key.implicit_rejection_value, uint8_t), implicit_rejection_value, uint8_t); Eurydice_slice_copy( Eurydice_array_to_slice( (size_t)32U, key_pair->public_key.ind_cpa_public_key.seed_for_A, uint8_t), Eurydice_slice_subslice_from(ind_cpa_public_key, (size_t)1152U, uint8_t, size_t, uint8_t[]), uint8_t); d11940 2 a11941 1 Take a serialized private key and generate an unpacked key pair from it. d11944 2 a11945 2 A monomorphic instance of libcrux_ml_kem.ind_cca.instantiations.portable.unpacked.keypair_from_private_key a11947 4 - SECRET_KEY_SIZE= 2400 - CPA_SECRET_KEY_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 - T_AS_NTT_ENCODED_SIZE= 1152 d11949 3 a11951 7 static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_instantiations_portable_unpacked_keypair_from_private_key_fd( libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key, libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *key_pair) { libcrux_ml_kem_ind_cca_unpacked_keys_from_private_key_42(private_key, key_pair); d11955 10 a11964 1 Get an unpacked key from a private key. d11966 65 a12030 7 static inline void libcrux_ml_kem_mlkem768_portable_unpacked_key_pair_from_private_mut( libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key, libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *key_pair) { libcrux_ml_kem_ind_cca_instantiations_portable_unpacked_keypair_from_private_key_fd( private_key, key_pair); d12034 6 a12039 3 This function found in impl {libcrux_ml_kem::ind_cca::unpacked::MlKemKeyPairUnpacked[TraitClause@@0, TraitClause@@1]} d12042 4 a12045 3 A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.serialized_private_key_mut_11 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics d12050 3 d12054 9 a12062 4 static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_unpacked_serialized_private_key_mut_11_43( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *self, libcrux_ml_kem_types_MlKemPrivateKey_d9 *serialized) { d12064 1 a12064 3 libcrux_ml_kem_ind_cpa_serialize_unpacked_secret_key_6c( &self->public_key.ind_cpa_public_key, &self->private_key.ind_cpa_private_key); d12067 4 a12070 3 uint8_t ind_cpa_public_key[1184U]; memcpy(ind_cpa_public_key, uu____0.snd, (size_t)1184U * sizeof(uint8_t)); libcrux_ml_kem_ind_cca_serialize_kem_secret_key_mut_d6( d12072 14 a12085 4 Eurydice_array_to_slice((size_t)1184U, ind_cpa_public_key, uint8_t), Eurydice_array_to_slice( (size_t)32U, self->private_key.implicit_rejection_value, uint8_t), serialized->value); a12088 5 This function found in impl {libcrux_ml_kem::ind_cca::unpacked::MlKemKeyPairUnpacked[TraitClause@@0, TraitClause@@1]} */ /** d12090 2 a12091 2 libcrux_ml_kem.ind_cca.unpacked.serialized_private_key_11 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics d12096 3 d12100 7 a12106 7 static KRML_MUSTINLINE libcrux_ml_kem_types_MlKemPrivateKey_d9 libcrux_ml_kem_ind_cca_unpacked_serialized_private_key_11_43( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *self) { libcrux_ml_kem_types_MlKemPrivateKey_d9 sk = libcrux_ml_kem_types_default_d3_28(); libcrux_ml_kem_ind_cca_unpacked_serialized_private_key_mut_11_43(self, &sk); return sk; d12110 1 a12110 1 Get the serialized private key. d12112 8 a12119 5 static inline libcrux_ml_kem_types_MlKemPrivateKey_d9 libcrux_ml_kem_mlkem768_portable_unpacked_key_pair_serialized_private_key( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *key_pair) { return libcrux_ml_kem_ind_cca_unpacked_serialized_private_key_11_43(key_pair); d12123 1 a12123 9 Get the serialized private key. */ static inline void libcrux_ml_kem_mlkem768_portable_unpacked_key_pair_serialized_private_key_mut( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *key_pair, libcrux_ml_kem_types_MlKemPrivateKey_d9 *serialized) { libcrux_ml_kem_ind_cca_unpacked_serialized_private_key_mut_11_43(key_pair, serialized); } d12125 3 a12127 4 /** This function found in impl {libcrux_ml_kem::ind_cca::unpacked::MlKemPublicKeyUnpacked[TraitClause@@0, TraitClause@@1]} d12130 2 a12131 2 A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.serialized_dd with types libcrux_ml_kem_vector_portable_vector_type_PortableVector d12134 2 a12135 1 - PUBLIC_KEY_SIZE= 1184 d12137 14 a12150 10 static KRML_MUSTINLINE libcrux_ml_kem_types_MlKemPublicKey_30 libcrux_ml_kem_ind_cca_unpacked_serialized_dd_89( libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 *self) { uint8_t ret[1184U]; libcrux_ml_kem_ind_cpa_serialize_public_key_89( self->ind_cpa_public_key.t_as_ntt, Eurydice_array_to_slice((size_t)32U, self->ind_cpa_public_key.seed_for_A, uint8_t), ret); return libcrux_ml_kem_types_from_fd_d0(ret); d12154 1 a12154 3 This function found in impl {libcrux_ml_kem::ind_cca::unpacked::MlKemKeyPairUnpacked[TraitClause@@0, TraitClause@@1]} d12158 2 a12159 2 libcrux_ml_kem.ind_cca.unpacked.serialized_public_key_11 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics d12161 2 a12162 1 - PUBLIC_KEY_SIZE= 1184 d12164 6 a12169 4 static KRML_MUSTINLINE libcrux_ml_kem_types_MlKemPublicKey_30 libcrux_ml_kem_ind_cca_unpacked_serialized_public_key_11_89( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *self) { return libcrux_ml_kem_ind_cca_unpacked_serialized_dd_89(&self->public_key); d12173 3 a12175 1 Get the serialized public key. d12177 5 a12181 5 static inline libcrux_ml_kem_types_MlKemPublicKey_30 libcrux_ml_kem_mlkem768_portable_unpacked_key_pair_serialized_public_key( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *key_pair) { return libcrux_ml_kem_ind_cca_unpacked_serialized_public_key_11_89(key_pair); d12185 4 a12188 8 This function found in impl {libcrux_ml_kem::ind_cca::unpacked::MlKemPublicKeyUnpacked[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.serialized_mut_dd with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics a12189 1 - PUBLIC_KEY_SIZE= 1184 d12191 4 a12194 9 static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_unpacked_serialized_mut_dd_89( libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 *self, libcrux_ml_kem_types_MlKemPublicKey_30 *serialized) { libcrux_ml_kem_ind_cpa_serialize_public_key_mut_89( self->ind_cpa_public_key.t_as_ntt, Eurydice_array_to_slice((size_t)32U, self->ind_cpa_public_key.seed_for_A, uint8_t), serialized->value); d12198 4 a12201 3 This function found in impl {libcrux_ml_kem::ind_cca::unpacked::MlKemKeyPairUnpacked[TraitClause@@0, TraitClause@@1]} d12205 1 a12205 1 libcrux_ml_kem.ind_cca.unpacked.serialized_public_key_mut_11 with types d12207 1 a12208 1 - PUBLIC_KEY_SIZE= 1184 d12211 25 a12235 5 libcrux_ml_kem_ind_cca_unpacked_serialized_public_key_mut_11_89( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *self, libcrux_ml_kem_types_MlKemPublicKey_30 *serialized) { libcrux_ml_kem_ind_cca_unpacked_serialized_mut_dd_89(&self->public_key, serialized); d12239 1 a12239 9 Get the serialized public key. */ static inline void libcrux_ml_kem_mlkem768_portable_unpacked_key_pair_serialized_public_key_mut( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *key_pair, libcrux_ml_kem_types_MlKemPublicKey_30 *serialized) { libcrux_ml_kem_ind_cca_unpacked_serialized_public_key_mut_11_89(key_pair, serialized); } d12241 3 a12243 4 /** This function found in impl {core::clone::Clone for libcrux_ml_kem::ind_cpa::unpacked::IndCpaPublicKeyUnpacked[TraitClause@@0, TraitClause@@2]} d12246 1 a12246 1 A monomorphic instance of libcrux_ml_kem.ind_cpa.unpacked.clone_91 d12250 2 d12253 16 a12268 23 static inline libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 libcrux_ml_kem_ind_cpa_unpacked_clone_91_1b( libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 *self) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d uu____0[3U]; core_array__core__clone__Clone_for__Array_T__N___clone( (size_t)3U, self->t_as_ntt, uu____0, libcrux_ml_kem_polynomial_PolynomialRingElement_1d, void *); uint8_t uu____1[32U]; core_array__core__clone__Clone_for__Array_T__N___clone( (size_t)32U, self->seed_for_A, uu____1, uint8_t, void *); libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 lit; memcpy( lit.t_as_ntt, uu____0, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); memcpy(lit.seed_for_A, uu____1, (size_t)32U * sizeof(uint8_t)); libcrux_ml_kem_polynomial_PolynomialRingElement_1d ret[3U][3U]; core_array__core__clone__Clone_for__Array_T__N___clone( (size_t)3U, self->A, ret, libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U], void *); memcpy(lit.A, ret, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U])); return lit; d12272 1 a12272 3 This function found in impl {core::clone::Clone for libcrux_ml_kem::ind_cca::unpacked::MlKemPublicKeyUnpacked[TraitClause@@0, TraitClause@@2]} d12275 3 a12277 3 A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.clone_d7 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics d12279 2 d12282 4 a12285 11 static inline libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 libcrux_ml_kem_ind_cca_unpacked_clone_d7_1b( libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 *self) { libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 lit; lit.ind_cpa_public_key = libcrux_ml_kem_ind_cpa_unpacked_clone_91_1b(&self->ind_cpa_public_key); uint8_t ret[32U]; core_array__core__clone__Clone_for__Array_T__N___clone( (size_t)32U, self->public_key_hash, ret, uint8_t, void *); memcpy(lit.public_key_hash, ret, (size_t)32U * sizeof(uint8_t)); return lit; d12289 1 a12289 15 This function found in impl {libcrux_ml_kem::ind_cca::unpacked::MlKemKeyPairUnpacked[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.public_key_11 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 * libcrux_ml_kem_ind_cca_unpacked_public_key_11_1b( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *self) { return &self->public_key; } d12291 1 a12291 2 /** Get the unpacked public key. d12293 4 a12296 7 static inline void libcrux_ml_kem_mlkem768_portable_unpacked_public_key( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *key_pair, libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 *pk) { libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 uu____0 = libcrux_ml_kem_ind_cca_unpacked_clone_d7_1b( libcrux_ml_kem_ind_cca_unpacked_public_key_11_1b(key_pair)); pk[0U] = uu____0; d12300 2 a12301 1 Get the serialized public key. d12303 4 a12306 5 static inline void libcrux_ml_kem_mlkem768_portable_unpacked_serialized_public_key( libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 *public_key, libcrux_ml_kem_types_MlKemPublicKey_30 *serialized) { libcrux_ml_kem_ind_cca_unpacked_serialized_mut_dd_89(public_key, serialized); d12309 1 a12309 47 /** Generate an unpacked key from a serialized key. */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.unpack_public_key with types libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]], libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - T_AS_NTT_ENCODED_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_unpacked_unpack_public_key_0a( libcrux_ml_kem_types_MlKemPublicKey_30 *public_key, libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 *unpacked_public_key) { Eurydice_slice uu____0 = Eurydice_array_to_subslice_to((size_t)1184U, public_key->value, (size_t)1152U, uint8_t, size_t, uint8_t[]); libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_1b( uu____0, unpacked_public_key->ind_cpa_public_key.t_as_ntt); uint8_t uu____1[32U]; libcrux_ml_kem_utils_into_padded_array_9e( Eurydice_array_to_subslice_from((size_t)1184U, public_key->value, (size_t)1152U, uint8_t, size_t, uint8_t[]), uu____1); memcpy(unpacked_public_key->ind_cpa_public_key.seed_for_A, uu____1, (size_t)32U * sizeof(uint8_t)); libcrux_ml_kem_polynomial_PolynomialRingElement_1d(*uu____2)[3U] = unpacked_public_key->ind_cpa_public_key.A; uint8_t ret[34U]; libcrux_ml_kem_utils_into_padded_array_b6( Eurydice_array_to_subslice_from((size_t)1184U, public_key->value, (size_t)1152U, uint8_t, size_t, uint8_t[]), ret); libcrux_ml_kem_matrix_sample_matrix_A_2b(uu____2, ret, false); uint8_t uu____3[32U]; libcrux_ml_kem_hash_functions_portable_H_4a_e0( Eurydice_array_to_slice((size_t)1184U, libcrux_ml_kem_types_as_slice_e6_d0(public_key), uint8_t), uu____3); memcpy(unpacked_public_key->public_key_hash, uu____3, (size_t)32U * sizeof(uint8_t)); } d12311 2 a12312 19 /** Get the unpacked public key. */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.instantiations.portable.unpacked.unpack_public_key with const generics - K= 3 - T_AS_NTT_ENCODED_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_instantiations_portable_unpacked_unpack_public_key_31( libcrux_ml_kem_types_MlKemPublicKey_30 *public_key, libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 *unpacked_public_key) { libcrux_ml_kem_ind_cca_unpacked_unpack_public_key_0a(public_key, unpacked_public_key); } d12314 2 a12315 11 /** Get the unpacked public key. */ static inline void libcrux_ml_kem_mlkem768_portable_unpacked_unpacked_public_key( libcrux_ml_kem_types_MlKemPublicKey_30 *public_key, libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 *unpacked_public_key) { libcrux_ml_kem_ind_cca_instantiations_portable_unpacked_unpack_public_key_31( public_key, unpacked_public_key); } d12321 2 a12322 2 #define libcrux_mlkem768_portable_H_DEFINED #endif /* libcrux_mlkem768_portable_H */ d12327 3 a12329 2 #define libcrux_mlkem768_pk libcrux_ml_kem_types_MlKemPublicKey_30_s #define libcrux_mlkem768_sk libcrux_ml_kem_types_MlKemPrivateKey_d9_s d12331 1 a12331 1 #define libcrux_mlkem768_enc_result tuple_c2_s d12333 1 a12333 1 #define LIBCRUX_ML_KEM_KEY_PAIR_PRNG_LEN 64U @ 1.2.4.1 log @file libcrux_mlkem768_sha3.h was added on branch perseant-exfatfs on 2025-08-02 05:18:46 +0000 @ text @d1 12334 @ 1.2.4.2 log @Sync with HEAD @ text @a0 12334 /* $OpenBSD: libcrux_mlkem768_sha3.h,v 1.2 2024/10/27 02:06:01 djm Exp $ */ /* Extracted from libcrux revision 84c5d87b3092c59294345aa269ceefe0eb97cc35 */ /* * MIT License * * Copyright (c) 2024 Cryspen * * Permission is hereby granted, free of charge, to any person obtaining a copy * of this software and associated documentation files (the "Software"), to deal * in the Software without restriction, including without limitation the rights * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell * copies of the Software, and to permit persons to whom the Software is * furnished to do so, subject to the following conditions: * * The above copyright notice and this permission notice shall be included in all * copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE * SOFTWARE. */ #if !defined(__GNUC__) || (__GNUC__ < 2) # define __attribute__(x) #endif #define KRML_MUSTINLINE inline #define KRML_NOINLINE __attribute__((noinline, unused)) #define KRML_HOST_EPRINTF(...) #define KRML_HOST_EXIT(x) fatal_f("internal error") /* from libcrux/libcrux-ml-kem/cg/eurydice_glue.h */ /* * SPDX-FileCopyrightText: 2024 Eurydice Contributors * SPDX-FileCopyrightText: 2024 Cryspen Sarl * * SPDX-License-Identifier: MIT or Apache-2.0 */ #pragma once #if defined(__cplusplus) extern "C" { #endif // SLICES, ARRAYS, ETC. // The MSVC C++ compiler does not support compound literals. // This CLITERAL is used to turn `(type){...}` into `type{...}` when using a C++ // compiler. #if defined(__cplusplus) #define CLITERAL(type) type #else #define CLITERAL(type) (type) #endif // We represent a slice as a pair of an (untyped) pointer, along with the length // of the slice, i.e. the number of elements in the slice (this is NOT the // number of bytes). This design choice has two important consequences. // - if you need to use `ptr`, you MUST cast it to a proper type *before* // performing pointer // arithmetic on it (remember that C desugars pointer arithmetic based on the // type of the address) // - if you need to use `len` for a C style function (e.g. memcpy, memcmp), you // need to multiply it // by sizeof t, where t is the type of the elements. // // Empty slices have `len == 0` and `ptr` always needs to be valid pointer that // is not NULL (otherwise the construction in EURYDICE_SLICE computes `NULL + // start`). typedef struct { void *ptr; size_t len; } Eurydice_slice; // Helper macro to create a slice out of a pointer x, a start index in x // (included), and an end index in x (excluded). The argument x must be suitably // cast to something that can decay (see remark above about how pointer // arithmetic works in C), meaning either pointer or array type. #define EURYDICE_SLICE(x, start, end) \ (CLITERAL(Eurydice_slice){.ptr = (void *)(x + start), .len = end - start}) #define EURYDICE_SLICE_LEN(s, _) s.len // This macro is a pain because in case the dereferenced element type is an // array, you cannot simply write `t x` as it would yield `int[4] x` instead, // which is NOT correct C syntax, so we add a dedicated phase in Eurydice that // adds an extra argument to this macro at the last minute so that we have the // correct type of *pointers* to elements. #define Eurydice_slice_index(s, i, t, t_ptr_t) (((t_ptr_t)s.ptr)[i]) #define Eurydice_slice_subslice(s, r, t, _) \ EURYDICE_SLICE((t *)s.ptr, r.start, r.end) // Variant for when the start and end indices are statically known (i.e., the // range argument `r` is a literal). #define Eurydice_slice_subslice2(s, start, end, t) \ EURYDICE_SLICE((t *)s.ptr, start, end) #define Eurydice_slice_subslice_to(s, subslice_end_pos, t, _) \ EURYDICE_SLICE((t *)s.ptr, 0, subslice_end_pos) #define Eurydice_slice_subslice_from(s, subslice_start_pos, t, _) \ EURYDICE_SLICE((t *)s.ptr, subslice_start_pos, s.len) #define Eurydice_array_to_slice(end, x, t) \ EURYDICE_SLICE(x, 0, \ end) /* x is already at an array type, no need for cast */ #define Eurydice_array_to_subslice(_arraylen, x, r, t, _) \ EURYDICE_SLICE((t *)x, r.start, r.end) // Same as above, variant for when start and end are statically known #define Eurydice_array_to_subslice2(x, start, end, t) \ EURYDICE_SLICE((t *)x, start, end) #define Eurydice_array_to_subslice_to(_size, x, r, t, _range_t) \ EURYDICE_SLICE((t *)x, 0, r) #define Eurydice_array_to_subslice_from(size, x, r, t, _range_t) \ EURYDICE_SLICE((t *)x, r, size) #define Eurydice_slice_len(s, t) EURYDICE_SLICE_LEN(s, t) #define Eurydice_slice_copy(dst, src, t) \ memcpy(dst.ptr, src.ptr, dst.len * sizeof(t)) #define core_array___Array_T__N__23__as_slice(len_, ptr_, t, _ret_t) \ ((Eurydice_slice){.ptr = ptr_, .len = len_}) #define core_array___core__clone__Clone_for__Array_T__N___20__clone( \ len, src, dst, elem_type, _ret_t) \ (memcpy(dst, src, len * sizeof(elem_type))) #define TryFromSliceError uint8_t #define Eurydice_array_eq(sz, a1, a2, t, _) \ (memcmp(a1, a2, sz * sizeof(t)) == 0) #define core_array_equality___core__cmp__PartialEq__Array_U__N___for__Array_T__N____eq( \ sz, a1, a2, t, _, _ret_t) \ Eurydice_array_eq(sz, a1, a2, t, _) #define core_array_equality___core__cmp__PartialEq__0___Slice_U____for__Array_T__N___3__eq( \ sz, a1, a2, t, _, _ret_t) \ Eurydice_array_eq(sz, a1, ((a2)->ptr), t, _) #define Eurydice_slice_split_at(slice, mid, element_type, ret_t) \ (CLITERAL(ret_t){ \ .fst = EURYDICE_SLICE((element_type *)slice.ptr, 0, mid), \ .snd = EURYDICE_SLICE((element_type *)slice.ptr, mid, slice.len)}) #define Eurydice_slice_split_at_mut(slice, mid, element_type, ret_t) \ (CLITERAL(ret_t){ \ .fst = {.ptr = slice.ptr, .len = mid}, \ .snd = {.ptr = (char *)slice.ptr + mid * sizeof(element_type), \ .len = slice.len - mid}}) // Conversion of slice to an array, rewritten (by Eurydice) to name the // destination array, since arrays are not values in C. // N.B.: see note in karamel/lib/Inlining.ml if you change this. #define Eurydice_slice_to_array2(dst, src, _, t_arr) \ Eurydice_slice_to_array3(&(dst)->tag, (char *)&(dst)->val.case_Ok, src, \ sizeof(t_arr)) static inline void Eurydice_slice_to_array3(uint8_t *dst_tag, char *dst_ok, Eurydice_slice src, size_t sz) { *dst_tag = 0; memcpy(dst_ok, src.ptr, sz); } // CORE STUFF (conversions, endianness, ...) static inline void core_num__u64_9__to_le_bytes(uint64_t v, uint8_t buf[8]) { v = htole64(v); memcpy(buf, &v, sizeof(v)); } static inline uint64_t core_num__u64_9__from_le_bytes(uint8_t buf[8]) { uint64_t v; memcpy(&v, buf, sizeof(v)); return le64toh(v); } static inline uint32_t core_num__u32_8__from_le_bytes(uint8_t buf[4]) { uint32_t v; memcpy(&v, buf, sizeof(v)); return le32toh(v); } static inline uint32_t core_num__u8_6__count_ones(uint8_t x0) { #ifdef _MSC_VER return __popcnt(x0); #else return __builtin_popcount(x0); #endif } // unsigned overflow wraparound semantics in C static inline uint16_t core_num__u16_7__wrapping_add(uint16_t x, uint16_t y) { return x + y; } static inline uint8_t core_num__u8_6__wrapping_sub(uint8_t x, uint8_t y) { return x - y; } // ITERATORS #define Eurydice_range_iter_next(iter_ptr, t, ret_t) \ (((iter_ptr)->start == (iter_ptr)->end) \ ? (CLITERAL(ret_t){.tag = None}) \ : (CLITERAL(ret_t){.tag = Some, .f0 = (iter_ptr)->start++})) #define core_iter_range___core__iter__traits__iterator__Iterator_for_core__ops__range__Range_A___6__next \ Eurydice_range_iter_next // See note in karamel/lib/Inlining.ml if you change this #define Eurydice_into_iter(x, t, _ret_t) (x) #define core_iter_traits_collect___core__iter__traits__collect__IntoIterator_for_I__1__into_iter \ Eurydice_into_iter #if defined(__cplusplus) } #endif /* from libcrux/libcrux-ml-kem/cg/libcrux_core.h */ /* * SPDX-FileCopyrightText: 2024 Cryspen Sarl * * SPDX-License-Identifier: MIT or Apache-2.0 * * This code was generated with the following revisions: * Charon: 6b5e110342a771a3e1c739b10294b1778e4be8b4 * Eurydice: 31be7d65ca5d6acdacfb33652e478d24dd85c1cb * Karamel: 3205d3365ea2790b02368f79fcee38e38d0b5908 * F*: a32b316e521fa4f239b610ec8f1d15e78d62cbe8-dirty * Libcrux: 4ad532b206174114dd4140b718e7794a28fc59ee */ #ifndef __libcrux_core_H #define __libcrux_core_H #if defined(__cplusplus) extern "C" { #endif /** A monomorphic instance of core.ops.range.Range with types size_t */ typedef struct core_ops_range_Range_b3_s { size_t start; size_t end; } core_ops_range_Range_b3; #define Ok 0 #define Err 1 typedef uint8_t Result_86_tags; #define None 0 #define Some 1 typedef uint8_t Option_ef_tags; /** A monomorphic instance of core.option.Option with types size_t */ typedef struct Option_b3_s { Option_ef_tags tag; size_t f0; } Option_b3; static inline uint16_t core_num__u16_7__wrapping_add(uint16_t x0, uint16_t x1); #define CORE_NUM__U32_8__BITS (32U) static inline uint64_t core_num__u64_9__from_le_bytes(uint8_t x0[8U]); static inline void core_num__u64_9__to_le_bytes(uint64_t x0, uint8_t x1[8U]); static inline uint32_t core_num__u8_6__count_ones(uint8_t x0); static inline uint8_t core_num__u8_6__wrapping_sub(uint8_t x0, uint8_t x1); #define LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE ((size_t)32U) #define LIBCRUX_ML_KEM_CONSTANTS_BITS_PER_COEFFICIENT ((size_t)12U) #define LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT ((size_t)256U) #define LIBCRUX_ML_KEM_CONSTANTS_BITS_PER_RING_ELEMENT \ (LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT * (size_t)12U) #define LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT \ (LIBCRUX_ML_KEM_CONSTANTS_BITS_PER_RING_ELEMENT / (size_t)8U) #define LIBCRUX_ML_KEM_CONSTANTS_CPA_PKE_KEY_GENERATION_SEED_SIZE ((size_t)32U) #define LIBCRUX_ML_KEM_CONSTANTS_H_DIGEST_SIZE ((size_t)32U) typedef struct libcrux_ml_kem_utils_extraction_helper_Keypair768_s { uint8_t fst[1152U]; uint8_t snd[1184U]; } libcrux_ml_kem_utils_extraction_helper_Keypair768; /** A monomorphic instance of core.result.Result with types uint8_t[24size_t], core_array_TryFromSliceError */ typedef struct Result_6f_s { Result_86_tags tag; union { uint8_t case_Ok[24U]; TryFromSliceError case_Err; } val; } Result_6f; /** This function found in impl {core::result::Result} */ /** A monomorphic instance of core.result.unwrap_41 with types uint8_t[24size_t], core_array_TryFromSliceError */ static inline void unwrap_41_1c(Result_6f self, uint8_t ret[24U]) { if (self.tag == Ok) { uint8_t f0[24U]; memcpy(f0, self.val.case_Ok, (size_t)24U * sizeof(uint8_t)); memcpy(ret, f0, (size_t)24U * sizeof(uint8_t)); } else { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "unwrap not Ok"); KRML_HOST_EXIT(255U); } } /** A monomorphic instance of core.result.Result with types uint8_t[20size_t], core_array_TryFromSliceError */ typedef struct Result_7a_s { Result_86_tags tag; union { uint8_t case_Ok[20U]; TryFromSliceError case_Err; } val; } Result_7a; /** This function found in impl {core::result::Result} */ /** A monomorphic instance of core.result.unwrap_41 with types uint8_t[20size_t], core_array_TryFromSliceError */ static inline void unwrap_41_34(Result_7a self, uint8_t ret[20U]) { if (self.tag == Ok) { uint8_t f0[20U]; memcpy(f0, self.val.case_Ok, (size_t)20U * sizeof(uint8_t)); memcpy(ret, f0, (size_t)20U * sizeof(uint8_t)); } else { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "unwrap not Ok"); KRML_HOST_EXIT(255U); } } /** A monomorphic instance of core.result.Result with types uint8_t[10size_t], core_array_TryFromSliceError */ typedef struct Result_cd_s { Result_86_tags tag; union { uint8_t case_Ok[10U]; TryFromSliceError case_Err; } val; } Result_cd; /** This function found in impl {core::result::Result} */ /** A monomorphic instance of core.result.unwrap_41 with types uint8_t[10size_t], core_array_TryFromSliceError */ static inline void unwrap_41_e8(Result_cd self, uint8_t ret[10U]) { if (self.tag == Ok) { uint8_t f0[10U]; memcpy(f0, self.val.case_Ok, (size_t)10U * sizeof(uint8_t)); memcpy(ret, f0, (size_t)10U * sizeof(uint8_t)); } else { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "unwrap not Ok"); KRML_HOST_EXIT(255U); } } typedef struct Eurydice_slice_uint8_t_4size_t__x2_s { Eurydice_slice fst[4U]; Eurydice_slice snd[4U]; } Eurydice_slice_uint8_t_4size_t__x2; typedef struct libcrux_ml_kem_mlkem768_MlKem768Ciphertext_s { uint8_t value[1088U]; } libcrux_ml_kem_mlkem768_MlKem768Ciphertext; /** A reference to the raw byte slice. */ /** This function found in impl {libcrux_ml_kem::types::MlKemCiphertext#6} */ /** A monomorphic instance of libcrux_ml_kem.types.as_slice_d4 with const generics - SIZE= 1088 */ static inline uint8_t *libcrux_ml_kem_types_as_slice_d4_1d( libcrux_ml_kem_mlkem768_MlKem768Ciphertext *self) { return self->value; } /** A monomorphic instance of libcrux_ml_kem.types.MlKemPublicKey with const generics - $1184size_t */ typedef struct libcrux_ml_kem_types_MlKemPublicKey_15_s { uint8_t value[1184U]; } libcrux_ml_kem_types_MlKemPublicKey_15; /** This function found in impl {(core::convert::From<@@Array> for libcrux_ml_kem::types::MlKemPublicKey)#14} */ /** A monomorphic instance of libcrux_ml_kem.types.from_b6 with const generics - SIZE= 1184 */ static inline libcrux_ml_kem_types_MlKemPublicKey_15 libcrux_ml_kem_types_from_b6_da(uint8_t value[1184U]) { /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_value[1184U]; memcpy(copy_of_value, value, (size_t)1184U * sizeof(uint8_t)); libcrux_ml_kem_types_MlKemPublicKey_15 lit; memcpy(lit.value, copy_of_value, (size_t)1184U * sizeof(uint8_t)); return lit; } /** A monomorphic instance of libcrux_ml_kem.types.MlKemPrivateKey with const generics - $2400size_t */ typedef struct libcrux_ml_kem_types_MlKemPrivateKey_55_s { uint8_t value[2400U]; } libcrux_ml_kem_types_MlKemPrivateKey_55; typedef struct libcrux_ml_kem_mlkem768_MlKem768KeyPair_s { libcrux_ml_kem_types_MlKemPrivateKey_55 sk; libcrux_ml_kem_types_MlKemPublicKey_15 pk; } libcrux_ml_kem_mlkem768_MlKem768KeyPair; /** Create a new [`MlKemKeyPair`] from the secret and public key. */ /** This function found in impl {libcrux_ml_kem::types::MlKemKeyPair} */ /** A monomorphic instance of libcrux_ml_kem.types.from_17 with const generics - PRIVATE_KEY_SIZE= 2400 - PUBLIC_KEY_SIZE= 1184 */ static inline libcrux_ml_kem_mlkem768_MlKem768KeyPair libcrux_ml_kem_types_from_17_35(libcrux_ml_kem_types_MlKemPrivateKey_55 sk, libcrux_ml_kem_types_MlKemPublicKey_15 pk) { return ( CLITERAL(libcrux_ml_kem_mlkem768_MlKem768KeyPair){.sk = sk, .pk = pk}); } /** This function found in impl {(core::convert::From<@@Array> for libcrux_ml_kem::types::MlKemPrivateKey)#8} */ /** A monomorphic instance of libcrux_ml_kem.types.from_05 with const generics - SIZE= 2400 */ static inline libcrux_ml_kem_types_MlKemPrivateKey_55 libcrux_ml_kem_types_from_05_f2(uint8_t value[2400U]) { /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_value[2400U]; memcpy(copy_of_value, value, (size_t)2400U * sizeof(uint8_t)); libcrux_ml_kem_types_MlKemPrivateKey_55 lit; memcpy(lit.value, copy_of_value, (size_t)2400U * sizeof(uint8_t)); return lit; } /** A monomorphic instance of core.result.Result with types uint8_t[32size_t], core_array_TryFromSliceError */ typedef struct Result_00_s { Result_86_tags tag; union { uint8_t case_Ok[32U]; TryFromSliceError case_Err; } val; } Result_00; /** This function found in impl {core::result::Result} */ /** A monomorphic instance of core.result.unwrap_41 with types uint8_t[32size_t], core_array_TryFromSliceError */ static inline void unwrap_41_83(Result_00 self, uint8_t ret[32U]) { if (self.tag == Ok) { uint8_t f0[32U]; memcpy(f0, self.val.case_Ok, (size_t)32U * sizeof(uint8_t)); memcpy(ret, f0, (size_t)32U * sizeof(uint8_t)); } else { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "unwrap not Ok"); KRML_HOST_EXIT(255U); } } /** A monomorphic instance of K. with types libcrux_ml_kem_types_MlKemCiphertext[[$1088size_t]], uint8_t[32size_t] */ typedef struct tuple_3c_s { libcrux_ml_kem_mlkem768_MlKem768Ciphertext fst; uint8_t snd[32U]; } tuple_3c; /** This function found in impl {(core::convert::From<@@Array> for libcrux_ml_kem::types::MlKemCiphertext)#2} */ /** A monomorphic instance of libcrux_ml_kem.types.from_01 with const generics - SIZE= 1088 */ static inline libcrux_ml_kem_mlkem768_MlKem768Ciphertext libcrux_ml_kem_types_from_01_9f(uint8_t value[1088U]) { /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_value[1088U]; memcpy(copy_of_value, value, (size_t)1088U * sizeof(uint8_t)); libcrux_ml_kem_mlkem768_MlKem768Ciphertext lit; memcpy(lit.value, copy_of_value, (size_t)1088U * sizeof(uint8_t)); return lit; } /** A reference to the raw byte slice. */ /** This function found in impl {libcrux_ml_kem::types::MlKemPublicKey#18} */ /** A monomorphic instance of libcrux_ml_kem.types.as_slice_cb with const generics - SIZE= 1184 */ static inline uint8_t *libcrux_ml_kem_types_as_slice_cb_50( libcrux_ml_kem_types_MlKemPublicKey_15 *self) { return self->value; } /** Pad the `slice` with `0`s at the end. */ /** A monomorphic instance of libcrux_ml_kem.utils.into_padded_array with const generics - LEN= 33 */ static KRML_MUSTINLINE void libcrux_ml_kem_utils_into_padded_array_ea2( Eurydice_slice slice, uint8_t ret[33U]) { uint8_t out[33U] = {0U}; uint8_t *uu____0 = out; Eurydice_slice_copy( Eurydice_array_to_subslice2(uu____0, (size_t)0U, Eurydice_slice_len(slice, uint8_t), uint8_t), slice, uint8_t); memcpy(ret, out, (size_t)33U * sizeof(uint8_t)); } /** Pad the `slice` with `0`s at the end. */ /** A monomorphic instance of libcrux_ml_kem.utils.into_padded_array with const generics - LEN= 34 */ static KRML_MUSTINLINE void libcrux_ml_kem_utils_into_padded_array_ea1( Eurydice_slice slice, uint8_t ret[34U]) { uint8_t out[34U] = {0U}; uint8_t *uu____0 = out; Eurydice_slice_copy( Eurydice_array_to_subslice2(uu____0, (size_t)0U, Eurydice_slice_len(slice, uint8_t), uint8_t), slice, uint8_t); memcpy(ret, out, (size_t)34U * sizeof(uint8_t)); } /** This function found in impl {(core::convert::AsRef<@@Slice> for libcrux_ml_kem::types::MlKemCiphertext)#1} */ /** A monomorphic instance of libcrux_ml_kem.types.as_ref_00 with const generics - SIZE= 1088 */ static inline Eurydice_slice libcrux_ml_kem_types_as_ref_00_24( libcrux_ml_kem_mlkem768_MlKem768Ciphertext *self) { return Eurydice_array_to_slice((size_t)1088U, self->value, uint8_t); } /** Pad the `slice` with `0`s at the end. */ /** A monomorphic instance of libcrux_ml_kem.utils.into_padded_array with const generics - LEN= 1120 */ static KRML_MUSTINLINE void libcrux_ml_kem_utils_into_padded_array_ea0( Eurydice_slice slice, uint8_t ret[1120U]) { uint8_t out[1120U] = {0U}; uint8_t *uu____0 = out; Eurydice_slice_copy( Eurydice_array_to_subslice2(uu____0, (size_t)0U, Eurydice_slice_len(slice, uint8_t), uint8_t), slice, uint8_t); memcpy(ret, out, (size_t)1120U * sizeof(uint8_t)); } /** Pad the `slice` with `0`s at the end. */ /** A monomorphic instance of libcrux_ml_kem.utils.into_padded_array with const generics - LEN= 64 */ static KRML_MUSTINLINE void libcrux_ml_kem_utils_into_padded_array_ea( Eurydice_slice slice, uint8_t ret[64U]) { uint8_t out[64U] = {0U}; uint8_t *uu____0 = out; Eurydice_slice_copy( Eurydice_array_to_subslice2(uu____0, (size_t)0U, Eurydice_slice_len(slice, uint8_t), uint8_t), slice, uint8_t); memcpy(ret, out, (size_t)64U * sizeof(uint8_t)); } /** A monomorphic instance of core.result.Result with types int16_t[16size_t], core_array_TryFromSliceError */ typedef struct Result_c0_s { Result_86_tags tag; union { int16_t case_Ok[16U]; TryFromSliceError case_Err; } val; } Result_c0; /** This function found in impl {core::result::Result} */ /** A monomorphic instance of core.result.unwrap_41 with types int16_t[16size_t], core_array_TryFromSliceError */ static inline void unwrap_41_f9(Result_c0 self, int16_t ret[16U]) { if (self.tag == Ok) { int16_t f0[16U]; memcpy(f0, self.val.case_Ok, (size_t)16U * sizeof(int16_t)); memcpy(ret, f0, (size_t)16U * sizeof(int16_t)); } else { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "unwrap not Ok"); KRML_HOST_EXIT(255U); } } /** A monomorphic instance of core.result.Result with types uint8_t[8size_t], core_array_TryFromSliceError */ typedef struct Result_56_s { Result_86_tags tag; union { uint8_t case_Ok[8U]; TryFromSliceError case_Err; } val; } Result_56; /** This function found in impl {core::result::Result} */ /** A monomorphic instance of core.result.unwrap_41 with types uint8_t[8size_t], core_array_TryFromSliceError */ static inline void unwrap_41_ac(Result_56 self, uint8_t ret[8U]) { if (self.tag == Ok) { uint8_t f0[8U]; memcpy(f0, self.val.case_Ok, (size_t)8U * sizeof(uint8_t)); memcpy(ret, f0, (size_t)8U * sizeof(uint8_t)); } else { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "unwrap not Ok"); KRML_HOST_EXIT(255U); } } typedef struct Eurydice_slice_uint8_t_x2_s { Eurydice_slice fst; Eurydice_slice snd; } Eurydice_slice_uint8_t_x2; typedef struct Eurydice_slice_uint8_t_1size_t__x2_s { Eurydice_slice fst[1U]; Eurydice_slice snd[1U]; } Eurydice_slice_uint8_t_1size_t__x2; #if defined(__cplusplus) } #endif #define __libcrux_core_H_DEFINED #endif /* from libcrux/libcrux-ml-kem/cg/libcrux_ct_ops.h */ /* * SPDX-FileCopyrightText: 2024 Cryspen Sarl * * SPDX-License-Identifier: MIT or Apache-2.0 * * This code was generated with the following revisions: * Charon: 6b5e110342a771a3e1c739b10294b1778e4be8b4 * Eurydice: 31be7d65ca5d6acdacfb33652e478d24dd85c1cb * Karamel: 3205d3365ea2790b02368f79fcee38e38d0b5908 * F*: a32b316e521fa4f239b610ec8f1d15e78d62cbe8-dirty * Libcrux: 4ad532b206174114dd4140b718e7794a28fc59ee */ #ifndef __libcrux_ct_ops_H #define __libcrux_ct_ops_H #if defined(__cplusplus) extern "C" { #endif /** Return 1 if `value` is not zero and 0 otherwise. */ static inline uint8_t libcrux_ml_kem_constant_time_ops_inz(uint8_t value) { uint16_t value0 = (uint16_t)value; uint16_t result = (((uint32_t)value0 | (uint32_t)core_num__u16_7__wrapping_add(~value0, 1U)) & 0xFFFFU) >> 8U & 1U; return (uint8_t)result; } static KRML_NOINLINE uint8_t libcrux_ml_kem_constant_time_ops_is_non_zero(uint8_t value) { return libcrux_ml_kem_constant_time_ops_inz(value); } /** Return 1 if the bytes of `lhs` and `rhs` do not exactly match and 0 otherwise. */ static inline uint8_t libcrux_ml_kem_constant_time_ops_compare( Eurydice_slice lhs, Eurydice_slice rhs) { uint8_t r = 0U; for (size_t i = (size_t)0U; i < Eurydice_slice_len(lhs, uint8_t); i++) { size_t i0 = i; r = (uint32_t)r | ((uint32_t)Eurydice_slice_index(lhs, i0, uint8_t, uint8_t *) ^ (uint32_t)Eurydice_slice_index(rhs, i0, uint8_t, uint8_t *)); } return libcrux_ml_kem_constant_time_ops_is_non_zero(r); } static KRML_NOINLINE uint8_t libcrux_ml_kem_constant_time_ops_compare_ciphertexts_in_constant_time( Eurydice_slice lhs, Eurydice_slice rhs) { return libcrux_ml_kem_constant_time_ops_compare(lhs, rhs); } /** If `selector` is not zero, return the bytes in `rhs`; return the bytes in `lhs` otherwise. */ static inline void libcrux_ml_kem_constant_time_ops_select_ct( Eurydice_slice lhs, Eurydice_slice rhs, uint8_t selector, uint8_t ret[32U]) { uint8_t mask = core_num__u8_6__wrapping_sub( libcrux_ml_kem_constant_time_ops_is_non_zero(selector), 1U); uint8_t out[32U] = {0U}; for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE; i++) { size_t i0 = i; out[i0] = ((uint32_t)Eurydice_slice_index(lhs, i0, uint8_t, uint8_t *) & (uint32_t)mask) | ((uint32_t)Eurydice_slice_index(rhs, i0, uint8_t, uint8_t *) & (uint32_t)~mask); } memcpy(ret, out, (size_t)32U * sizeof(uint8_t)); } static KRML_NOINLINE void libcrux_ml_kem_constant_time_ops_select_shared_secret_in_constant_time( Eurydice_slice lhs, Eurydice_slice rhs, uint8_t selector, uint8_t ret[32U]) { libcrux_ml_kem_constant_time_ops_select_ct(lhs, rhs, selector, ret); } static inline void libcrux_ml_kem_constant_time_ops_compare_ciphertexts_select_shared_secret_in_constant_time( Eurydice_slice lhs_c, Eurydice_slice rhs_c, Eurydice_slice lhs_s, Eurydice_slice rhs_s, uint8_t ret[32U]) { uint8_t selector = libcrux_ml_kem_constant_time_ops_compare_ciphertexts_in_constant_time( lhs_c, rhs_c); uint8_t ret0[32U]; libcrux_ml_kem_constant_time_ops_select_shared_secret_in_constant_time( lhs_s, rhs_s, selector, ret0); memcpy(ret, ret0, (size_t)32U * sizeof(uint8_t)); } #if defined(__cplusplus) } #endif #define __libcrux_ct_ops_H_DEFINED #endif /* from libcrux/libcrux-ml-kem/cg/libcrux_sha3_portable.h */ /* * SPDX-FileCopyrightText: 2024 Cryspen Sarl * * SPDX-License-Identifier: MIT or Apache-2.0 * * This code was generated with the following revisions: * Charon: 6b5e110342a771a3e1c739b10294b1778e4be8b4 * Eurydice: 31be7d65ca5d6acdacfb33652e478d24dd85c1cb * Karamel: 3205d3365ea2790b02368f79fcee38e38d0b5908 * F*: a32b316e521fa4f239b610ec8f1d15e78d62cbe8-dirty * Libcrux: 4ad532b206174114dd4140b718e7794a28fc59ee */ #ifndef __libcrux_sha3_portable_H #define __libcrux_sha3_portable_H #if defined(__cplusplus) extern "C" { #endif static const uint64_t libcrux_sha3_generic_keccak_ROUNDCONSTANTS[24U] = { 1ULL, 32898ULL, 9223372036854808714ULL, 9223372039002292224ULL, 32907ULL, 2147483649ULL, 9223372039002292353ULL, 9223372036854808585ULL, 138ULL, 136ULL, 2147516425ULL, 2147483658ULL, 2147516555ULL, 9223372036854775947ULL, 9223372036854808713ULL, 9223372036854808579ULL, 9223372036854808578ULL, 9223372036854775936ULL, 32778ULL, 9223372039002259466ULL, 9223372039002292353ULL, 9223372036854808704ULL, 2147483649ULL, 9223372039002292232ULL}; /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_zero_5a(void) { return 0ULL; } static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak__veor5q_u64( uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e) { uint64_t ab = a ^ b; uint64_t cd = c ^ d; uint64_t abcd = ab ^ cd; return abcd ^ e; } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_xor5_5a( uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e) { return libcrux_sha3_portable_keccak__veor5q_u64(a, b, c, d, e); } /** A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left with const generics - LEFT= 1 - RIGHT= 63 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_rotate_left_cb(uint64_t x) { return x << (uint32_t)(int32_t)1 | x >> (uint32_t)(int32_t)63; } static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak__vrax1q_u64(uint64_t a, uint64_t b) { uint64_t uu____0 = a; return uu____0 ^ libcrux_sha3_portable_keccak_rotate_left_cb(b); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_rotate_left1_and_xor_5a(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vrax1q_u64(a, b); } static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak__vbcaxq_u64(uint64_t a, uint64_t b, uint64_t c) { return a ^ (b & ~c); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_and_not_xor_5a( uint64_t a, uint64_t b, uint64_t c) { return libcrux_sha3_portable_keccak__vbcaxq_u64(a, b, c); } static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak__veorq_n_u64(uint64_t a, uint64_t c) { return a ^ c; } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_xor_constant_5a(uint64_t a, uint64_t c) { return libcrux_sha3_portable_keccak__veorq_n_u64(a, c); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_xor_5a(uint64_t a, uint64_t b) { return a ^ b; } static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_slice_1( Eurydice_slice a[1U], size_t start, size_t len, Eurydice_slice ret[1U]) { ret[0U] = Eurydice_slice_subslice2(a[0U], start, start + len, uint8_t); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_slice_n_5a( Eurydice_slice a[1U], size_t start, size_t len, Eurydice_slice ret[1U]) { /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_a[1U]; memcpy(copy_of_a, a, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice ret0[1U]; libcrux_sha3_portable_keccak_slice_1(copy_of_a, start, len, ret0); memcpy(ret, ret0, (size_t)1U * sizeof(Eurydice_slice)); } static KRML_MUSTINLINE Eurydice_slice_uint8_t_1size_t__x2 libcrux_sha3_portable_keccak_split_at_mut_1(Eurydice_slice out[1U], size_t mid) { Eurydice_slice_uint8_t_x2 uu____0 = Eurydice_slice_split_at_mut( out[0U], mid, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice out00 = uu____0.fst; Eurydice_slice out01 = uu____0.snd; Eurydice_slice_uint8_t_1size_t__x2 lit; lit.fst[0U] = out00; lit.snd[0U] = out01; return lit; } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ static KRML_MUSTINLINE Eurydice_slice_uint8_t_1size_t__x2 libcrux_sha3_portable_keccak_split_at_mut_n_5a(Eurydice_slice a[1U], size_t mid) { return libcrux_sha3_portable_keccak_split_at_mut_1(a, mid); } /** A monomorphic instance of libcrux_sha3.generic_keccak.KeccakState with types uint64_t with const generics - $1size_t */ typedef struct libcrux_sha3_generic_keccak_KeccakState_48_s { uint64_t st[5U][5U]; } libcrux_sha3_generic_keccak_KeccakState_48; /** Create a new Shake128 x4 state. */ /** This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0]#1} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.new_1e with types uint64_t with const generics - N= 1 */ static KRML_MUSTINLINE libcrux_sha3_generic_keccak_KeccakState_48 libcrux_sha3_generic_keccak_new_1e_f4(void) { libcrux_sha3_generic_keccak_KeccakState_48 lit; lit.st[0U][0U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[0U][1U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[0U][2U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[0U][3U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[0U][4U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[1U][0U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[1U][1U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[1U][2U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[1U][3U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[1U][4U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[2U][0U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[2U][1U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[2U][2U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[2U][3U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[2U][4U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[3U][0U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[3U][1U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[3U][2U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[3U][3U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[3U][4U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[4U][0U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[4U][1U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[4U][2U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[4U][3U] = libcrux_sha3_portable_keccak_zero_5a(); lit.st[4U][4U] = libcrux_sha3_portable_keccak_zero_5a(); return lit; } /** A monomorphic instance of libcrux_sha3.portable_keccak.load_block with const generics - RATE= 72 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_2c( uint64_t (*s)[5U], Eurydice_slice blocks[1U]) { for (size_t i = (size_t)0U; i < (size_t)72U / (size_t)8U; i++) { size_t i0 = i; uint8_t uu____0[8U]; Result_56 dst; Eurydice_slice_to_array2( &dst, Eurydice_slice_subslice2(blocks[0U], (size_t)8U * i0, (size_t)8U * i0 + (size_t)8U, uint8_t), Eurydice_slice, uint8_t[8U]); unwrap_41_ac(dst, uu____0); size_t uu____1 = i0 / (size_t)5U; size_t uu____2 = i0 % (size_t)5U; s[uu____1][uu____2] = s[uu____1][uu____2] ^ core_num__u64_9__from_le_bytes(uu____0); } } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.load_block_5a with const generics - RATE= 72 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_5a_b8( uint64_t (*a)[5U], Eurydice_slice b[1U]) { uint64_t(*uu____0)[5U] = a; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_b[1U]; memcpy(copy_of_b, b, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_portable_keccak_load_block_2c(uu____0, copy_of_b); } /** A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left with const generics - LEFT= 36 - RIGHT= 28 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_rotate_left_cb0(uint64_t x) { return x << (uint32_t)(int32_t)36 | x >> (uint32_t)(int32_t)28; } /** A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 with const generics - LEFT= 36 - RIGHT= 28 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak__vxarq_u64_42(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb0(ab); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a with const generics - LEFT= 36 - RIGHT= 28 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_42(a, b); } /** A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left with const generics - LEFT= 3 - RIGHT= 61 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_rotate_left_cb1(uint64_t x) { return x << (uint32_t)(int32_t)3 | x >> (uint32_t)(int32_t)61; } /** A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 with const generics - LEFT= 3 - RIGHT= 61 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak__vxarq_u64_420(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb1(ab); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a with const generics - LEFT= 3 - RIGHT= 61 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb0(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_420(a, b); } /** A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left with const generics - LEFT= 41 - RIGHT= 23 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_rotate_left_cb2(uint64_t x) { return x << (uint32_t)(int32_t)41 | x >> (uint32_t)(int32_t)23; } /** A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 with const generics - LEFT= 41 - RIGHT= 23 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak__vxarq_u64_421(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb2(ab); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a with const generics - LEFT= 41 - RIGHT= 23 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb1(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_421(a, b); } /** A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left with const generics - LEFT= 18 - RIGHT= 46 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_rotate_left_cb3(uint64_t x) { return x << (uint32_t)(int32_t)18 | x >> (uint32_t)(int32_t)46; } /** A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 with const generics - LEFT= 18 - RIGHT= 46 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak__vxarq_u64_422(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb3(ab); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a with const generics - LEFT= 18 - RIGHT= 46 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb2(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_422(a, b); } /** A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 with const generics - LEFT= 1 - RIGHT= 63 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak__vxarq_u64_423(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb(ab); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a with const generics - LEFT= 1 - RIGHT= 63 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb3(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_423(a, b); } /** A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left with const generics - LEFT= 44 - RIGHT= 20 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_rotate_left_cb4(uint64_t x) { return x << (uint32_t)(int32_t)44 | x >> (uint32_t)(int32_t)20; } /** A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 with const generics - LEFT= 44 - RIGHT= 20 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak__vxarq_u64_424(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb4(ab); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a with const generics - LEFT= 44 - RIGHT= 20 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb4(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_424(a, b); } /** A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left with const generics - LEFT= 10 - RIGHT= 54 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_rotate_left_cb5(uint64_t x) { return x << (uint32_t)(int32_t)10 | x >> (uint32_t)(int32_t)54; } /** A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 with const generics - LEFT= 10 - RIGHT= 54 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak__vxarq_u64_425(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb5(ab); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a with const generics - LEFT= 10 - RIGHT= 54 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb5(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_425(a, b); } /** A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left with const generics - LEFT= 45 - RIGHT= 19 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_rotate_left_cb6(uint64_t x) { return x << (uint32_t)(int32_t)45 | x >> (uint32_t)(int32_t)19; } /** A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 with const generics - LEFT= 45 - RIGHT= 19 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak__vxarq_u64_426(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb6(ab); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a with const generics - LEFT= 45 - RIGHT= 19 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb6(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_426(a, b); } /** A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left with const generics - LEFT= 2 - RIGHT= 62 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_rotate_left_cb7(uint64_t x) { return x << (uint32_t)(int32_t)2 | x >> (uint32_t)(int32_t)62; } /** A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 with const generics - LEFT= 2 - RIGHT= 62 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak__vxarq_u64_427(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb7(ab); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a with const generics - LEFT= 2 - RIGHT= 62 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb7(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_427(a, b); } /** A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left with const generics - LEFT= 62 - RIGHT= 2 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_rotate_left_cb8(uint64_t x) { return x << (uint32_t)(int32_t)62 | x >> (uint32_t)(int32_t)2; } /** A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 with const generics - LEFT= 62 - RIGHT= 2 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak__vxarq_u64_428(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb8(ab); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a with const generics - LEFT= 62 - RIGHT= 2 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb8(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_428(a, b); } /** A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left with const generics - LEFT= 6 - RIGHT= 58 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_rotate_left_cb9(uint64_t x) { return x << (uint32_t)(int32_t)6 | x >> (uint32_t)(int32_t)58; } /** A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 with const generics - LEFT= 6 - RIGHT= 58 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak__vxarq_u64_429(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb9(ab); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a with const generics - LEFT= 6 - RIGHT= 58 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb9(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_429(a, b); } /** A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left with const generics - LEFT= 43 - RIGHT= 21 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_rotate_left_cb10(uint64_t x) { return x << (uint32_t)(int32_t)43 | x >> (uint32_t)(int32_t)21; } /** A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 with const generics - LEFT= 43 - RIGHT= 21 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak__vxarq_u64_4210(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb10(ab); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a with const generics - LEFT= 43 - RIGHT= 21 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb10(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_4210(a, b); } /** A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left with const generics - LEFT= 15 - RIGHT= 49 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_rotate_left_cb11(uint64_t x) { return x << (uint32_t)(int32_t)15 | x >> (uint32_t)(int32_t)49; } /** A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 with const generics - LEFT= 15 - RIGHT= 49 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak__vxarq_u64_4211(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb11(ab); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a with const generics - LEFT= 15 - RIGHT= 49 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb11(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_4211(a, b); } /** A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left with const generics - LEFT= 61 - RIGHT= 3 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_rotate_left_cb12(uint64_t x) { return x << (uint32_t)(int32_t)61 | x >> (uint32_t)(int32_t)3; } /** A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 with const generics - LEFT= 61 - RIGHT= 3 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak__vxarq_u64_4212(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb12(ab); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a with const generics - LEFT= 61 - RIGHT= 3 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb12(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_4212(a, b); } /** A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left with const generics - LEFT= 28 - RIGHT= 36 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_rotate_left_cb13(uint64_t x) { return x << (uint32_t)(int32_t)28 | x >> (uint32_t)(int32_t)36; } /** A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 with const generics - LEFT= 28 - RIGHT= 36 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak__vxarq_u64_4213(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb13(ab); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a with const generics - LEFT= 28 - RIGHT= 36 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb13(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_4213(a, b); } /** A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left with const generics - LEFT= 55 - RIGHT= 9 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_rotate_left_cb14(uint64_t x) { return x << (uint32_t)(int32_t)55 | x >> (uint32_t)(int32_t)9; } /** A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 with const generics - LEFT= 55 - RIGHT= 9 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak__vxarq_u64_4214(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb14(ab); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a with const generics - LEFT= 55 - RIGHT= 9 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb14(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_4214(a, b); } /** A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left with const generics - LEFT= 25 - RIGHT= 39 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_rotate_left_cb15(uint64_t x) { return x << (uint32_t)(int32_t)25 | x >> (uint32_t)(int32_t)39; } /** A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 with const generics - LEFT= 25 - RIGHT= 39 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak__vxarq_u64_4215(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb15(ab); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a with const generics - LEFT= 25 - RIGHT= 39 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb15(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_4215(a, b); } /** A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left with const generics - LEFT= 21 - RIGHT= 43 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_rotate_left_cb16(uint64_t x) { return x << (uint32_t)(int32_t)21 | x >> (uint32_t)(int32_t)43; } /** A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 with const generics - LEFT= 21 - RIGHT= 43 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak__vxarq_u64_4216(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb16(ab); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a with const generics - LEFT= 21 - RIGHT= 43 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb16(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_4216(a, b); } /** A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left with const generics - LEFT= 56 - RIGHT= 8 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_rotate_left_cb17(uint64_t x) { return x << (uint32_t)(int32_t)56 | x >> (uint32_t)(int32_t)8; } /** A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 with const generics - LEFT= 56 - RIGHT= 8 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak__vxarq_u64_4217(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb17(ab); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a with const generics - LEFT= 56 - RIGHT= 8 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb17(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_4217(a, b); } /** A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left with const generics - LEFT= 27 - RIGHT= 37 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_rotate_left_cb18(uint64_t x) { return x << (uint32_t)(int32_t)27 | x >> (uint32_t)(int32_t)37; } /** A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 with const generics - LEFT= 27 - RIGHT= 37 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak__vxarq_u64_4218(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb18(ab); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a with const generics - LEFT= 27 - RIGHT= 37 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb18(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_4218(a, b); } /** A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left with const generics - LEFT= 20 - RIGHT= 44 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_rotate_left_cb19(uint64_t x) { return x << (uint32_t)(int32_t)20 | x >> (uint32_t)(int32_t)44; } /** A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 with const generics - LEFT= 20 - RIGHT= 44 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak__vxarq_u64_4219(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb19(ab); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a with const generics - LEFT= 20 - RIGHT= 44 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb19(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_4219(a, b); } /** A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left with const generics - LEFT= 39 - RIGHT= 25 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_rotate_left_cb20(uint64_t x) { return x << (uint32_t)(int32_t)39 | x >> (uint32_t)(int32_t)25; } /** A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 with const generics - LEFT= 39 - RIGHT= 25 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak__vxarq_u64_4220(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb20(ab); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a with const generics - LEFT= 39 - RIGHT= 25 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb20(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_4220(a, b); } /** A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left with const generics - LEFT= 8 - RIGHT= 56 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_rotate_left_cb21(uint64_t x) { return x << (uint32_t)(int32_t)8 | x >> (uint32_t)(int32_t)56; } /** A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 with const generics - LEFT= 8 - RIGHT= 56 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak__vxarq_u64_4221(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb21(ab); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a with const generics - LEFT= 8 - RIGHT= 56 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb21(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_4221(a, b); } /** A monomorphic instance of libcrux_sha3.portable_keccak.rotate_left with const generics - LEFT= 14 - RIGHT= 50 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_rotate_left_cb22(uint64_t x) { return x << (uint32_t)(int32_t)14 | x >> (uint32_t)(int32_t)50; } /** A monomorphic instance of libcrux_sha3.portable_keccak._vxarq_u64 with const generics - LEFT= 14 - RIGHT= 50 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak__vxarq_u64_4222(uint64_t a, uint64_t b) { uint64_t ab = a ^ b; return libcrux_sha3_portable_keccak_rotate_left_cb22(ab); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.xor_and_rotate_5a with const generics - LEFT= 14 - RIGHT= 50 */ static KRML_MUSTINLINE uint64_t libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb22(uint64_t a, uint64_t b) { return libcrux_sha3_portable_keccak__vxarq_u64_4222(a, b); } /** A monomorphic instance of libcrux_sha3.generic_keccak.theta_rho with types uint64_t with const generics - N= 1 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_theta_rho_16( libcrux_sha3_generic_keccak_KeccakState_48 *s) { uint64_t c[5U] = { libcrux_sha3_portable_keccak_xor5_5a(s->st[0U][0U], s->st[1U][0U], s->st[2U][0U], s->st[3U][0U], s->st[4U][0U]), libcrux_sha3_portable_keccak_xor5_5a(s->st[0U][1U], s->st[1U][1U], s->st[2U][1U], s->st[3U][1U], s->st[4U][1U]), libcrux_sha3_portable_keccak_xor5_5a(s->st[0U][2U], s->st[1U][2U], s->st[2U][2U], s->st[3U][2U], s->st[4U][2U]), libcrux_sha3_portable_keccak_xor5_5a(s->st[0U][3U], s->st[1U][3U], s->st[2U][3U], s->st[3U][3U], s->st[4U][3U]), libcrux_sha3_portable_keccak_xor5_5a(s->st[0U][4U], s->st[1U][4U], s->st[2U][4U], s->st[3U][4U], s->st[4U][4U])}; uint64_t uu____0 = libcrux_sha3_portable_keccak_rotate_left1_and_xor_5a( c[((size_t)0U + (size_t)4U) % (size_t)5U], c[((size_t)0U + (size_t)1U) % (size_t)5U]); uint64_t uu____1 = libcrux_sha3_portable_keccak_rotate_left1_and_xor_5a( c[((size_t)1U + (size_t)4U) % (size_t)5U], c[((size_t)1U + (size_t)1U) % (size_t)5U]); uint64_t uu____2 = libcrux_sha3_portable_keccak_rotate_left1_and_xor_5a( c[((size_t)2U + (size_t)4U) % (size_t)5U], c[((size_t)2U + (size_t)1U) % (size_t)5U]); uint64_t uu____3 = libcrux_sha3_portable_keccak_rotate_left1_and_xor_5a( c[((size_t)3U + (size_t)4U) % (size_t)5U], c[((size_t)3U + (size_t)1U) % (size_t)5U]); uint64_t t[5U] = {uu____0, uu____1, uu____2, uu____3, libcrux_sha3_portable_keccak_rotate_left1_and_xor_5a( c[((size_t)4U + (size_t)4U) % (size_t)5U], c[((size_t)4U + (size_t)1U) % (size_t)5U])}; s->st[0U][0U] = libcrux_sha3_portable_keccak_xor_5a(s->st[0U][0U], t[0U]); s->st[1U][0U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb(s->st[1U][0U], t[0U]); s->st[2U][0U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb0(s->st[2U][0U], t[0U]); s->st[3U][0U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb1(s->st[3U][0U], t[0U]); s->st[4U][0U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb2(s->st[4U][0U], t[0U]); s->st[0U][1U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb3(s->st[0U][1U], t[1U]); s->st[1U][1U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb4(s->st[1U][1U], t[1U]); s->st[2U][1U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb5(s->st[2U][1U], t[1U]); s->st[3U][1U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb6(s->st[3U][1U], t[1U]); s->st[4U][1U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb7(s->st[4U][1U], t[1U]); s->st[0U][2U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb8(s->st[0U][2U], t[2U]); s->st[1U][2U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb9(s->st[1U][2U], t[2U]); s->st[2U][2U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb10(s->st[2U][2U], t[2U]); s->st[3U][2U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb11(s->st[3U][2U], t[2U]); s->st[4U][2U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb12(s->st[4U][2U], t[2U]); s->st[0U][3U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb13(s->st[0U][3U], t[3U]); s->st[1U][3U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb14(s->st[1U][3U], t[3U]); s->st[2U][3U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb15(s->st[2U][3U], t[3U]); s->st[3U][3U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb16(s->st[3U][3U], t[3U]); s->st[4U][3U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb17(s->st[4U][3U], t[3U]); s->st[0U][4U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb18(s->st[0U][4U], t[4U]); s->st[1U][4U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb19(s->st[1U][4U], t[4U]); s->st[2U][4U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb20(s->st[2U][4U], t[4U]); s->st[3U][4U] = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb21(s->st[3U][4U], t[4U]); uint64_t uu____27 = libcrux_sha3_portable_keccak_xor_and_rotate_5a_bb22(s->st[4U][4U], t[4U]); s->st[4U][4U] = uu____27; } /** A monomorphic instance of libcrux_sha3.generic_keccak.pi with types uint64_t with const generics - N= 1 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_pi_1d( libcrux_sha3_generic_keccak_KeccakState_48 *s) { uint64_t old[5U][5U]; memcpy(old, s->st, (size_t)5U * sizeof(uint64_t[5U])); s->st[0U][1U] = old[1U][1U]; s->st[0U][2U] = old[2U][2U]; s->st[0U][3U] = old[3U][3U]; s->st[0U][4U] = old[4U][4U]; s->st[1U][0U] = old[0U][3U]; s->st[1U][1U] = old[1U][4U]; s->st[1U][2U] = old[2U][0U]; s->st[1U][3U] = old[3U][1U]; s->st[1U][4U] = old[4U][2U]; s->st[2U][0U] = old[0U][1U]; s->st[2U][1U] = old[1U][2U]; s->st[2U][2U] = old[2U][3U]; s->st[2U][3U] = old[3U][4U]; s->st[2U][4U] = old[4U][0U]; s->st[3U][0U] = old[0U][4U]; s->st[3U][1U] = old[1U][0U]; s->st[3U][2U] = old[2U][1U]; s->st[3U][3U] = old[3U][2U]; s->st[3U][4U] = old[4U][3U]; s->st[4U][0U] = old[0U][2U]; s->st[4U][1U] = old[1U][3U]; s->st[4U][2U] = old[2U][4U]; s->st[4U][3U] = old[3U][0U]; s->st[4U][4U] = old[4U][1U]; } /** A monomorphic instance of libcrux_sha3.generic_keccak.chi with types uint64_t with const generics - N= 1 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_chi_12( libcrux_sha3_generic_keccak_KeccakState_48 *s) { uint64_t old[5U][5U]; memcpy(old, s->st, (size_t)5U * sizeof(uint64_t[5U])); for (size_t i0 = (size_t)0U; i0 < (size_t)5U; i0++) { size_t i1 = i0; for (size_t i = (size_t)0U; i < (size_t)5U; i++) { size_t j = i; s->st[i1][j] = libcrux_sha3_portable_keccak_and_not_xor_5a( s->st[i1][j], old[i1][(j + (size_t)2U) % (size_t)5U], old[i1][(j + (size_t)1U) % (size_t)5U]); } } } /** A monomorphic instance of libcrux_sha3.generic_keccak.iota with types uint64_t with const generics - N= 1 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_iota_62( libcrux_sha3_generic_keccak_KeccakState_48 *s, size_t i) { s->st[0U][0U] = libcrux_sha3_portable_keccak_xor_constant_5a( s->st[0U][0U], libcrux_sha3_generic_keccak_ROUNDCONSTANTS[i]); } /** A monomorphic instance of libcrux_sha3.generic_keccak.keccakf1600 with types uint64_t with const generics - N= 1 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_keccakf1600_21( libcrux_sha3_generic_keccak_KeccakState_48 *s) { for (size_t i = (size_t)0U; i < (size_t)24U; i++) { size_t i0 = i; libcrux_sha3_generic_keccak_theta_rho_16(s); libcrux_sha3_generic_keccak_pi_1d(s); libcrux_sha3_generic_keccak_chi_12(s); libcrux_sha3_generic_keccak_iota_62(s, i0); } } /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_block with types uint64_t with const generics - N= 1 - RATE= 72 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_block_df( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice blocks[1U]) { uint64_t(*uu____0)[5U] = s->st; Eurydice_slice uu____1[1U]; memcpy(uu____1, blocks, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_portable_keccak_load_block_5a_b8(uu____0, uu____1); libcrux_sha3_generic_keccak_keccakf1600_21(s); } /** A monomorphic instance of libcrux_sha3.portable_keccak.load_block_full with const generics - RATE= 72 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_full_df( uint64_t (*s)[5U], uint8_t blocks[1U][200U]) { Eurydice_slice buf[1U] = { Eurydice_array_to_slice((size_t)200U, blocks[0U], uint8_t)}; libcrux_sha3_portable_keccak_load_block_2c(s, buf); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.load_block_full_5a with const generics - RATE= 72 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_full_5a_d2( uint64_t (*a)[5U], uint8_t b[1U][200U]) { uint64_t(*uu____0)[5U] = a; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_b[1U][200U]; memcpy(copy_of_b, b, (size_t)1U * sizeof(uint8_t[200U])); libcrux_sha3_portable_keccak_load_block_full_df(uu____0, copy_of_b); } /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_final with types uint64_t with const generics - N= 1 - RATE= 72 - DELIM= 6 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_final_c7( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice last[1U]) { size_t last_len = Eurydice_slice_len(last[0U], uint8_t); uint8_t blocks[1U][200U] = {{0U}}; for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; if (last_len > (size_t)0U) { Eurydice_slice uu____0 = Eurydice_array_to_subslice2( blocks[i0], (size_t)0U, last_len, uint8_t); Eurydice_slice_copy(uu____0, last[i0], uint8_t); } blocks[i0][last_len] = 6U; size_t uu____1 = i0; size_t uu____2 = (size_t)72U - (size_t)1U; blocks[uu____1][uu____2] = (uint32_t)blocks[uu____1][uu____2] | 128U; } uint64_t(*uu____3)[5U] = s->st; uint8_t uu____4[1U][200U]; memcpy(uu____4, blocks, (size_t)1U * sizeof(uint8_t[200U])); libcrux_sha3_portable_keccak_load_block_full_5a_d2(uu____3, uu____4); libcrux_sha3_generic_keccak_keccakf1600_21(s); } /** A monomorphic instance of libcrux_sha3.portable_keccak.store_block with const generics - RATE= 72 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_58( uint64_t (*s)[5U], Eurydice_slice out[1U]) { for (size_t i = (size_t)0U; i < (size_t)72U / (size_t)8U; i++) { size_t i0 = i; Eurydice_slice uu____0 = Eurydice_slice_subslice2( out[0U], (size_t)8U * i0, (size_t)8U * i0 + (size_t)8U, uint8_t); uint8_t ret[8U]; core_num__u64_9__to_le_bytes(s[i0 / (size_t)5U][i0 % (size_t)5U], ret); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)8U, ret, uint8_t), uint8_t); } } /** A monomorphic instance of libcrux_sha3.portable_keccak.store_block_full with const generics - RATE= 72 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_full_2d( uint64_t (*s)[5U], uint8_t ret[1U][200U]) { uint8_t out[200U] = {0U}; Eurydice_slice buf[1U] = { Eurydice_array_to_slice((size_t)200U, out, uint8_t)}; libcrux_sha3_portable_keccak_store_block_58(s, buf); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_out[200U]; memcpy(copy_of_out, out, (size_t)200U * sizeof(uint8_t)); memcpy(ret[0U], copy_of_out, (size_t)200U * sizeof(uint8_t)); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.store_block_full_5a with const generics - RATE= 72 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_full_5a_29( uint64_t (*a)[5U], uint8_t ret[1U][200U]) { libcrux_sha3_portable_keccak_store_block_full_2d(a, ret); } /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_first_and_last with types uint64_t with const generics - N= 1 - RATE= 72 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_first_and_last_c5( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out[1U]) { uint8_t b[1U][200U]; libcrux_sha3_portable_keccak_store_block_full_5a_29(s->st, b); for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; Eurydice_slice uu____0 = out[i0]; uint8_t *uu____1 = b[i0]; core_ops_range_Range_b3 lit; lit.start = (size_t)0U; lit.end = Eurydice_slice_len(out[i0], uint8_t); Eurydice_slice_copy( uu____0, Eurydice_array_to_subslice((size_t)200U, uu____1, lit, uint8_t, core_ops_range_Range_b3), uint8_t); } } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.store_block_5a with const generics - RATE= 72 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_5a_59( uint64_t (*a)[5U], Eurydice_slice b[1U]) { libcrux_sha3_portable_keccak_store_block_58(a, b); } /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_first_block with types uint64_t with const generics - N= 1 - RATE= 72 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_first_block_84( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out[1U]) { libcrux_sha3_portable_keccak_store_block_5a_59(s->st, out); } /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_next_block with types uint64_t with const generics - N= 1 - RATE= 72 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_next_block_fc( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out[1U]) { libcrux_sha3_generic_keccak_keccakf1600_21(s); libcrux_sha3_portable_keccak_store_block_5a_59(s->st, out); } /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_last with types uint64_t with const generics - N= 1 - RATE= 72 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_last_cf( libcrux_sha3_generic_keccak_KeccakState_48 s, Eurydice_slice out[1U]) { libcrux_sha3_generic_keccak_keccakf1600_21(&s); uint8_t b[1U][200U]; libcrux_sha3_portable_keccak_store_block_full_5a_29(s.st, b); for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; Eurydice_slice uu____0 = out[i0]; uint8_t *uu____1 = b[i0]; core_ops_range_Range_b3 lit; lit.start = (size_t)0U; lit.end = Eurydice_slice_len(out[i0], uint8_t); Eurydice_slice_copy( uu____0, Eurydice_array_to_subslice((size_t)200U, uu____1, lit, uint8_t, core_ops_range_Range_b3), uint8_t); } } /** A monomorphic instance of libcrux_sha3.generic_keccak.keccak with types uint64_t with const generics - N= 1 - RATE= 72 - DELIM= 6 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_keccak_e9( Eurydice_slice data[1U], Eurydice_slice out[1U]) { libcrux_sha3_generic_keccak_KeccakState_48 s = libcrux_sha3_generic_keccak_new_1e_f4(); for (size_t i = (size_t)0U; i < Eurydice_slice_len(data[0U], uint8_t) / (size_t)72U; i++) { size_t i0 = i; libcrux_sha3_generic_keccak_KeccakState_48 *uu____0 = &s; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice ret[1U]; libcrux_sha3_portable_keccak_slice_n_5a(copy_of_data, i0 * (size_t)72U, (size_t)72U, ret); libcrux_sha3_generic_keccak_absorb_block_df(uu____0, ret); } size_t rem = Eurydice_slice_len(data[0U], uint8_t) % (size_t)72U; libcrux_sha3_generic_keccak_KeccakState_48 *uu____2 = &s; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice ret[1U]; libcrux_sha3_portable_keccak_slice_n_5a( copy_of_data, Eurydice_slice_len(data[0U], uint8_t) - rem, rem, ret); libcrux_sha3_generic_keccak_absorb_final_c7(uu____2, ret); size_t outlen = Eurydice_slice_len(out[0U], uint8_t); size_t blocks = outlen / (size_t)72U; size_t last = outlen - outlen % (size_t)72U; if (blocks == (size_t)0U) { libcrux_sha3_generic_keccak_squeeze_first_and_last_c5(&s, out); } else { Eurydice_slice_uint8_t_1size_t__x2 uu____4 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(out, (size_t)72U); Eurydice_slice o0[1U]; memcpy(o0, uu____4.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice o1[1U]; memcpy(o1, uu____4.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_first_block_84(&s, o0); core_ops_range_Range_b3 iter = core_iter_traits_collect___core__iter__traits__collect__IntoIterator_for_I__1__into_iter( (CLITERAL(core_ops_range_Range_b3){.start = (size_t)1U, .end = blocks}), core_ops_range_Range_b3, core_ops_range_Range_b3); while (true) { if (core_iter_range___core__iter__traits__iterator__Iterator_for_core__ops__range__Range_A___6__next( &iter, size_t, Option_b3) .tag == None) { break; } else { Eurydice_slice_uint8_t_1size_t__x2 uu____5 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(o1, (size_t)72U); Eurydice_slice o[1U]; memcpy(o, uu____5.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice orest[1U]; memcpy(orest, uu____5.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_next_block_fc(&s, o); memcpy(o1, orest, (size_t)1U * sizeof(Eurydice_slice)); } } if (last < outlen) { libcrux_sha3_generic_keccak_squeeze_last_cf(s, o1); } } } /** A monomorphic instance of libcrux_sha3.portable.keccakx1 with const generics - RATE= 72 - DELIM= 6 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccakx1_ce( Eurydice_slice data[1U], Eurydice_slice out[1U]) { /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_keccak_e9(copy_of_data, out); } /** A portable SHA3 512 implementation. */ static KRML_MUSTINLINE void libcrux_sha3_portable_sha512(Eurydice_slice digest, Eurydice_slice data) { Eurydice_slice buf0[1U] = {data}; Eurydice_slice buf[1U] = {digest}; libcrux_sha3_portable_keccakx1_ce(buf0, buf); } /** A monomorphic instance of libcrux_sha3.portable_keccak.load_block with const generics - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_2c0( uint64_t (*s)[5U], Eurydice_slice blocks[1U]) { for (size_t i = (size_t)0U; i < (size_t)136U / (size_t)8U; i++) { size_t i0 = i; uint8_t uu____0[8U]; Result_56 dst; Eurydice_slice_to_array2( &dst, Eurydice_slice_subslice2(blocks[0U], (size_t)8U * i0, (size_t)8U * i0 + (size_t)8U, uint8_t), Eurydice_slice, uint8_t[8U]); unwrap_41_ac(dst, uu____0); size_t uu____1 = i0 / (size_t)5U; size_t uu____2 = i0 % (size_t)5U; s[uu____1][uu____2] = s[uu____1][uu____2] ^ core_num__u64_9__from_le_bytes(uu____0); } } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.load_block_5a with const generics - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_5a_b80( uint64_t (*a)[5U], Eurydice_slice b[1U]) { uint64_t(*uu____0)[5U] = a; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_b[1U]; memcpy(copy_of_b, b, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_portable_keccak_load_block_2c0(uu____0, copy_of_b); } /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_block with types uint64_t with const generics - N= 1 - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_block_df0( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice blocks[1U]) { uint64_t(*uu____0)[5U] = s->st; Eurydice_slice uu____1[1U]; memcpy(uu____1, blocks, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_portable_keccak_load_block_5a_b80(uu____0, uu____1); libcrux_sha3_generic_keccak_keccakf1600_21(s); } /** A monomorphic instance of libcrux_sha3.portable_keccak.load_block_full with const generics - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_full_df0( uint64_t (*s)[5U], uint8_t blocks[1U][200U]) { Eurydice_slice buf[1U] = { Eurydice_array_to_slice((size_t)200U, blocks[0U], uint8_t)}; libcrux_sha3_portable_keccak_load_block_2c0(s, buf); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.load_block_full_5a with const generics - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_full_5a_d20( uint64_t (*a)[5U], uint8_t b[1U][200U]) { uint64_t(*uu____0)[5U] = a; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_b[1U][200U]; memcpy(copy_of_b, b, (size_t)1U * sizeof(uint8_t[200U])); libcrux_sha3_portable_keccak_load_block_full_df0(uu____0, copy_of_b); } /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_final with types uint64_t with const generics - N= 1 - RATE= 136 - DELIM= 6 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_final_c70( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice last[1U]) { size_t last_len = Eurydice_slice_len(last[0U], uint8_t); uint8_t blocks[1U][200U] = {{0U}}; for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; if (last_len > (size_t)0U) { Eurydice_slice uu____0 = Eurydice_array_to_subslice2( blocks[i0], (size_t)0U, last_len, uint8_t); Eurydice_slice_copy(uu____0, last[i0], uint8_t); } blocks[i0][last_len] = 6U; size_t uu____1 = i0; size_t uu____2 = (size_t)136U - (size_t)1U; blocks[uu____1][uu____2] = (uint32_t)blocks[uu____1][uu____2] | 128U; } uint64_t(*uu____3)[5U] = s->st; uint8_t uu____4[1U][200U]; memcpy(uu____4, blocks, (size_t)1U * sizeof(uint8_t[200U])); libcrux_sha3_portable_keccak_load_block_full_5a_d20(uu____3, uu____4); libcrux_sha3_generic_keccak_keccakf1600_21(s); } /** A monomorphic instance of libcrux_sha3.portable_keccak.store_block with const generics - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_580( uint64_t (*s)[5U], Eurydice_slice out[1U]) { for (size_t i = (size_t)0U; i < (size_t)136U / (size_t)8U; i++) { size_t i0 = i; Eurydice_slice uu____0 = Eurydice_slice_subslice2( out[0U], (size_t)8U * i0, (size_t)8U * i0 + (size_t)8U, uint8_t); uint8_t ret[8U]; core_num__u64_9__to_le_bytes(s[i0 / (size_t)5U][i0 % (size_t)5U], ret); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)8U, ret, uint8_t), uint8_t); } } /** A monomorphic instance of libcrux_sha3.portable_keccak.store_block_full with const generics - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_full_2d0( uint64_t (*s)[5U], uint8_t ret[1U][200U]) { uint8_t out[200U] = {0U}; Eurydice_slice buf[1U] = { Eurydice_array_to_slice((size_t)200U, out, uint8_t)}; libcrux_sha3_portable_keccak_store_block_580(s, buf); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_out[200U]; memcpy(copy_of_out, out, (size_t)200U * sizeof(uint8_t)); memcpy(ret[0U], copy_of_out, (size_t)200U * sizeof(uint8_t)); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.store_block_full_5a with const generics - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_full_5a_290(uint64_t (*a)[5U], uint8_t ret[1U][200U]) { libcrux_sha3_portable_keccak_store_block_full_2d0(a, ret); } /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_first_and_last with types uint64_t with const generics - N= 1 - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_first_and_last_c50( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out[1U]) { uint8_t b[1U][200U]; libcrux_sha3_portable_keccak_store_block_full_5a_290(s->st, b); for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; Eurydice_slice uu____0 = out[i0]; uint8_t *uu____1 = b[i0]; core_ops_range_Range_b3 lit; lit.start = (size_t)0U; lit.end = Eurydice_slice_len(out[i0], uint8_t); Eurydice_slice_copy( uu____0, Eurydice_array_to_subslice((size_t)200U, uu____1, lit, uint8_t, core_ops_range_Range_b3), uint8_t); } } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.store_block_5a with const generics - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_5a_590( uint64_t (*a)[5U], Eurydice_slice b[1U]) { libcrux_sha3_portable_keccak_store_block_580(a, b); } /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_first_block with types uint64_t with const generics - N= 1 - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_first_block_840( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out[1U]) { libcrux_sha3_portable_keccak_store_block_5a_590(s->st, out); } /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_next_block with types uint64_t with const generics - N= 1 - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_next_block_fc0( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out[1U]) { libcrux_sha3_generic_keccak_keccakf1600_21(s); libcrux_sha3_portable_keccak_store_block_5a_590(s->st, out); } /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_last with types uint64_t with const generics - N= 1 - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_last_cf0( libcrux_sha3_generic_keccak_KeccakState_48 s, Eurydice_slice out[1U]) { libcrux_sha3_generic_keccak_keccakf1600_21(&s); uint8_t b[1U][200U]; libcrux_sha3_portable_keccak_store_block_full_5a_290(s.st, b); for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; Eurydice_slice uu____0 = out[i0]; uint8_t *uu____1 = b[i0]; core_ops_range_Range_b3 lit; lit.start = (size_t)0U; lit.end = Eurydice_slice_len(out[i0], uint8_t); Eurydice_slice_copy( uu____0, Eurydice_array_to_subslice((size_t)200U, uu____1, lit, uint8_t, core_ops_range_Range_b3), uint8_t); } } /** A monomorphic instance of libcrux_sha3.generic_keccak.keccak with types uint64_t with const generics - N= 1 - RATE= 136 - DELIM= 6 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_keccak_e90( Eurydice_slice data[1U], Eurydice_slice out[1U]) { libcrux_sha3_generic_keccak_KeccakState_48 s = libcrux_sha3_generic_keccak_new_1e_f4(); for (size_t i = (size_t)0U; i < Eurydice_slice_len(data[0U], uint8_t) / (size_t)136U; i++) { size_t i0 = i; libcrux_sha3_generic_keccak_KeccakState_48 *uu____0 = &s; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice ret[1U]; libcrux_sha3_portable_keccak_slice_n_5a(copy_of_data, i0 * (size_t)136U, (size_t)136U, ret); libcrux_sha3_generic_keccak_absorb_block_df0(uu____0, ret); } size_t rem = Eurydice_slice_len(data[0U], uint8_t) % (size_t)136U; libcrux_sha3_generic_keccak_KeccakState_48 *uu____2 = &s; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice ret[1U]; libcrux_sha3_portable_keccak_slice_n_5a( copy_of_data, Eurydice_slice_len(data[0U], uint8_t) - rem, rem, ret); libcrux_sha3_generic_keccak_absorb_final_c70(uu____2, ret); size_t outlen = Eurydice_slice_len(out[0U], uint8_t); size_t blocks = outlen / (size_t)136U; size_t last = outlen - outlen % (size_t)136U; if (blocks == (size_t)0U) { libcrux_sha3_generic_keccak_squeeze_first_and_last_c50(&s, out); } else { Eurydice_slice_uint8_t_1size_t__x2 uu____4 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(out, (size_t)136U); Eurydice_slice o0[1U]; memcpy(o0, uu____4.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice o1[1U]; memcpy(o1, uu____4.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_first_block_840(&s, o0); core_ops_range_Range_b3 iter = core_iter_traits_collect___core__iter__traits__collect__IntoIterator_for_I__1__into_iter( (CLITERAL(core_ops_range_Range_b3){.start = (size_t)1U, .end = blocks}), core_ops_range_Range_b3, core_ops_range_Range_b3); while (true) { if (core_iter_range___core__iter__traits__iterator__Iterator_for_core__ops__range__Range_A___6__next( &iter, size_t, Option_b3) .tag == None) { break; } else { Eurydice_slice_uint8_t_1size_t__x2 uu____5 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(o1, (size_t)136U); Eurydice_slice o[1U]; memcpy(o, uu____5.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice orest[1U]; memcpy(orest, uu____5.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_next_block_fc0(&s, o); memcpy(o1, orest, (size_t)1U * sizeof(Eurydice_slice)); } } if (last < outlen) { libcrux_sha3_generic_keccak_squeeze_last_cf0(s, o1); } } } /** A monomorphic instance of libcrux_sha3.portable.keccakx1 with const generics - RATE= 136 - DELIM= 6 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccakx1_ce0( Eurydice_slice data[1U], Eurydice_slice out[1U]) { /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_keccak_e90(copy_of_data, out); } /** A portable SHA3 256 implementation. */ static KRML_MUSTINLINE void libcrux_sha3_portable_sha256(Eurydice_slice digest, Eurydice_slice data) { Eurydice_slice buf0[1U] = {data}; Eurydice_slice buf[1U] = {digest}; libcrux_sha3_portable_keccakx1_ce0(buf0, buf); } /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_final with types uint64_t with const generics - N= 1 - RATE= 136 - DELIM= 31 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_final_c71( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice last[1U]) { size_t last_len = Eurydice_slice_len(last[0U], uint8_t); uint8_t blocks[1U][200U] = {{0U}}; for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; if (last_len > (size_t)0U) { Eurydice_slice uu____0 = Eurydice_array_to_subslice2( blocks[i0], (size_t)0U, last_len, uint8_t); Eurydice_slice_copy(uu____0, last[i0], uint8_t); } blocks[i0][last_len] = 31U; size_t uu____1 = i0; size_t uu____2 = (size_t)136U - (size_t)1U; blocks[uu____1][uu____2] = (uint32_t)blocks[uu____1][uu____2] | 128U; } uint64_t(*uu____3)[5U] = s->st; uint8_t uu____4[1U][200U]; memcpy(uu____4, blocks, (size_t)1U * sizeof(uint8_t[200U])); libcrux_sha3_portable_keccak_load_block_full_5a_d20(uu____3, uu____4); libcrux_sha3_generic_keccak_keccakf1600_21(s); } /** A monomorphic instance of libcrux_sha3.generic_keccak.keccak with types uint64_t with const generics - N= 1 - RATE= 136 - DELIM= 31 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_keccak_e91( Eurydice_slice data[1U], Eurydice_slice out[1U]) { libcrux_sha3_generic_keccak_KeccakState_48 s = libcrux_sha3_generic_keccak_new_1e_f4(); for (size_t i = (size_t)0U; i < Eurydice_slice_len(data[0U], uint8_t) / (size_t)136U; i++) { size_t i0 = i; libcrux_sha3_generic_keccak_KeccakState_48 *uu____0 = &s; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice ret[1U]; libcrux_sha3_portable_keccak_slice_n_5a(copy_of_data, i0 * (size_t)136U, (size_t)136U, ret); libcrux_sha3_generic_keccak_absorb_block_df0(uu____0, ret); } size_t rem = Eurydice_slice_len(data[0U], uint8_t) % (size_t)136U; libcrux_sha3_generic_keccak_KeccakState_48 *uu____2 = &s; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice ret[1U]; libcrux_sha3_portable_keccak_slice_n_5a( copy_of_data, Eurydice_slice_len(data[0U], uint8_t) - rem, rem, ret); libcrux_sha3_generic_keccak_absorb_final_c71(uu____2, ret); size_t outlen = Eurydice_slice_len(out[0U], uint8_t); size_t blocks = outlen / (size_t)136U; size_t last = outlen - outlen % (size_t)136U; if (blocks == (size_t)0U) { libcrux_sha3_generic_keccak_squeeze_first_and_last_c50(&s, out); } else { Eurydice_slice_uint8_t_1size_t__x2 uu____4 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(out, (size_t)136U); Eurydice_slice o0[1U]; memcpy(o0, uu____4.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice o1[1U]; memcpy(o1, uu____4.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_first_block_840(&s, o0); core_ops_range_Range_b3 iter = core_iter_traits_collect___core__iter__traits__collect__IntoIterator_for_I__1__into_iter( (CLITERAL(core_ops_range_Range_b3){.start = (size_t)1U, .end = blocks}), core_ops_range_Range_b3, core_ops_range_Range_b3); while (true) { if (core_iter_range___core__iter__traits__iterator__Iterator_for_core__ops__range__Range_A___6__next( &iter, size_t, Option_b3) .tag == None) { break; } else { Eurydice_slice_uint8_t_1size_t__x2 uu____5 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(o1, (size_t)136U); Eurydice_slice o[1U]; memcpy(o, uu____5.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice orest[1U]; memcpy(orest, uu____5.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_next_block_fc0(&s, o); memcpy(o1, orest, (size_t)1U * sizeof(Eurydice_slice)); } } if (last < outlen) { libcrux_sha3_generic_keccak_squeeze_last_cf0(s, o1); } } } /** A monomorphic instance of libcrux_sha3.portable.keccakx1 with const generics - RATE= 136 - DELIM= 31 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccakx1_ce1( Eurydice_slice data[1U], Eurydice_slice out[1U]) { /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_keccak_e91(copy_of_data, out); } /** A portable SHAKE256 implementation. */ static KRML_MUSTINLINE void libcrux_sha3_portable_shake256( Eurydice_slice digest, Eurydice_slice data) { Eurydice_slice buf0[1U] = {data}; Eurydice_slice buf[1U] = {digest}; libcrux_sha3_portable_keccakx1_ce1(buf0, buf); } typedef libcrux_sha3_generic_keccak_KeccakState_48 libcrux_sha3_portable_KeccakState; /** Create a new SHAKE-128 state object. */ static KRML_MUSTINLINE libcrux_sha3_generic_keccak_KeccakState_48 libcrux_sha3_portable_incremental_shake128_init(void) { return libcrux_sha3_generic_keccak_new_1e_f4(); } /** A monomorphic instance of libcrux_sha3.portable_keccak.load_block with const generics - RATE= 168 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_2c1( uint64_t (*s)[5U], Eurydice_slice blocks[1U]) { for (size_t i = (size_t)0U; i < (size_t)168U / (size_t)8U; i++) { size_t i0 = i; uint8_t uu____0[8U]; Result_56 dst; Eurydice_slice_to_array2( &dst, Eurydice_slice_subslice2(blocks[0U], (size_t)8U * i0, (size_t)8U * i0 + (size_t)8U, uint8_t), Eurydice_slice, uint8_t[8U]); unwrap_41_ac(dst, uu____0); size_t uu____1 = i0 / (size_t)5U; size_t uu____2 = i0 % (size_t)5U; s[uu____1][uu____2] = s[uu____1][uu____2] ^ core_num__u64_9__from_le_bytes(uu____0); } } /** A monomorphic instance of libcrux_sha3.portable_keccak.load_block_full with const generics - RATE= 168 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_full_df1( uint64_t (*s)[5U], uint8_t blocks[1U][200U]) { Eurydice_slice buf[1U] = { Eurydice_array_to_slice((size_t)200U, blocks[0U], uint8_t)}; libcrux_sha3_portable_keccak_load_block_2c1(s, buf); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.load_block_full_5a with const generics - RATE= 168 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_full_5a_d21( uint64_t (*a)[5U], uint8_t b[1U][200U]) { uint64_t(*uu____0)[5U] = a; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_b[1U][200U]; memcpy(copy_of_b, b, (size_t)1U * sizeof(uint8_t[200U])); libcrux_sha3_portable_keccak_load_block_full_df1(uu____0, copy_of_b); } /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_final with types uint64_t with const generics - N= 1 - RATE= 168 - DELIM= 31 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_final_c72( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice last[1U]) { size_t last_len = Eurydice_slice_len(last[0U], uint8_t); uint8_t blocks[1U][200U] = {{0U}}; for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; if (last_len > (size_t)0U) { Eurydice_slice uu____0 = Eurydice_array_to_subslice2( blocks[i0], (size_t)0U, last_len, uint8_t); Eurydice_slice_copy(uu____0, last[i0], uint8_t); } blocks[i0][last_len] = 31U; size_t uu____1 = i0; size_t uu____2 = (size_t)168U - (size_t)1U; blocks[uu____1][uu____2] = (uint32_t)blocks[uu____1][uu____2] | 128U; } uint64_t(*uu____3)[5U] = s->st; uint8_t uu____4[1U][200U]; memcpy(uu____4, blocks, (size_t)1U * sizeof(uint8_t[200U])); libcrux_sha3_portable_keccak_load_block_full_5a_d21(uu____3, uu____4); libcrux_sha3_generic_keccak_keccakf1600_21(s); } /** Absorb */ static KRML_MUSTINLINE void libcrux_sha3_portable_incremental_shake128_absorb_final( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice data0) { Eurydice_slice buf[1U] = {data0}; libcrux_sha3_generic_keccak_absorb_final_c72(s, buf); } /** A monomorphic instance of libcrux_sha3.portable_keccak.store_block with const generics - RATE= 168 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_581( uint64_t (*s)[5U], Eurydice_slice out[1U]) { for (size_t i = (size_t)0U; i < (size_t)168U / (size_t)8U; i++) { size_t i0 = i; Eurydice_slice uu____0 = Eurydice_slice_subslice2( out[0U], (size_t)8U * i0, (size_t)8U * i0 + (size_t)8U, uint8_t); uint8_t ret[8U]; core_num__u64_9__to_le_bytes(s[i0 / (size_t)5U][i0 % (size_t)5U], ret); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)8U, ret, uint8_t), uint8_t); } } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.store_block_5a with const generics - RATE= 168 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_5a_591( uint64_t (*a)[5U], Eurydice_slice b[1U]) { libcrux_sha3_portable_keccak_store_block_581(a, b); } /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_next_block with types uint64_t with const generics - N= 1 - RATE= 168 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_next_block_fc1( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out[1U]) { libcrux_sha3_generic_keccak_keccakf1600_21(s); libcrux_sha3_portable_keccak_store_block_5a_591(s->st, out); } /** Squeeze another block */ static KRML_MUSTINLINE void libcrux_sha3_portable_incremental_shake128_squeeze_next_block( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out0) { Eurydice_slice buf[1U] = {out0}; libcrux_sha3_generic_keccak_squeeze_next_block_fc1(s, buf); } /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_first_block with types uint64_t with const generics - N= 1 - RATE= 168 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_first_block_841( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out[1U]) { libcrux_sha3_portable_keccak_store_block_5a_591(s->st, out); } /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_first_three_blocks with types uint64_t with const generics - N= 1 - RATE= 168 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_first_three_blocks_cc( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out[1U]) { Eurydice_slice_uint8_t_1size_t__x2 uu____0 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(out, (size_t)168U); Eurydice_slice o0[1U]; memcpy(o0, uu____0.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice o10[1U]; memcpy(o10, uu____0.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_first_block_841(s, o0); Eurydice_slice_uint8_t_1size_t__x2 uu____1 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(o10, (size_t)168U); Eurydice_slice o1[1U]; memcpy(o1, uu____1.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice o2[1U]; memcpy(o2, uu____1.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_next_block_fc1(s, o1); libcrux_sha3_generic_keccak_squeeze_next_block_fc1(s, o2); } /** Squeeze three blocks */ static KRML_MUSTINLINE void libcrux_sha3_portable_incremental_shake128_squeeze_first_three_blocks( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out0) { Eurydice_slice buf[1U] = {out0}; libcrux_sha3_generic_keccak_squeeze_first_three_blocks_cc(s, buf); } #define libcrux_sha3_Sha224 0 #define libcrux_sha3_Sha256 1 #define libcrux_sha3_Sha384 2 #define libcrux_sha3_Sha512 3 typedef uint8_t libcrux_sha3_Algorithm; /** Returns the output size of a digest. */ static inline size_t libcrux_sha3_digest_size(libcrux_sha3_Algorithm mode) { size_t uu____0; switch (mode) { case libcrux_sha3_Sha224: { uu____0 = (size_t)28U; break; } case libcrux_sha3_Sha256: { uu____0 = (size_t)32U; break; } case libcrux_sha3_Sha384: { uu____0 = (size_t)48U; break; } case libcrux_sha3_Sha512: { uu____0 = (size_t)64U; break; } default: { KRML_HOST_EPRINTF("KaRaMeL incomplete match at %s:%d\n", __FILE__, __LINE__); KRML_HOST_EXIT(253U); } } return uu____0; } /** A monomorphic instance of libcrux_sha3.portable_keccak.load_block with const generics - RATE= 144 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_2c2( uint64_t (*s)[5U], Eurydice_slice blocks[1U]) { for (size_t i = (size_t)0U; i < (size_t)144U / (size_t)8U; i++) { size_t i0 = i; uint8_t uu____0[8U]; Result_56 dst; Eurydice_slice_to_array2( &dst, Eurydice_slice_subslice2(blocks[0U], (size_t)8U * i0, (size_t)8U * i0 + (size_t)8U, uint8_t), Eurydice_slice, uint8_t[8U]); unwrap_41_ac(dst, uu____0); size_t uu____1 = i0 / (size_t)5U; size_t uu____2 = i0 % (size_t)5U; s[uu____1][uu____2] = s[uu____1][uu____2] ^ core_num__u64_9__from_le_bytes(uu____0); } } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.load_block_5a with const generics - RATE= 144 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_5a_b81( uint64_t (*a)[5U], Eurydice_slice b[1U]) { uint64_t(*uu____0)[5U] = a; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_b[1U]; memcpy(copy_of_b, b, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_portable_keccak_load_block_2c2(uu____0, copy_of_b); } /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_block with types uint64_t with const generics - N= 1 - RATE= 144 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_block_df1( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice blocks[1U]) { uint64_t(*uu____0)[5U] = s->st; Eurydice_slice uu____1[1U]; memcpy(uu____1, blocks, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_portable_keccak_load_block_5a_b81(uu____0, uu____1); libcrux_sha3_generic_keccak_keccakf1600_21(s); } /** A monomorphic instance of libcrux_sha3.portable_keccak.load_block_full with const generics - RATE= 144 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_full_df2( uint64_t (*s)[5U], uint8_t blocks[1U][200U]) { Eurydice_slice buf[1U] = { Eurydice_array_to_slice((size_t)200U, blocks[0U], uint8_t)}; libcrux_sha3_portable_keccak_load_block_2c2(s, buf); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.load_block_full_5a with const generics - RATE= 144 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_full_5a_d22( uint64_t (*a)[5U], uint8_t b[1U][200U]) { uint64_t(*uu____0)[5U] = a; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_b[1U][200U]; memcpy(copy_of_b, b, (size_t)1U * sizeof(uint8_t[200U])); libcrux_sha3_portable_keccak_load_block_full_df2(uu____0, copy_of_b); } /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_final with types uint64_t with const generics - N= 1 - RATE= 144 - DELIM= 6 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_final_c73( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice last[1U]) { size_t last_len = Eurydice_slice_len(last[0U], uint8_t); uint8_t blocks[1U][200U] = {{0U}}; for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; if (last_len > (size_t)0U) { Eurydice_slice uu____0 = Eurydice_array_to_subslice2( blocks[i0], (size_t)0U, last_len, uint8_t); Eurydice_slice_copy(uu____0, last[i0], uint8_t); } blocks[i0][last_len] = 6U; size_t uu____1 = i0; size_t uu____2 = (size_t)144U - (size_t)1U; blocks[uu____1][uu____2] = (uint32_t)blocks[uu____1][uu____2] | 128U; } uint64_t(*uu____3)[5U] = s->st; uint8_t uu____4[1U][200U]; memcpy(uu____4, blocks, (size_t)1U * sizeof(uint8_t[200U])); libcrux_sha3_portable_keccak_load_block_full_5a_d22(uu____3, uu____4); libcrux_sha3_generic_keccak_keccakf1600_21(s); } /** A monomorphic instance of libcrux_sha3.portable_keccak.store_block with const generics - RATE= 144 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_582( uint64_t (*s)[5U], Eurydice_slice out[1U]) { for (size_t i = (size_t)0U; i < (size_t)144U / (size_t)8U; i++) { size_t i0 = i; Eurydice_slice uu____0 = Eurydice_slice_subslice2( out[0U], (size_t)8U * i0, (size_t)8U * i0 + (size_t)8U, uint8_t); uint8_t ret[8U]; core_num__u64_9__to_le_bytes(s[i0 / (size_t)5U][i0 % (size_t)5U], ret); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)8U, ret, uint8_t), uint8_t); } } /** A monomorphic instance of libcrux_sha3.portable_keccak.store_block_full with const generics - RATE= 144 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_full_2d1( uint64_t (*s)[5U], uint8_t ret[1U][200U]) { uint8_t out[200U] = {0U}; Eurydice_slice buf[1U] = { Eurydice_array_to_slice((size_t)200U, out, uint8_t)}; libcrux_sha3_portable_keccak_store_block_582(s, buf); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_out[200U]; memcpy(copy_of_out, out, (size_t)200U * sizeof(uint8_t)); memcpy(ret[0U], copy_of_out, (size_t)200U * sizeof(uint8_t)); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.store_block_full_5a with const generics - RATE= 144 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_full_5a_291(uint64_t (*a)[5U], uint8_t ret[1U][200U]) { libcrux_sha3_portable_keccak_store_block_full_2d1(a, ret); } /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_first_and_last with types uint64_t with const generics - N= 1 - RATE= 144 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_first_and_last_c51( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out[1U]) { uint8_t b[1U][200U]; libcrux_sha3_portable_keccak_store_block_full_5a_291(s->st, b); for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; Eurydice_slice uu____0 = out[i0]; uint8_t *uu____1 = b[i0]; core_ops_range_Range_b3 lit; lit.start = (size_t)0U; lit.end = Eurydice_slice_len(out[i0], uint8_t); Eurydice_slice_copy( uu____0, Eurydice_array_to_subslice((size_t)200U, uu____1, lit, uint8_t, core_ops_range_Range_b3), uint8_t); } } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.store_block_5a with const generics - RATE= 144 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_5a_592( uint64_t (*a)[5U], Eurydice_slice b[1U]) { libcrux_sha3_portable_keccak_store_block_582(a, b); } /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_first_block with types uint64_t with const generics - N= 1 - RATE= 144 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_first_block_842( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out[1U]) { libcrux_sha3_portable_keccak_store_block_5a_592(s->st, out); } /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_next_block with types uint64_t with const generics - N= 1 - RATE= 144 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_next_block_fc2( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out[1U]) { libcrux_sha3_generic_keccak_keccakf1600_21(s); libcrux_sha3_portable_keccak_store_block_5a_592(s->st, out); } /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_last with types uint64_t with const generics - N= 1 - RATE= 144 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_last_cf1( libcrux_sha3_generic_keccak_KeccakState_48 s, Eurydice_slice out[1U]) { libcrux_sha3_generic_keccak_keccakf1600_21(&s); uint8_t b[1U][200U]; libcrux_sha3_portable_keccak_store_block_full_5a_291(s.st, b); for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; Eurydice_slice uu____0 = out[i0]; uint8_t *uu____1 = b[i0]; core_ops_range_Range_b3 lit; lit.start = (size_t)0U; lit.end = Eurydice_slice_len(out[i0], uint8_t); Eurydice_slice_copy( uu____0, Eurydice_array_to_subslice((size_t)200U, uu____1, lit, uint8_t, core_ops_range_Range_b3), uint8_t); } } /** A monomorphic instance of libcrux_sha3.generic_keccak.keccak with types uint64_t with const generics - N= 1 - RATE= 144 - DELIM= 6 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_keccak_e92( Eurydice_slice data[1U], Eurydice_slice out[1U]) { libcrux_sha3_generic_keccak_KeccakState_48 s = libcrux_sha3_generic_keccak_new_1e_f4(); for (size_t i = (size_t)0U; i < Eurydice_slice_len(data[0U], uint8_t) / (size_t)144U; i++) { size_t i0 = i; libcrux_sha3_generic_keccak_KeccakState_48 *uu____0 = &s; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice ret[1U]; libcrux_sha3_portable_keccak_slice_n_5a(copy_of_data, i0 * (size_t)144U, (size_t)144U, ret); libcrux_sha3_generic_keccak_absorb_block_df1(uu____0, ret); } size_t rem = Eurydice_slice_len(data[0U], uint8_t) % (size_t)144U; libcrux_sha3_generic_keccak_KeccakState_48 *uu____2 = &s; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice ret[1U]; libcrux_sha3_portable_keccak_slice_n_5a( copy_of_data, Eurydice_slice_len(data[0U], uint8_t) - rem, rem, ret); libcrux_sha3_generic_keccak_absorb_final_c73(uu____2, ret); size_t outlen = Eurydice_slice_len(out[0U], uint8_t); size_t blocks = outlen / (size_t)144U; size_t last = outlen - outlen % (size_t)144U; if (blocks == (size_t)0U) { libcrux_sha3_generic_keccak_squeeze_first_and_last_c51(&s, out); } else { Eurydice_slice_uint8_t_1size_t__x2 uu____4 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(out, (size_t)144U); Eurydice_slice o0[1U]; memcpy(o0, uu____4.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice o1[1U]; memcpy(o1, uu____4.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_first_block_842(&s, o0); core_ops_range_Range_b3 iter = core_iter_traits_collect___core__iter__traits__collect__IntoIterator_for_I__1__into_iter( (CLITERAL(core_ops_range_Range_b3){.start = (size_t)1U, .end = blocks}), core_ops_range_Range_b3, core_ops_range_Range_b3); while (true) { if (core_iter_range___core__iter__traits__iterator__Iterator_for_core__ops__range__Range_A___6__next( &iter, size_t, Option_b3) .tag == None) { break; } else { Eurydice_slice_uint8_t_1size_t__x2 uu____5 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(o1, (size_t)144U); Eurydice_slice o[1U]; memcpy(o, uu____5.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice orest[1U]; memcpy(orest, uu____5.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_next_block_fc2(&s, o); memcpy(o1, orest, (size_t)1U * sizeof(Eurydice_slice)); } } if (last < outlen) { libcrux_sha3_generic_keccak_squeeze_last_cf1(s, o1); } } } /** A monomorphic instance of libcrux_sha3.portable.keccakx1 with const generics - RATE= 144 - DELIM= 6 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccakx1_ce2( Eurydice_slice data[1U], Eurydice_slice out[1U]) { /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_keccak_e92(copy_of_data, out); } /** A portable SHA3 224 implementation. */ static KRML_MUSTINLINE void libcrux_sha3_portable_sha224(Eurydice_slice digest, Eurydice_slice data) { Eurydice_slice buf0[1U] = {data}; Eurydice_slice buf[1U] = {digest}; libcrux_sha3_portable_keccakx1_ce2(buf0, buf); } /** A monomorphic instance of libcrux_sha3.portable_keccak.load_block with const generics - RATE= 104 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_2c3( uint64_t (*s)[5U], Eurydice_slice blocks[1U]) { for (size_t i = (size_t)0U; i < (size_t)104U / (size_t)8U; i++) { size_t i0 = i; uint8_t uu____0[8U]; Result_56 dst; Eurydice_slice_to_array2( &dst, Eurydice_slice_subslice2(blocks[0U], (size_t)8U * i0, (size_t)8U * i0 + (size_t)8U, uint8_t), Eurydice_slice, uint8_t[8U]); unwrap_41_ac(dst, uu____0); size_t uu____1 = i0 / (size_t)5U; size_t uu____2 = i0 % (size_t)5U; s[uu____1][uu____2] = s[uu____1][uu____2] ^ core_num__u64_9__from_le_bytes(uu____0); } } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.load_block_5a with const generics - RATE= 104 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_5a_b82( uint64_t (*a)[5U], Eurydice_slice b[1U]) { uint64_t(*uu____0)[5U] = a; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_b[1U]; memcpy(copy_of_b, b, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_portable_keccak_load_block_2c3(uu____0, copy_of_b); } /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_block with types uint64_t with const generics - N= 1 - RATE= 104 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_block_df2( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice blocks[1U]) { uint64_t(*uu____0)[5U] = s->st; Eurydice_slice uu____1[1U]; memcpy(uu____1, blocks, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_portable_keccak_load_block_5a_b82(uu____0, uu____1); libcrux_sha3_generic_keccak_keccakf1600_21(s); } /** A monomorphic instance of libcrux_sha3.portable_keccak.load_block_full with const generics - RATE= 104 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_full_df3( uint64_t (*s)[5U], uint8_t blocks[1U][200U]) { Eurydice_slice buf[1U] = { Eurydice_array_to_slice((size_t)200U, blocks[0U], uint8_t)}; libcrux_sha3_portable_keccak_load_block_2c3(s, buf); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.load_block_full_5a with const generics - RATE= 104 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_full_5a_d23( uint64_t (*a)[5U], uint8_t b[1U][200U]) { uint64_t(*uu____0)[5U] = a; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_b[1U][200U]; memcpy(copy_of_b, b, (size_t)1U * sizeof(uint8_t[200U])); libcrux_sha3_portable_keccak_load_block_full_df3(uu____0, copy_of_b); } /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_final with types uint64_t with const generics - N= 1 - RATE= 104 - DELIM= 6 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_final_c74( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice last[1U]) { size_t last_len = Eurydice_slice_len(last[0U], uint8_t); uint8_t blocks[1U][200U] = {{0U}}; for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; if (last_len > (size_t)0U) { Eurydice_slice uu____0 = Eurydice_array_to_subslice2( blocks[i0], (size_t)0U, last_len, uint8_t); Eurydice_slice_copy(uu____0, last[i0], uint8_t); } blocks[i0][last_len] = 6U; size_t uu____1 = i0; size_t uu____2 = (size_t)104U - (size_t)1U; blocks[uu____1][uu____2] = (uint32_t)blocks[uu____1][uu____2] | 128U; } uint64_t(*uu____3)[5U] = s->st; uint8_t uu____4[1U][200U]; memcpy(uu____4, blocks, (size_t)1U * sizeof(uint8_t[200U])); libcrux_sha3_portable_keccak_load_block_full_5a_d23(uu____3, uu____4); libcrux_sha3_generic_keccak_keccakf1600_21(s); } /** A monomorphic instance of libcrux_sha3.portable_keccak.store_block with const generics - RATE= 104 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_583( uint64_t (*s)[5U], Eurydice_slice out[1U]) { for (size_t i = (size_t)0U; i < (size_t)104U / (size_t)8U; i++) { size_t i0 = i; Eurydice_slice uu____0 = Eurydice_slice_subslice2( out[0U], (size_t)8U * i0, (size_t)8U * i0 + (size_t)8U, uint8_t); uint8_t ret[8U]; core_num__u64_9__to_le_bytes(s[i0 / (size_t)5U][i0 % (size_t)5U], ret); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)8U, ret, uint8_t), uint8_t); } } /** A monomorphic instance of libcrux_sha3.portable_keccak.store_block_full with const generics - RATE= 104 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_full_2d2( uint64_t (*s)[5U], uint8_t ret[1U][200U]) { uint8_t out[200U] = {0U}; Eurydice_slice buf[1U] = { Eurydice_array_to_slice((size_t)200U, out, uint8_t)}; libcrux_sha3_portable_keccak_store_block_583(s, buf); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_out[200U]; memcpy(copy_of_out, out, (size_t)200U * sizeof(uint8_t)); memcpy(ret[0U], copy_of_out, (size_t)200U * sizeof(uint8_t)); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.store_block_full_5a with const generics - RATE= 104 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_full_5a_292(uint64_t (*a)[5U], uint8_t ret[1U][200U]) { libcrux_sha3_portable_keccak_store_block_full_2d2(a, ret); } /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_first_and_last with types uint64_t with const generics - N= 1 - RATE= 104 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_first_and_last_c52( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out[1U]) { uint8_t b[1U][200U]; libcrux_sha3_portable_keccak_store_block_full_5a_292(s->st, b); for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; Eurydice_slice uu____0 = out[i0]; uint8_t *uu____1 = b[i0]; core_ops_range_Range_b3 lit; lit.start = (size_t)0U; lit.end = Eurydice_slice_len(out[i0], uint8_t); Eurydice_slice_copy( uu____0, Eurydice_array_to_subslice((size_t)200U, uu____1, lit, uint8_t, core_ops_range_Range_b3), uint8_t); } } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.store_block_5a with const generics - RATE= 104 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_5a_593( uint64_t (*a)[5U], Eurydice_slice b[1U]) { libcrux_sha3_portable_keccak_store_block_583(a, b); } /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_first_block with types uint64_t with const generics - N= 1 - RATE= 104 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_first_block_843( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out[1U]) { libcrux_sha3_portable_keccak_store_block_5a_593(s->st, out); } /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_next_block with types uint64_t with const generics - N= 1 - RATE= 104 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_next_block_fc3( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out[1U]) { libcrux_sha3_generic_keccak_keccakf1600_21(s); libcrux_sha3_portable_keccak_store_block_5a_593(s->st, out); } /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_last with types uint64_t with const generics - N= 1 - RATE= 104 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_last_cf2( libcrux_sha3_generic_keccak_KeccakState_48 s, Eurydice_slice out[1U]) { libcrux_sha3_generic_keccak_keccakf1600_21(&s); uint8_t b[1U][200U]; libcrux_sha3_portable_keccak_store_block_full_5a_292(s.st, b); for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; Eurydice_slice uu____0 = out[i0]; uint8_t *uu____1 = b[i0]; core_ops_range_Range_b3 lit; lit.start = (size_t)0U; lit.end = Eurydice_slice_len(out[i0], uint8_t); Eurydice_slice_copy( uu____0, Eurydice_array_to_subslice((size_t)200U, uu____1, lit, uint8_t, core_ops_range_Range_b3), uint8_t); } } /** A monomorphic instance of libcrux_sha3.generic_keccak.keccak with types uint64_t with const generics - N= 1 - RATE= 104 - DELIM= 6 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_keccak_e93( Eurydice_slice data[1U], Eurydice_slice out[1U]) { libcrux_sha3_generic_keccak_KeccakState_48 s = libcrux_sha3_generic_keccak_new_1e_f4(); for (size_t i = (size_t)0U; i < Eurydice_slice_len(data[0U], uint8_t) / (size_t)104U; i++) { size_t i0 = i; libcrux_sha3_generic_keccak_KeccakState_48 *uu____0 = &s; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice ret[1U]; libcrux_sha3_portable_keccak_slice_n_5a(copy_of_data, i0 * (size_t)104U, (size_t)104U, ret); libcrux_sha3_generic_keccak_absorb_block_df2(uu____0, ret); } size_t rem = Eurydice_slice_len(data[0U], uint8_t) % (size_t)104U; libcrux_sha3_generic_keccak_KeccakState_48 *uu____2 = &s; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice ret[1U]; libcrux_sha3_portable_keccak_slice_n_5a( copy_of_data, Eurydice_slice_len(data[0U], uint8_t) - rem, rem, ret); libcrux_sha3_generic_keccak_absorb_final_c74(uu____2, ret); size_t outlen = Eurydice_slice_len(out[0U], uint8_t); size_t blocks = outlen / (size_t)104U; size_t last = outlen - outlen % (size_t)104U; if (blocks == (size_t)0U) { libcrux_sha3_generic_keccak_squeeze_first_and_last_c52(&s, out); } else { Eurydice_slice_uint8_t_1size_t__x2 uu____4 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(out, (size_t)104U); Eurydice_slice o0[1U]; memcpy(o0, uu____4.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice o1[1U]; memcpy(o1, uu____4.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_first_block_843(&s, o0); core_ops_range_Range_b3 iter = core_iter_traits_collect___core__iter__traits__collect__IntoIterator_for_I__1__into_iter( (CLITERAL(core_ops_range_Range_b3){.start = (size_t)1U, .end = blocks}), core_ops_range_Range_b3, core_ops_range_Range_b3); while (true) { if (core_iter_range___core__iter__traits__iterator__Iterator_for_core__ops__range__Range_A___6__next( &iter, size_t, Option_b3) .tag == None) { break; } else { Eurydice_slice_uint8_t_1size_t__x2 uu____5 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(o1, (size_t)104U); Eurydice_slice o[1U]; memcpy(o, uu____5.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice orest[1U]; memcpy(orest, uu____5.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_next_block_fc3(&s, o); memcpy(o1, orest, (size_t)1U * sizeof(Eurydice_slice)); } } if (last < outlen) { libcrux_sha3_generic_keccak_squeeze_last_cf2(s, o1); } } } /** A monomorphic instance of libcrux_sha3.portable.keccakx1 with const generics - RATE= 104 - DELIM= 6 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccakx1_ce3( Eurydice_slice data[1U], Eurydice_slice out[1U]) { /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_keccak_e93(copy_of_data, out); } /** A portable SHA3 384 implementation. */ static KRML_MUSTINLINE void libcrux_sha3_portable_sha384(Eurydice_slice digest, Eurydice_slice data) { Eurydice_slice buf0[1U] = {data}; Eurydice_slice buf[1U] = {digest}; libcrux_sha3_portable_keccakx1_ce3(buf0, buf); } /** SHA3 224 Preconditions: - `digest.len() == 28` */ static KRML_MUSTINLINE void libcrux_sha3_sha224_ema(Eurydice_slice digest, Eurydice_slice payload) { libcrux_sha3_portable_sha224(digest, payload); } /** SHA3 224 */ static KRML_MUSTINLINE void libcrux_sha3_sha224(Eurydice_slice data, uint8_t ret[28U]) { uint8_t out[28U] = {0U}; libcrux_sha3_sha224_ema(Eurydice_array_to_slice((size_t)28U, out, uint8_t), data); memcpy(ret, out, (size_t)28U * sizeof(uint8_t)); } /** SHA3 256 */ static KRML_MUSTINLINE void libcrux_sha3_sha256_ema(Eurydice_slice digest, Eurydice_slice payload) { libcrux_sha3_portable_sha256(digest, payload); } /** SHA3 256 */ static KRML_MUSTINLINE void libcrux_sha3_sha256(Eurydice_slice data, uint8_t ret[32U]) { uint8_t out[32U] = {0U}; libcrux_sha3_sha256_ema(Eurydice_array_to_slice((size_t)32U, out, uint8_t), data); memcpy(ret, out, (size_t)32U * sizeof(uint8_t)); } /** SHA3 384 */ static KRML_MUSTINLINE void libcrux_sha3_sha384_ema(Eurydice_slice digest, Eurydice_slice payload) { libcrux_sha3_portable_sha384(digest, payload); } /** SHA3 384 */ static KRML_MUSTINLINE void libcrux_sha3_sha384(Eurydice_slice data, uint8_t ret[48U]) { uint8_t out[48U] = {0U}; libcrux_sha3_sha384_ema(Eurydice_array_to_slice((size_t)48U, out, uint8_t), data); memcpy(ret, out, (size_t)48U * sizeof(uint8_t)); } /** SHA3 512 */ static KRML_MUSTINLINE void libcrux_sha3_sha512_ema(Eurydice_slice digest, Eurydice_slice payload) { libcrux_sha3_portable_sha512(digest, payload); } /** SHA3 512 */ static KRML_MUSTINLINE void libcrux_sha3_sha512(Eurydice_slice data, uint8_t ret[64U]) { uint8_t out[64U] = {0U}; libcrux_sha3_sha512_ema(Eurydice_array_to_slice((size_t)64U, out, uint8_t), data); memcpy(ret, out, (size_t)64U * sizeof(uint8_t)); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.load_block_5a with const generics - RATE= 168 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_load_block_5a_b83( uint64_t (*a)[5U], Eurydice_slice b[1U]) { uint64_t(*uu____0)[5U] = a; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_b[1U]; memcpy(copy_of_b, b, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_portable_keccak_load_block_2c1(uu____0, copy_of_b); } /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_block with types uint64_t with const generics - N= 1 - RATE= 168 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_block_df3( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice blocks[1U]) { uint64_t(*uu____0)[5U] = s->st; Eurydice_slice uu____1[1U]; memcpy(uu____1, blocks, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_portable_keccak_load_block_5a_b83(uu____0, uu____1); libcrux_sha3_generic_keccak_keccakf1600_21(s); } /** A monomorphic instance of libcrux_sha3.portable_keccak.store_block_full with const generics - RATE= 168 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_full_2d3( uint64_t (*s)[5U], uint8_t ret[1U][200U]) { uint8_t out[200U] = {0U}; Eurydice_slice buf[1U] = { Eurydice_array_to_slice((size_t)200U, out, uint8_t)}; libcrux_sha3_portable_keccak_store_block_581(s, buf); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_out[200U]; memcpy(copy_of_out, out, (size_t)200U * sizeof(uint8_t)); memcpy(ret[0U], copy_of_out, (size_t)200U * sizeof(uint8_t)); } /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.store_block_full_5a with const generics - RATE= 168 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_block_full_5a_293(uint64_t (*a)[5U], uint8_t ret[1U][200U]) { libcrux_sha3_portable_keccak_store_block_full_2d3(a, ret); } /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_first_and_last with types uint64_t with const generics - N= 1 - RATE= 168 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_first_and_last_c53( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out[1U]) { uint8_t b[1U][200U]; libcrux_sha3_portable_keccak_store_block_full_5a_293(s->st, b); for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; Eurydice_slice uu____0 = out[i0]; uint8_t *uu____1 = b[i0]; core_ops_range_Range_b3 lit; lit.start = (size_t)0U; lit.end = Eurydice_slice_len(out[i0], uint8_t); Eurydice_slice_copy( uu____0, Eurydice_array_to_subslice((size_t)200U, uu____1, lit, uint8_t, core_ops_range_Range_b3), uint8_t); } } /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_last with types uint64_t with const generics - N= 1 - RATE= 168 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_last_cf3( libcrux_sha3_generic_keccak_KeccakState_48 s, Eurydice_slice out[1U]) { libcrux_sha3_generic_keccak_keccakf1600_21(&s); uint8_t b[1U][200U]; libcrux_sha3_portable_keccak_store_block_full_5a_293(s.st, b); for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; Eurydice_slice uu____0 = out[i0]; uint8_t *uu____1 = b[i0]; core_ops_range_Range_b3 lit; lit.start = (size_t)0U; lit.end = Eurydice_slice_len(out[i0], uint8_t); Eurydice_slice_copy( uu____0, Eurydice_array_to_subslice((size_t)200U, uu____1, lit, uint8_t, core_ops_range_Range_b3), uint8_t); } } /** A monomorphic instance of libcrux_sha3.generic_keccak.keccak with types uint64_t with const generics - N= 1 - RATE= 168 - DELIM= 31 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_keccak_e94( Eurydice_slice data[1U], Eurydice_slice out[1U]) { libcrux_sha3_generic_keccak_KeccakState_48 s = libcrux_sha3_generic_keccak_new_1e_f4(); for (size_t i = (size_t)0U; i < Eurydice_slice_len(data[0U], uint8_t) / (size_t)168U; i++) { size_t i0 = i; libcrux_sha3_generic_keccak_KeccakState_48 *uu____0 = &s; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice ret[1U]; libcrux_sha3_portable_keccak_slice_n_5a(copy_of_data, i0 * (size_t)168U, (size_t)168U, ret); libcrux_sha3_generic_keccak_absorb_block_df3(uu____0, ret); } size_t rem = Eurydice_slice_len(data[0U], uint8_t) % (size_t)168U; libcrux_sha3_generic_keccak_KeccakState_48 *uu____2 = &s; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice ret[1U]; libcrux_sha3_portable_keccak_slice_n_5a( copy_of_data, Eurydice_slice_len(data[0U], uint8_t) - rem, rem, ret); libcrux_sha3_generic_keccak_absorb_final_c72(uu____2, ret); size_t outlen = Eurydice_slice_len(out[0U], uint8_t); size_t blocks = outlen / (size_t)168U; size_t last = outlen - outlen % (size_t)168U; if (blocks == (size_t)0U) { libcrux_sha3_generic_keccak_squeeze_first_and_last_c53(&s, out); } else { Eurydice_slice_uint8_t_1size_t__x2 uu____4 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(out, (size_t)168U); Eurydice_slice o0[1U]; memcpy(o0, uu____4.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice o1[1U]; memcpy(o1, uu____4.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_first_block_841(&s, o0); core_ops_range_Range_b3 iter = core_iter_traits_collect___core__iter__traits__collect__IntoIterator_for_I__1__into_iter( (CLITERAL(core_ops_range_Range_b3){.start = (size_t)1U, .end = blocks}), core_ops_range_Range_b3, core_ops_range_Range_b3); while (true) { if (core_iter_range___core__iter__traits__iterator__Iterator_for_core__ops__range__Range_A___6__next( &iter, size_t, Option_b3) .tag == None) { break; } else { Eurydice_slice_uint8_t_1size_t__x2 uu____5 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(o1, (size_t)168U); Eurydice_slice o[1U]; memcpy(o, uu____5.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice orest[1U]; memcpy(orest, uu____5.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_next_block_fc1(&s, o); memcpy(o1, orest, (size_t)1U * sizeof(Eurydice_slice)); } } if (last < outlen) { libcrux_sha3_generic_keccak_squeeze_last_cf3(s, o1); } } } /** A monomorphic instance of libcrux_sha3.portable.keccakx1 with const generics - RATE= 168 - DELIM= 31 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccakx1_ce4( Eurydice_slice data[1U], Eurydice_slice out[1U]) { /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_data[1U]; memcpy(copy_of_data, data, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_keccak_e94(copy_of_data, out); } /** A portable SHAKE128 implementation. */ static KRML_MUSTINLINE void libcrux_sha3_portable_shake128( Eurydice_slice digest, Eurydice_slice data) { Eurydice_slice buf0[1U] = {data}; Eurydice_slice buf[1U] = {digest}; libcrux_sha3_portable_keccakx1_ce4(buf0, buf); } /** SHAKE 128 Writes `out.len()` bytes. */ static KRML_MUSTINLINE void libcrux_sha3_shake128_ema(Eurydice_slice out, Eurydice_slice data) { libcrux_sha3_portable_shake128(out, data); } /** SHAKE 256 Writes `out.len()` bytes. */ static KRML_MUSTINLINE void libcrux_sha3_shake256_ema(Eurydice_slice out, Eurydice_slice data) { libcrux_sha3_portable_shake256(out, data); } static const size_t libcrux_sha3_generic_keccak__PI[24U] = { (size_t)6U, (size_t)12U, (size_t)18U, (size_t)24U, (size_t)3U, (size_t)9U, (size_t)10U, (size_t)16U, (size_t)22U, (size_t)1U, (size_t)7U, (size_t)13U, (size_t)19U, (size_t)20U, (size_t)4U, (size_t)5U, (size_t)11U, (size_t)17U, (size_t)23U, (size_t)2U, (size_t)8U, (size_t)14U, (size_t)15U, (size_t)21U}; static const size_t libcrux_sha3_generic_keccak__ROTC[24U] = { (size_t)1U, (size_t)62U, (size_t)28U, (size_t)27U, (size_t)36U, (size_t)44U, (size_t)6U, (size_t)55U, (size_t)20U, (size_t)3U, (size_t)10U, (size_t)43U, (size_t)25U, (size_t)39U, (size_t)41U, (size_t)45U, (size_t)15U, (size_t)21U, (size_t)8U, (size_t)18U, (size_t)2U, (size_t)61U, (size_t)56U, (size_t)14U}; /** A portable SHA3 224 implementation. */ static KRML_MUSTINLINE void libcrux_sha3_neon_sha224(Eurydice_slice digest, Eurydice_slice data) { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "panic!"); KRML_HOST_EXIT(255U); } /** A portable SHA3 256 implementation. */ static KRML_MUSTINLINE void libcrux_sha3_neon_sha256(Eurydice_slice digest, Eurydice_slice data) { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "panic!"); KRML_HOST_EXIT(255U); } /** A portable SHA3 384 implementation. */ static KRML_MUSTINLINE void libcrux_sha3_neon_sha384(Eurydice_slice digest, Eurydice_slice data) { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "panic!"); KRML_HOST_EXIT(255U); } /** A portable SHA3 512 implementation. */ static KRML_MUSTINLINE void libcrux_sha3_neon_sha512(Eurydice_slice digest, Eurydice_slice data) { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "panic!"); KRML_HOST_EXIT(255U); } /** Run SHAKE256 on both inputs in parallel. Writes the two results into `out0` and `out1` */ static KRML_MUSTINLINE void libcrux_sha3_neon_x2_shake256(Eurydice_slice input0, Eurydice_slice input1, Eurydice_slice out0, Eurydice_slice out1) { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "panic!"); KRML_HOST_EXIT(255U); } typedef struct libcrux_sha3_neon_x2_incremental_KeccakState_s { libcrux_sha3_generic_keccak_KeccakState_48 state[2U]; } libcrux_sha3_neon_x2_incremental_KeccakState; /** Initialise the `KeccakState2`. */ static KRML_MUSTINLINE libcrux_sha3_neon_x2_incremental_KeccakState libcrux_sha3_neon_x2_incremental_shake128_init(void) { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "panic!"); KRML_HOST_EXIT(255U); } /** Shake128 absorb `data0` and `data1` in the [`KeccakState`] `s`. */ static KRML_MUSTINLINE void libcrux_sha3_neon_x2_incremental_shake128_absorb_final( libcrux_sha3_neon_x2_incremental_KeccakState *s, Eurydice_slice data0, Eurydice_slice data1) { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "panic!"); KRML_HOST_EXIT(255U); } /** Squeeze 2 times the first three blocks in parallel in the [`KeccakState`] and return the output in `out0` and `out1`. */ static KRML_MUSTINLINE void libcrux_sha3_neon_x2_incremental_shake128_squeeze_first_three_blocks( libcrux_sha3_neon_x2_incremental_KeccakState *s, Eurydice_slice out0, Eurydice_slice out1) { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "panic!"); KRML_HOST_EXIT(255U); } /** Squeeze 2 times the next block in parallel in the [`KeccakState`] and return the output in `out0` and `out1`. */ static KRML_MUSTINLINE void libcrux_sha3_neon_x2_incremental_shake128_squeeze_next_block( libcrux_sha3_neon_x2_incremental_KeccakState *s, Eurydice_slice out0, Eurydice_slice out1) { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "panic!"); KRML_HOST_EXIT(255U); } /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_first_five_blocks with types uint64_t with const generics - N= 1 - RATE= 168 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_first_five_blocks_4f( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out[1U]) { Eurydice_slice_uint8_t_1size_t__x2 uu____0 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(out, (size_t)168U); Eurydice_slice o0[1U]; memcpy(o0, uu____0.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice o10[1U]; memcpy(o10, uu____0.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_first_block_841(s, o0); Eurydice_slice_uint8_t_1size_t__x2 uu____1 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(o10, (size_t)168U); Eurydice_slice o1[1U]; memcpy(o1, uu____1.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice o20[1U]; memcpy(o20, uu____1.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_next_block_fc1(s, o1); Eurydice_slice_uint8_t_1size_t__x2 uu____2 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(o20, (size_t)168U); Eurydice_slice o2[1U]; memcpy(o2, uu____2.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice o30[1U]; memcpy(o30, uu____2.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_next_block_fc1(s, o2); Eurydice_slice_uint8_t_1size_t__x2 uu____3 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(o30, (size_t)168U); Eurydice_slice o3[1U]; memcpy(o3, uu____3.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice o4[1U]; memcpy(o4, uu____3.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_squeeze_next_block_fc1(s, o3); libcrux_sha3_generic_keccak_squeeze_next_block_fc1(s, o4); } /** Squeeze five blocks */ static KRML_MUSTINLINE void libcrux_sha3_portable_incremental_shake128_squeeze_first_five_blocks( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out0) { Eurydice_slice buf[1U] = {out0}; libcrux_sha3_generic_keccak_squeeze_first_five_blocks_4f(s, buf); } /** Absorb some data for SHAKE-256 for the last time */ static KRML_MUSTINLINE void libcrux_sha3_portable_incremental_shake256_absorb_final( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice data) { Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_final_c71(s, buf); } /** Create a new SHAKE-256 state object. */ static KRML_MUSTINLINE libcrux_sha3_generic_keccak_KeccakState_48 libcrux_sha3_portable_incremental_shake256_init(void) { return libcrux_sha3_generic_keccak_new_1e_f4(); } /** Squeeze the first SHAKE-256 block */ static KRML_MUSTINLINE void libcrux_sha3_portable_incremental_shake256_squeeze_first_block( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out) { Eurydice_slice buf[1U] = {out}; libcrux_sha3_generic_keccak_squeeze_first_block_840(s, buf); } /** Squeeze the next SHAKE-256 block */ static KRML_MUSTINLINE void libcrux_sha3_portable_incremental_shake256_squeeze_next_block( libcrux_sha3_generic_keccak_KeccakState_48 *s, Eurydice_slice out) { Eurydice_slice buf[1U] = {out}; libcrux_sha3_generic_keccak_squeeze_next_block_fc0(s, buf); } /** A monomorphic instance of libcrux_sha3.generic_keccak.KeccakXofState with types uint64_t with const generics - $1size_t - $136size_t */ typedef struct libcrux_sha3_generic_keccak_KeccakXofState_4f_s { libcrux_sha3_generic_keccak_KeccakState_48 inner; uint8_t buf[1U][136U]; size_t buf_len; bool sponge; } libcrux_sha3_generic_keccak_KeccakXofState_4f; typedef libcrux_sha3_generic_keccak_KeccakXofState_4f libcrux_sha3_portable_incremental_Shake256Absorb; /** Consume the internal buffer and the required amount of the input to pad to `RATE`. Returns the `consumed` bytes from `inputs` if there's enough buffered content to consume, and `0` otherwise. If `consumed > 0` is returned, `self.buf` contains a full block to be loaded. */ /** This function found in impl {libcrux_sha3::generic_keccak::KeccakXofState[TraitClause@@0]#2} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.fill_buffer_9d with types uint64_t with const generics - PARALLEL_LANES= 1 - RATE= 136 */ static inline size_t libcrux_sha3_generic_keccak_fill_buffer_9d_b0( libcrux_sha3_generic_keccak_KeccakXofState_4f *self, Eurydice_slice inputs[1U]) { size_t input_len = Eurydice_slice_len(inputs[0U], uint8_t); size_t consumed = (size_t)0U; if (self->buf_len > (size_t)0U) { if (self->buf_len + input_len >= (size_t)136U) { consumed = (size_t)136U - self->buf_len; for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; Eurydice_slice uu____0 = Eurydice_array_to_subslice_from( (size_t)136U, self->buf[i0], self->buf_len, uint8_t, size_t); Eurydice_slice_copy( uu____0, Eurydice_slice_subslice_to(inputs[i0], consumed, uint8_t, size_t), uint8_t); } self->buf_len = self->buf_len + consumed; } } return consumed; } /** This function found in impl {libcrux_sha3::generic_keccak::KeccakXofState[TraitClause@@0]#2} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_full_9d with types uint64_t with const generics - PARALLEL_LANES= 1 - RATE= 136 */ static inline size_t libcrux_sha3_generic_keccak_absorb_full_9d_f8( libcrux_sha3_generic_keccak_KeccakXofState_4f *self, Eurydice_slice inputs[1U]) { libcrux_sha3_generic_keccak_KeccakXofState_4f *uu____0 = self; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_inputs0[1U]; memcpy(copy_of_inputs0, inputs, (size_t)1U * sizeof(Eurydice_slice)); size_t input_consumed = libcrux_sha3_generic_keccak_fill_buffer_9d_b0(uu____0, copy_of_inputs0); if (input_consumed > (size_t)0U) { Eurydice_slice borrowed[1U]; for (size_t i = (size_t)0U; i < (size_t)1U; i++) { uint8_t buf[136U] = {0U}; borrowed[i] = core_array___Array_T__N__23__as_slice( (size_t)136U, buf, uint8_t, Eurydice_slice); } for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; borrowed[i0] = Eurydice_array_to_slice((size_t)136U, self->buf[i0], uint8_t); } uint64_t(*uu____2)[5U] = self->inner.st; Eurydice_slice uu____3[1U]; memcpy(uu____3, borrowed, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_portable_keccak_load_block_5a_b80(uu____2, uu____3); libcrux_sha3_generic_keccak_keccakf1600_21(&self->inner); self->buf_len = (size_t)0U; } size_t input_to_consume = Eurydice_slice_len(inputs[0U], uint8_t) - input_consumed; size_t num_blocks = input_to_consume / (size_t)136U; size_t remainder = input_to_consume % (size_t)136U; for (size_t i = (size_t)0U; i < num_blocks; i++) { size_t i0 = i; uint64_t(*uu____4)[5U] = self->inner.st; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_inputs[1U]; memcpy(copy_of_inputs, inputs, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice ret[1U]; libcrux_sha3_portable_keccak_slice_n_5a( copy_of_inputs, input_consumed + i0 * (size_t)136U, (size_t)136U, ret); libcrux_sha3_portable_keccak_load_block_5a_b80(uu____4, ret); libcrux_sha3_generic_keccak_keccakf1600_21(&self->inner); } return remainder; } /** Absorb This function takes any number of bytes to absorb and buffers if it's not enough. The function assumes that all input slices in `blocks` have the same length. Only a multiple of `RATE` blocks are absorbed. For the remaining bytes [`absorb_final`] needs to be called. This works best with relatively small `inputs`. */ /** This function found in impl {libcrux_sha3::generic_keccak::KeccakXofState[TraitClause@@0]#2} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_9d with types uint64_t with const generics - PARALLEL_LANES= 1 - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_9d_7b( libcrux_sha3_generic_keccak_KeccakXofState_4f *self, Eurydice_slice inputs[1U]) { libcrux_sha3_generic_keccak_KeccakXofState_4f *uu____0 = self; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_inputs[1U]; memcpy(copy_of_inputs, inputs, (size_t)1U * sizeof(Eurydice_slice)); size_t input_remainder_len = libcrux_sha3_generic_keccak_absorb_full_9d_f8(uu____0, copy_of_inputs); if (input_remainder_len > (size_t)0U) { size_t input_len = Eurydice_slice_len(inputs[0U], uint8_t); for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; Eurydice_slice uu____2 = Eurydice_array_to_subslice2( self->buf[i0], self->buf_len, self->buf_len + input_remainder_len, uint8_t); Eurydice_slice_copy( uu____2, Eurydice_slice_subslice_from( inputs[i0], input_len - input_remainder_len, uint8_t, size_t), uint8_t); } self->buf_len = self->buf_len + input_remainder_len; } } /** Shake256 absorb */ /** This function found in impl {(libcrux_sha3::portable::incremental::XofAbsorb<136: usize> for libcrux_sha3::portable::incremental::Shake256Absorb)#2} */ static inline void libcrux_sha3_portable_incremental_absorb_7d( libcrux_sha3_generic_keccak_KeccakXofState_4f *self, Eurydice_slice input) { Eurydice_slice buf[1U] = {input}; libcrux_sha3_generic_keccak_absorb_9d_7b(self, buf); } typedef libcrux_sha3_generic_keccak_KeccakXofState_4f libcrux_sha3_portable_incremental_Shake256Squeeze; /** Absorb a final block. The `inputs` block may be empty. Everything in the `inputs` block beyond `RATE` bytes is ignored. */ /** This function found in impl {libcrux_sha3::generic_keccak::KeccakXofState[TraitClause@@0]#2} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_final_9d with types uint64_t with const generics - PARALLEL_LANES= 1 - RATE= 136 - DELIMITER= 31 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_final_9d_25( libcrux_sha3_generic_keccak_KeccakXofState_4f *self, Eurydice_slice inputs[1U]) { libcrux_sha3_generic_keccak_KeccakXofState_4f *uu____0 = self; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_inputs[1U]; memcpy(copy_of_inputs, inputs, (size_t)1U * sizeof(Eurydice_slice)); size_t input_remainder_len = libcrux_sha3_generic_keccak_absorb_full_9d_f8(uu____0, copy_of_inputs); size_t input_len = Eurydice_slice_len(inputs[0U], uint8_t); uint8_t blocks[1U][200U] = {{0U}}; for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; if (self->buf_len > (size_t)0U) { Eurydice_slice uu____2 = Eurydice_array_to_subslice2( blocks[i0], (size_t)0U, self->buf_len, uint8_t); Eurydice_slice_copy(uu____2, Eurydice_array_to_subslice2(self->buf[i0], (size_t)0U, self->buf_len, uint8_t), uint8_t); } if (input_remainder_len > (size_t)0U) { Eurydice_slice uu____3 = Eurydice_array_to_subslice2( blocks[i0], self->buf_len, self->buf_len + input_remainder_len, uint8_t); Eurydice_slice_copy( uu____3, Eurydice_slice_subslice_from( inputs[i0], input_len - input_remainder_len, uint8_t, size_t), uint8_t); } blocks[i0][self->buf_len + input_remainder_len] = 31U; size_t uu____4 = i0; size_t uu____5 = (size_t)136U - (size_t)1U; blocks[uu____4][uu____5] = (uint32_t)blocks[uu____4][uu____5] | 128U; } uint64_t(*uu____6)[5U] = self->inner.st; uint8_t uu____7[1U][200U]; memcpy(uu____7, blocks, (size_t)1U * sizeof(uint8_t[200U])); libcrux_sha3_portable_keccak_load_block_full_5a_d20(uu____6, uu____7); libcrux_sha3_generic_keccak_keccakf1600_21(&self->inner); } /** Shake256 absorb final */ /** This function found in impl {(libcrux_sha3::portable::incremental::XofAbsorb<136: usize> for libcrux_sha3::portable::incremental::Shake256Absorb)#2} */ static inline libcrux_sha3_generic_keccak_KeccakXofState_4f libcrux_sha3_portable_incremental_absorb_final_7d( libcrux_sha3_generic_keccak_KeccakXofState_4f self, Eurydice_slice input) { Eurydice_slice buf[1U] = {input}; libcrux_sha3_generic_keccak_absorb_final_9d_25(&self, buf); return self; } /** An all zero block */ /** This function found in impl {libcrux_sha3::generic_keccak::KeccakXofState[TraitClause@@0]#2} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.zero_block_9d with types uint64_t with const generics - PARALLEL_LANES= 1 - RATE= 136 */ static inline void libcrux_sha3_generic_keccak_zero_block_9d_e6( uint8_t ret[136U]) { ret[0U] = 0U; ret[1U] = 0U; ret[2U] = 0U; ret[3U] = 0U; ret[4U] = 0U; ret[5U] = 0U; ret[6U] = 0U; ret[7U] = 0U; ret[8U] = 0U; ret[9U] = 0U; ret[10U] = 0U; ret[11U] = 0U; ret[12U] = 0U; ret[13U] = 0U; ret[14U] = 0U; ret[15U] = 0U; ret[16U] = 0U; ret[17U] = 0U; ret[18U] = 0U; ret[19U] = 0U; ret[20U] = 0U; ret[21U] = 0U; ret[22U] = 0U; ret[23U] = 0U; ret[24U] = 0U; ret[25U] = 0U; ret[26U] = 0U; ret[27U] = 0U; ret[28U] = 0U; ret[29U] = 0U; ret[30U] = 0U; ret[31U] = 0U; ret[32U] = 0U; ret[33U] = 0U; ret[34U] = 0U; ret[35U] = 0U; ret[36U] = 0U; ret[37U] = 0U; ret[38U] = 0U; ret[39U] = 0U; ret[40U] = 0U; ret[41U] = 0U; ret[42U] = 0U; ret[43U] = 0U; ret[44U] = 0U; ret[45U] = 0U; ret[46U] = 0U; ret[47U] = 0U; ret[48U] = 0U; ret[49U] = 0U; ret[50U] = 0U; ret[51U] = 0U; ret[52U] = 0U; ret[53U] = 0U; ret[54U] = 0U; ret[55U] = 0U; ret[56U] = 0U; ret[57U] = 0U; ret[58U] = 0U; ret[59U] = 0U; ret[60U] = 0U; ret[61U] = 0U; ret[62U] = 0U; ret[63U] = 0U; ret[64U] = 0U; ret[65U] = 0U; ret[66U] = 0U; ret[67U] = 0U; ret[68U] = 0U; ret[69U] = 0U; ret[70U] = 0U; ret[71U] = 0U; ret[72U] = 0U; ret[73U] = 0U; ret[74U] = 0U; ret[75U] = 0U; ret[76U] = 0U; ret[77U] = 0U; ret[78U] = 0U; ret[79U] = 0U; ret[80U] = 0U; ret[81U] = 0U; ret[82U] = 0U; ret[83U] = 0U; ret[84U] = 0U; ret[85U] = 0U; ret[86U] = 0U; ret[87U] = 0U; ret[88U] = 0U; ret[89U] = 0U; ret[90U] = 0U; ret[91U] = 0U; ret[92U] = 0U; ret[93U] = 0U; ret[94U] = 0U; ret[95U] = 0U; ret[96U] = 0U; ret[97U] = 0U; ret[98U] = 0U; ret[99U] = 0U; ret[100U] = 0U; ret[101U] = 0U; ret[102U] = 0U; ret[103U] = 0U; ret[104U] = 0U; ret[105U] = 0U; ret[106U] = 0U; ret[107U] = 0U; ret[108U] = 0U; ret[109U] = 0U; ret[110U] = 0U; ret[111U] = 0U; ret[112U] = 0U; ret[113U] = 0U; ret[114U] = 0U; ret[115U] = 0U; ret[116U] = 0U; ret[117U] = 0U; ret[118U] = 0U; ret[119U] = 0U; ret[120U] = 0U; ret[121U] = 0U; ret[122U] = 0U; ret[123U] = 0U; ret[124U] = 0U; ret[125U] = 0U; ret[126U] = 0U; ret[127U] = 0U; ret[128U] = 0U; ret[129U] = 0U; ret[130U] = 0U; ret[131U] = 0U; ret[132U] = 0U; ret[133U] = 0U; ret[134U] = 0U; ret[135U] = 0U; } /** Generate a new keccak xof state. */ /** This function found in impl {libcrux_sha3::generic_keccak::KeccakXofState[TraitClause@@0]#2} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.new_9d with types uint64_t with const generics - PARALLEL_LANES= 1 - RATE= 136 */ static inline libcrux_sha3_generic_keccak_KeccakXofState_4f libcrux_sha3_generic_keccak_new_9d_7e(void) { libcrux_sha3_generic_keccak_KeccakXofState_4f lit; lit.inner = libcrux_sha3_generic_keccak_new_1e_f4(); uint8_t ret[136U]; libcrux_sha3_generic_keccak_zero_block_9d_e6(ret); memcpy(lit.buf[0U], ret, (size_t)136U * sizeof(uint8_t)); lit.buf_len = (size_t)0U; lit.sponge = false; return lit; } /** Shake256 new state */ /** This function found in impl {(libcrux_sha3::portable::incremental::XofAbsorb<136: usize> for libcrux_sha3::portable::incremental::Shake256Absorb)#2} */ static inline libcrux_sha3_generic_keccak_KeccakXofState_4f libcrux_sha3_portable_incremental_new_7d(void) { return libcrux_sha3_generic_keccak_new_9d_7e(); } /** A monomorphic instance of libcrux_sha3.generic_keccak.KeccakXofState with types uint64_t with const generics - $1size_t - $168size_t */ typedef struct libcrux_sha3_generic_keccak_KeccakXofState_78_s { libcrux_sha3_generic_keccak_KeccakState_48 inner; uint8_t buf[1U][168U]; size_t buf_len; bool sponge; } libcrux_sha3_generic_keccak_KeccakXofState_78; typedef libcrux_sha3_generic_keccak_KeccakXofState_78 libcrux_sha3_portable_incremental_Shake128Absorb; /** Consume the internal buffer and the required amount of the input to pad to `RATE`. Returns the `consumed` bytes from `inputs` if there's enough buffered content to consume, and `0` otherwise. If `consumed > 0` is returned, `self.buf` contains a full block to be loaded. */ /** This function found in impl {libcrux_sha3::generic_keccak::KeccakXofState[TraitClause@@0]#2} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.fill_buffer_9d with types uint64_t with const generics - PARALLEL_LANES= 1 - RATE= 168 */ static inline size_t libcrux_sha3_generic_keccak_fill_buffer_9d_b00( libcrux_sha3_generic_keccak_KeccakXofState_78 *self, Eurydice_slice inputs[1U]) { size_t input_len = Eurydice_slice_len(inputs[0U], uint8_t); size_t consumed = (size_t)0U; if (self->buf_len > (size_t)0U) { if (self->buf_len + input_len >= (size_t)168U) { consumed = (size_t)168U - self->buf_len; for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; Eurydice_slice uu____0 = Eurydice_array_to_subslice_from( (size_t)168U, self->buf[i0], self->buf_len, uint8_t, size_t); Eurydice_slice_copy( uu____0, Eurydice_slice_subslice_to(inputs[i0], consumed, uint8_t, size_t), uint8_t); } self->buf_len = self->buf_len + consumed; } } return consumed; } /** This function found in impl {libcrux_sha3::generic_keccak::KeccakXofState[TraitClause@@0]#2} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_full_9d with types uint64_t with const generics - PARALLEL_LANES= 1 - RATE= 168 */ static inline size_t libcrux_sha3_generic_keccak_absorb_full_9d_f80( libcrux_sha3_generic_keccak_KeccakXofState_78 *self, Eurydice_slice inputs[1U]) { libcrux_sha3_generic_keccak_KeccakXofState_78 *uu____0 = self; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_inputs0[1U]; memcpy(copy_of_inputs0, inputs, (size_t)1U * sizeof(Eurydice_slice)); size_t input_consumed = libcrux_sha3_generic_keccak_fill_buffer_9d_b00(uu____0, copy_of_inputs0); if (input_consumed > (size_t)0U) { Eurydice_slice borrowed[1U]; for (size_t i = (size_t)0U; i < (size_t)1U; i++) { uint8_t buf[168U] = {0U}; borrowed[i] = core_array___Array_T__N__23__as_slice( (size_t)168U, buf, uint8_t, Eurydice_slice); } for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; borrowed[i0] = Eurydice_array_to_slice((size_t)168U, self->buf[i0], uint8_t); } uint64_t(*uu____2)[5U] = self->inner.st; Eurydice_slice uu____3[1U]; memcpy(uu____3, borrowed, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_portable_keccak_load_block_5a_b83(uu____2, uu____3); libcrux_sha3_generic_keccak_keccakf1600_21(&self->inner); self->buf_len = (size_t)0U; } size_t input_to_consume = Eurydice_slice_len(inputs[0U], uint8_t) - input_consumed; size_t num_blocks = input_to_consume / (size_t)168U; size_t remainder = input_to_consume % (size_t)168U; for (size_t i = (size_t)0U; i < num_blocks; i++) { size_t i0 = i; uint64_t(*uu____4)[5U] = self->inner.st; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_inputs[1U]; memcpy(copy_of_inputs, inputs, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice ret[1U]; libcrux_sha3_portable_keccak_slice_n_5a( copy_of_inputs, input_consumed + i0 * (size_t)168U, (size_t)168U, ret); libcrux_sha3_portable_keccak_load_block_5a_b83(uu____4, ret); libcrux_sha3_generic_keccak_keccakf1600_21(&self->inner); } return remainder; } /** Absorb This function takes any number of bytes to absorb and buffers if it's not enough. The function assumes that all input slices in `blocks` have the same length. Only a multiple of `RATE` blocks are absorbed. For the remaining bytes [`absorb_final`] needs to be called. This works best with relatively small `inputs`. */ /** This function found in impl {libcrux_sha3::generic_keccak::KeccakXofState[TraitClause@@0]#2} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_9d with types uint64_t with const generics - PARALLEL_LANES= 1 - RATE= 168 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_9d_7b0( libcrux_sha3_generic_keccak_KeccakXofState_78 *self, Eurydice_slice inputs[1U]) { libcrux_sha3_generic_keccak_KeccakXofState_78 *uu____0 = self; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_inputs[1U]; memcpy(copy_of_inputs, inputs, (size_t)1U * sizeof(Eurydice_slice)); size_t input_remainder_len = libcrux_sha3_generic_keccak_absorb_full_9d_f80(uu____0, copy_of_inputs); if (input_remainder_len > (size_t)0U) { size_t input_len = Eurydice_slice_len(inputs[0U], uint8_t); for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; Eurydice_slice uu____2 = Eurydice_array_to_subslice2( self->buf[i0], self->buf_len, self->buf_len + input_remainder_len, uint8_t); Eurydice_slice_copy( uu____2, Eurydice_slice_subslice_from( inputs[i0], input_len - input_remainder_len, uint8_t, size_t), uint8_t); } self->buf_len = self->buf_len + input_remainder_len; } } /** This function found in impl {(libcrux_sha3::portable::incremental::XofAbsorb<168: usize> for libcrux_sha3::portable::incremental::Shake128Absorb)} */ static inline void libcrux_sha3_portable_incremental_absorb_1c( libcrux_sha3_generic_keccak_KeccakXofState_78 *self, Eurydice_slice input) { Eurydice_slice buf[1U] = {input}; libcrux_sha3_generic_keccak_absorb_9d_7b0(self, buf); } typedef libcrux_sha3_generic_keccak_KeccakXofState_78 libcrux_sha3_portable_incremental_Shake128Squeeze; /** Absorb a final block. The `inputs` block may be empty. Everything in the `inputs` block beyond `RATE` bytes is ignored. */ /** This function found in impl {libcrux_sha3::generic_keccak::KeccakXofState[TraitClause@@0]#2} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_final_9d with types uint64_t with const generics - PARALLEL_LANES= 1 - RATE= 168 - DELIMITER= 31 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_final_9d_250( libcrux_sha3_generic_keccak_KeccakXofState_78 *self, Eurydice_slice inputs[1U]) { libcrux_sha3_generic_keccak_KeccakXofState_78 *uu____0 = self; /* Passing arrays by value in Rust generates a copy in C */ Eurydice_slice copy_of_inputs[1U]; memcpy(copy_of_inputs, inputs, (size_t)1U * sizeof(Eurydice_slice)); size_t input_remainder_len = libcrux_sha3_generic_keccak_absorb_full_9d_f80(uu____0, copy_of_inputs); size_t input_len = Eurydice_slice_len(inputs[0U], uint8_t); uint8_t blocks[1U][200U] = {{0U}}; for (size_t i = (size_t)0U; i < (size_t)1U; i++) { size_t i0 = i; if (self->buf_len > (size_t)0U) { Eurydice_slice uu____2 = Eurydice_array_to_subslice2( blocks[i0], (size_t)0U, self->buf_len, uint8_t); Eurydice_slice_copy(uu____2, Eurydice_array_to_subslice2(self->buf[i0], (size_t)0U, self->buf_len, uint8_t), uint8_t); } if (input_remainder_len > (size_t)0U) { Eurydice_slice uu____3 = Eurydice_array_to_subslice2( blocks[i0], self->buf_len, self->buf_len + input_remainder_len, uint8_t); Eurydice_slice_copy( uu____3, Eurydice_slice_subslice_from( inputs[i0], input_len - input_remainder_len, uint8_t, size_t), uint8_t); } blocks[i0][self->buf_len + input_remainder_len] = 31U; size_t uu____4 = i0; size_t uu____5 = (size_t)168U - (size_t)1U; blocks[uu____4][uu____5] = (uint32_t)blocks[uu____4][uu____5] | 128U; } uint64_t(*uu____6)[5U] = self->inner.st; uint8_t uu____7[1U][200U]; memcpy(uu____7, blocks, (size_t)1U * sizeof(uint8_t[200U])); libcrux_sha3_portable_keccak_load_block_full_5a_d21(uu____6, uu____7); libcrux_sha3_generic_keccak_keccakf1600_21(&self->inner); } /** This function found in impl {(libcrux_sha3::portable::incremental::XofAbsorb<168: usize> for libcrux_sha3::portable::incremental::Shake128Absorb)} */ static inline libcrux_sha3_generic_keccak_KeccakXofState_78 libcrux_sha3_portable_incremental_absorb_final_1c( libcrux_sha3_generic_keccak_KeccakXofState_78 self, Eurydice_slice input) { Eurydice_slice buf[1U] = {input}; libcrux_sha3_generic_keccak_absorb_final_9d_250(&self, buf); return self; } /** An all zero block */ /** This function found in impl {libcrux_sha3::generic_keccak::KeccakXofState[TraitClause@@0]#2} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.zero_block_9d with types uint64_t with const generics - PARALLEL_LANES= 1 - RATE= 168 */ static inline void libcrux_sha3_generic_keccak_zero_block_9d_e60( uint8_t ret[168U]) { ret[0U] = 0U; ret[1U] = 0U; ret[2U] = 0U; ret[3U] = 0U; ret[4U] = 0U; ret[5U] = 0U; ret[6U] = 0U; ret[7U] = 0U; ret[8U] = 0U; ret[9U] = 0U; ret[10U] = 0U; ret[11U] = 0U; ret[12U] = 0U; ret[13U] = 0U; ret[14U] = 0U; ret[15U] = 0U; ret[16U] = 0U; ret[17U] = 0U; ret[18U] = 0U; ret[19U] = 0U; ret[20U] = 0U; ret[21U] = 0U; ret[22U] = 0U; ret[23U] = 0U; ret[24U] = 0U; ret[25U] = 0U; ret[26U] = 0U; ret[27U] = 0U; ret[28U] = 0U; ret[29U] = 0U; ret[30U] = 0U; ret[31U] = 0U; ret[32U] = 0U; ret[33U] = 0U; ret[34U] = 0U; ret[35U] = 0U; ret[36U] = 0U; ret[37U] = 0U; ret[38U] = 0U; ret[39U] = 0U; ret[40U] = 0U; ret[41U] = 0U; ret[42U] = 0U; ret[43U] = 0U; ret[44U] = 0U; ret[45U] = 0U; ret[46U] = 0U; ret[47U] = 0U; ret[48U] = 0U; ret[49U] = 0U; ret[50U] = 0U; ret[51U] = 0U; ret[52U] = 0U; ret[53U] = 0U; ret[54U] = 0U; ret[55U] = 0U; ret[56U] = 0U; ret[57U] = 0U; ret[58U] = 0U; ret[59U] = 0U; ret[60U] = 0U; ret[61U] = 0U; ret[62U] = 0U; ret[63U] = 0U; ret[64U] = 0U; ret[65U] = 0U; ret[66U] = 0U; ret[67U] = 0U; ret[68U] = 0U; ret[69U] = 0U; ret[70U] = 0U; ret[71U] = 0U; ret[72U] = 0U; ret[73U] = 0U; ret[74U] = 0U; ret[75U] = 0U; ret[76U] = 0U; ret[77U] = 0U; ret[78U] = 0U; ret[79U] = 0U; ret[80U] = 0U; ret[81U] = 0U; ret[82U] = 0U; ret[83U] = 0U; ret[84U] = 0U; ret[85U] = 0U; ret[86U] = 0U; ret[87U] = 0U; ret[88U] = 0U; ret[89U] = 0U; ret[90U] = 0U; ret[91U] = 0U; ret[92U] = 0U; ret[93U] = 0U; ret[94U] = 0U; ret[95U] = 0U; ret[96U] = 0U; ret[97U] = 0U; ret[98U] = 0U; ret[99U] = 0U; ret[100U] = 0U; ret[101U] = 0U; ret[102U] = 0U; ret[103U] = 0U; ret[104U] = 0U; ret[105U] = 0U; ret[106U] = 0U; ret[107U] = 0U; ret[108U] = 0U; ret[109U] = 0U; ret[110U] = 0U; ret[111U] = 0U; ret[112U] = 0U; ret[113U] = 0U; ret[114U] = 0U; ret[115U] = 0U; ret[116U] = 0U; ret[117U] = 0U; ret[118U] = 0U; ret[119U] = 0U; ret[120U] = 0U; ret[121U] = 0U; ret[122U] = 0U; ret[123U] = 0U; ret[124U] = 0U; ret[125U] = 0U; ret[126U] = 0U; ret[127U] = 0U; ret[128U] = 0U; ret[129U] = 0U; ret[130U] = 0U; ret[131U] = 0U; ret[132U] = 0U; ret[133U] = 0U; ret[134U] = 0U; ret[135U] = 0U; ret[136U] = 0U; ret[137U] = 0U; ret[138U] = 0U; ret[139U] = 0U; ret[140U] = 0U; ret[141U] = 0U; ret[142U] = 0U; ret[143U] = 0U; ret[144U] = 0U; ret[145U] = 0U; ret[146U] = 0U; ret[147U] = 0U; ret[148U] = 0U; ret[149U] = 0U; ret[150U] = 0U; ret[151U] = 0U; ret[152U] = 0U; ret[153U] = 0U; ret[154U] = 0U; ret[155U] = 0U; ret[156U] = 0U; ret[157U] = 0U; ret[158U] = 0U; ret[159U] = 0U; ret[160U] = 0U; ret[161U] = 0U; ret[162U] = 0U; ret[163U] = 0U; ret[164U] = 0U; ret[165U] = 0U; ret[166U] = 0U; ret[167U] = 0U; } /** Generate a new keccak xof state. */ /** This function found in impl {libcrux_sha3::generic_keccak::KeccakXofState[TraitClause@@0]#2} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.new_9d with types uint64_t with const generics - PARALLEL_LANES= 1 - RATE= 168 */ static inline libcrux_sha3_generic_keccak_KeccakXofState_78 libcrux_sha3_generic_keccak_new_9d_7e0(void) { libcrux_sha3_generic_keccak_KeccakXofState_78 lit; lit.inner = libcrux_sha3_generic_keccak_new_1e_f4(); uint8_t ret[168U]; libcrux_sha3_generic_keccak_zero_block_9d_e60(ret); memcpy(lit.buf[0U], ret, (size_t)168U * sizeof(uint8_t)); lit.buf_len = (size_t)0U; lit.sponge = false; return lit; } /** This function found in impl {(libcrux_sha3::portable::incremental::XofAbsorb<168: usize> for libcrux_sha3::portable::incremental::Shake128Absorb)} */ static inline libcrux_sha3_generic_keccak_KeccakXofState_78 libcrux_sha3_portable_incremental_new_1c(void) { return libcrux_sha3_generic_keccak_new_9d_7e0(); } /** `out` has the exact size we want here. It must be less than or equal to `RATE`. */ /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.store_5a with const generics - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_5a_1c( uint64_t (*state)[5U], Eurydice_slice out[1U]) { size_t num_full_blocks = Eurydice_slice_len(out[0U], uint8_t) / (size_t)8U; size_t last_block_len = Eurydice_slice_len(out[0U], uint8_t) % (size_t)8U; for (size_t i = (size_t)0U; i < num_full_blocks; i++) { size_t i0 = i; Eurydice_slice uu____0 = Eurydice_slice_subslice2( out[0U], i0 * (size_t)8U, i0 * (size_t)8U + (size_t)8U, uint8_t); uint8_t ret[8U]; core_num__u64_9__to_le_bytes(state[i0 / (size_t)5U][i0 % (size_t)5U], ret); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)8U, ret, uint8_t), uint8_t); } if (last_block_len != (size_t)0U) { Eurydice_slice uu____1 = Eurydice_slice_subslice2( out[0U], num_full_blocks * (size_t)8U, num_full_blocks * (size_t)8U + last_block_len, uint8_t); uint8_t ret[8U]; core_num__u64_9__to_le_bytes( state[num_full_blocks / (size_t)5U][num_full_blocks % (size_t)5U], ret); Eurydice_slice_copy( uu____1, Eurydice_array_to_subslice2(ret, (size_t)0U, last_block_len, uint8_t), uint8_t); } } /** Squeeze `N` x `LEN` bytes. */ /** This function found in impl {libcrux_sha3::generic_keccak::KeccakXofState[TraitClause@@0]#2} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_9d with types uint64_t with const generics - PARALLEL_LANES= 1 - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_9d_96( libcrux_sha3_generic_keccak_KeccakXofState_4f *self, Eurydice_slice out[1U]) { if (self->sponge) { libcrux_sha3_generic_keccak_keccakf1600_21(&self->inner); } size_t out_len = Eurydice_slice_len(out[0U], uint8_t); size_t blocks = out_len / (size_t)136U; size_t last = out_len - out_len % (size_t)136U; size_t mid; if ((size_t)136U >= out_len) { mid = out_len; } else { mid = (size_t)136U; } Eurydice_slice_uint8_t_1size_t__x2 uu____0 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(out, mid); Eurydice_slice out00[1U]; memcpy(out00, uu____0.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice out_rest[1U]; memcpy(out_rest, uu____0.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_portable_keccak_store_5a_1c(self->inner.st, out00); core_ops_range_Range_b3 iter = core_iter_traits_collect___core__iter__traits__collect__IntoIterator_for_I__1__into_iter( (CLITERAL(core_ops_range_Range_b3){.start = (size_t)1U, .end = blocks}), core_ops_range_Range_b3, core_ops_range_Range_b3); while (true) { if (core_iter_range___core__iter__traits__iterator__Iterator_for_core__ops__range__Range_A___6__next( &iter, size_t, Option_b3) .tag == None) { break; } else { Eurydice_slice_uint8_t_1size_t__x2 uu____1 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(out_rest, (size_t)136U); Eurydice_slice out0[1U]; memcpy(out0, uu____1.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice tmp[1U]; memcpy(tmp, uu____1.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_keccakf1600_21(&self->inner); libcrux_sha3_portable_keccak_store_5a_1c(self->inner.st, out0); memcpy(out_rest, tmp, (size_t)1U * sizeof(Eurydice_slice)); } } if (last < out_len) { libcrux_sha3_generic_keccak_keccakf1600_21(&self->inner); libcrux_sha3_portable_keccak_store_5a_1c(self->inner.st, out_rest); } self->sponge = true; } /** Shake256 squeeze */ /** This function found in impl {(libcrux_sha3::portable::incremental::XofSqueeze<136: usize> for libcrux_sha3::portable::incremental::Shake256Squeeze)#3} */ static inline void libcrux_sha3_portable_incremental_squeeze_8a( libcrux_sha3_generic_keccak_KeccakXofState_4f *self, Eurydice_slice out) { Eurydice_slice buf[1U] = {out}; libcrux_sha3_generic_keccak_squeeze_9d_96(self, buf); } /** `out` has the exact size we want here. It must be less than or equal to `RATE`. */ /** This function found in impl {(libcrux_sha3::traits::internal::KeccakItem<1: usize> for u64)} */ /** A monomorphic instance of libcrux_sha3.portable_keccak.store_5a with const generics - RATE= 168 */ static KRML_MUSTINLINE void libcrux_sha3_portable_keccak_store_5a_1c0( uint64_t (*state)[5U], Eurydice_slice out[1U]) { size_t num_full_blocks = Eurydice_slice_len(out[0U], uint8_t) / (size_t)8U; size_t last_block_len = Eurydice_slice_len(out[0U], uint8_t) % (size_t)8U; for (size_t i = (size_t)0U; i < num_full_blocks; i++) { size_t i0 = i; Eurydice_slice uu____0 = Eurydice_slice_subslice2( out[0U], i0 * (size_t)8U, i0 * (size_t)8U + (size_t)8U, uint8_t); uint8_t ret[8U]; core_num__u64_9__to_le_bytes(state[i0 / (size_t)5U][i0 % (size_t)5U], ret); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)8U, ret, uint8_t), uint8_t); } if (last_block_len != (size_t)0U) { Eurydice_slice uu____1 = Eurydice_slice_subslice2( out[0U], num_full_blocks * (size_t)8U, num_full_blocks * (size_t)8U + last_block_len, uint8_t); uint8_t ret[8U]; core_num__u64_9__to_le_bytes( state[num_full_blocks / (size_t)5U][num_full_blocks % (size_t)5U], ret); Eurydice_slice_copy( uu____1, Eurydice_array_to_subslice2(ret, (size_t)0U, last_block_len, uint8_t), uint8_t); } } /** Squeeze `N` x `LEN` bytes. */ /** This function found in impl {libcrux_sha3::generic_keccak::KeccakXofState[TraitClause@@0]#2} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.squeeze_9d with types uint64_t with const generics - PARALLEL_LANES= 1 - RATE= 168 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_squeeze_9d_960( libcrux_sha3_generic_keccak_KeccakXofState_78 *self, Eurydice_slice out[1U]) { if (self->sponge) { libcrux_sha3_generic_keccak_keccakf1600_21(&self->inner); } size_t out_len = Eurydice_slice_len(out[0U], uint8_t); size_t blocks = out_len / (size_t)168U; size_t last = out_len - out_len % (size_t)168U; size_t mid; if ((size_t)168U >= out_len) { mid = out_len; } else { mid = (size_t)168U; } Eurydice_slice_uint8_t_1size_t__x2 uu____0 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(out, mid); Eurydice_slice out00[1U]; memcpy(out00, uu____0.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice out_rest[1U]; memcpy(out_rest, uu____0.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_portable_keccak_store_5a_1c0(self->inner.st, out00); core_ops_range_Range_b3 iter = core_iter_traits_collect___core__iter__traits__collect__IntoIterator_for_I__1__into_iter( (CLITERAL(core_ops_range_Range_b3){.start = (size_t)1U, .end = blocks}), core_ops_range_Range_b3, core_ops_range_Range_b3); while (true) { if (core_iter_range___core__iter__traits__iterator__Iterator_for_core__ops__range__Range_A___6__next( &iter, size_t, Option_b3) .tag == None) { break; } else { Eurydice_slice_uint8_t_1size_t__x2 uu____1 = libcrux_sha3_portable_keccak_split_at_mut_n_5a(out_rest, (size_t)168U); Eurydice_slice out0[1U]; memcpy(out0, uu____1.fst, (size_t)1U * sizeof(Eurydice_slice)); Eurydice_slice tmp[1U]; memcpy(tmp, uu____1.snd, (size_t)1U * sizeof(Eurydice_slice)); libcrux_sha3_generic_keccak_keccakf1600_21(&self->inner); libcrux_sha3_portable_keccak_store_5a_1c0(self->inner.st, out0); memcpy(out_rest, tmp, (size_t)1U * sizeof(Eurydice_slice)); } } if (last < out_len) { libcrux_sha3_generic_keccak_keccakf1600_21(&self->inner); libcrux_sha3_portable_keccak_store_5a_1c0(self->inner.st, out_rest); } self->sponge = true; } /** Shake128 squeeze */ /** This function found in impl {(libcrux_sha3::portable::incremental::XofSqueeze<168: usize> for libcrux_sha3::portable::incremental::Shake128Squeeze)#1} */ static inline void libcrux_sha3_portable_incremental_squeeze_10( libcrux_sha3_generic_keccak_KeccakXofState_78 *self, Eurydice_slice out) { Eurydice_slice buf[1U] = {out}; libcrux_sha3_generic_keccak_squeeze_9d_960(self, buf); } /** This function found in impl {(core::clone::Clone for libcrux_sha3::portable::KeccakState)} */ static inline libcrux_sha3_generic_keccak_KeccakState_48 libcrux_sha3_portable_clone_3d( libcrux_sha3_generic_keccak_KeccakState_48 *self) { return self[0U]; } /** This function found in impl {(core::convert::From for u32)#1} */ static inline uint32_t libcrux_sha3_from_eb(libcrux_sha3_Algorithm v) { uint32_t uu____0; switch (v) { case libcrux_sha3_Sha224: { uu____0 = 1U; break; } case libcrux_sha3_Sha256: { uu____0 = 2U; break; } case libcrux_sha3_Sha384: { uu____0 = 3U; break; } case libcrux_sha3_Sha512: { uu____0 = 4U; break; } default: { KRML_HOST_EPRINTF("KaRaMeL incomplete match at %s:%d\n", __FILE__, __LINE__); KRML_HOST_EXIT(253U); } } return uu____0; } /** This function found in impl {(core::convert::From for libcrux_sha3::Algorithm)} */ static inline libcrux_sha3_Algorithm libcrux_sha3_from_2d(uint32_t v) { libcrux_sha3_Algorithm uu____0; switch (v) { case 1U: { uu____0 = libcrux_sha3_Sha224; break; } case 2U: { uu____0 = libcrux_sha3_Sha256; break; } case 3U: { uu____0 = libcrux_sha3_Sha384; break; } case 4U: { uu____0 = libcrux_sha3_Sha512; break; } default: { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "panic!"); KRML_HOST_EXIT(255U); } } return uu____0; } typedef uint8_t libcrux_sha3_Sha3_512Digest[64U]; typedef uint8_t libcrux_sha3_Sha3_384Digest[48U]; typedef uint8_t libcrux_sha3_Sha3_256Digest[32U]; typedef uint8_t libcrux_sha3_Sha3_224Digest[28U]; #if defined(__cplusplus) } #endif #define __libcrux_sha3_portable_H_DEFINED #endif /* from libcrux/libcrux-ml-kem/cg/libcrux_mlkem768_portable.h */ /* * SPDX-FileCopyrightText: 2024 Cryspen Sarl * * SPDX-License-Identifier: MIT or Apache-2.0 * * This code was generated with the following revisions: * Charon: 6b5e110342a771a3e1c739b10294b1778e4be8b4 * Eurydice: 31be7d65ca5d6acdacfb33652e478d24dd85c1cb * Karamel: 3205d3365ea2790b02368f79fcee38e38d0b5908 * F*: a32b316e521fa4f239b610ec8f1d15e78d62cbe8-dirty * Libcrux: 4ad532b206174114dd4140b718e7794a28fc59ee */ #ifndef __libcrux_mlkem768_portable_H #define __libcrux_mlkem768_portable_H #if defined(__cplusplus) extern "C" { #endif #define LIBCRUX_ML_KEM_HASH_FUNCTIONS_BLOCK_SIZE ((size_t)168U) #define LIBCRUX_ML_KEM_HASH_FUNCTIONS_THREE_BLOCKS \ (LIBCRUX_ML_KEM_HASH_FUNCTIONS_BLOCK_SIZE * (size_t)3U) static KRML_MUSTINLINE void libcrux_ml_kem_hash_functions_portable_G( Eurydice_slice input, uint8_t ret[64U]) { uint8_t digest[64U] = {0U}; libcrux_sha3_portable_sha512( Eurydice_array_to_slice((size_t)64U, digest, uint8_t), input); memcpy(ret, digest, (size_t)64U * sizeof(uint8_t)); } static KRML_MUSTINLINE void libcrux_ml_kem_hash_functions_portable_H( Eurydice_slice input, uint8_t ret[32U]) { uint8_t digest[32U] = {0U}; libcrux_sha3_portable_sha256( Eurydice_array_to_slice((size_t)32U, digest, uint8_t), input); memcpy(ret, digest, (size_t)32U * sizeof(uint8_t)); } #define LIBCRUX_ML_KEM_IND_CCA_ENCAPS_SEED_SIZE \ (LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE) #define LIBCRUX_ML_KEM_IND_CCA_KEY_GENERATION_SEED_SIZE \ (LIBCRUX_ML_KEM_CONSTANTS_CPA_PKE_KEY_GENERATION_SEED_SIZE + \ LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE) typedef uint8_t libcrux_ml_kem_ind_cca_MlKemSharedSecret[32U]; static const int16_t libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[128U] = {(int16_t)-1044, (int16_t)-758, (int16_t)-359, (int16_t)-1517, (int16_t)1493, (int16_t)1422, (int16_t)287, (int16_t)202, (int16_t)-171, (int16_t)622, (int16_t)1577, (int16_t)182, (int16_t)962, (int16_t)-1202, (int16_t)-1474, (int16_t)1468, (int16_t)573, (int16_t)-1325, (int16_t)264, (int16_t)383, (int16_t)-829, (int16_t)1458, (int16_t)-1602, (int16_t)-130, (int16_t)-681, (int16_t)1017, (int16_t)732, (int16_t)608, (int16_t)-1542, (int16_t)411, (int16_t)-205, (int16_t)-1571, (int16_t)1223, (int16_t)652, (int16_t)-552, (int16_t)1015, (int16_t)-1293, (int16_t)1491, (int16_t)-282, (int16_t)-1544, (int16_t)516, (int16_t)-8, (int16_t)-320, (int16_t)-666, (int16_t)-1618, (int16_t)-1162, (int16_t)126, (int16_t)1469, (int16_t)-853, (int16_t)-90, (int16_t)-271, (int16_t)830, (int16_t)107, (int16_t)-1421, (int16_t)-247, (int16_t)-951, (int16_t)-398, (int16_t)961, (int16_t)-1508, (int16_t)-725, (int16_t)448, (int16_t)-1065, (int16_t)677, (int16_t)-1275, (int16_t)-1103, (int16_t)430, (int16_t)555, (int16_t)843, (int16_t)-1251, (int16_t)871, (int16_t)1550, (int16_t)105, (int16_t)422, (int16_t)587, (int16_t)177, (int16_t)-235, (int16_t)-291, (int16_t)-460, (int16_t)1574, (int16_t)1653, (int16_t)-246, (int16_t)778, (int16_t)1159, (int16_t)-147, (int16_t)-777, (int16_t)1483, (int16_t)-602, (int16_t)1119, (int16_t)-1590, (int16_t)644, (int16_t)-872, (int16_t)349, (int16_t)418, (int16_t)329, (int16_t)-156, (int16_t)-75, (int16_t)817, (int16_t)1097, (int16_t)603, (int16_t)610, (int16_t)1322, (int16_t)-1285, (int16_t)-1465, (int16_t)384, (int16_t)-1215, (int16_t)-136, (int16_t)1218, (int16_t)-1335, (int16_t)-874, (int16_t)220, (int16_t)-1187, (int16_t)-1659, (int16_t)-1185, (int16_t)-1530, (int16_t)-1278, (int16_t)794, (int16_t)-1510, (int16_t)-854, (int16_t)-870, (int16_t)478, (int16_t)-108, (int16_t)-308, (int16_t)996, (int16_t)991, (int16_t)958, (int16_t)-1460, (int16_t)1522, (int16_t)1628}; #define LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR ((size_t)16U) #define LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT \ (LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT / \ LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR) #define LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS ((int16_t)3329) #define LIBCRUX_ML_KEM_VECTOR_TRAITS_MONTGOMERY_R_SQUARED_MOD_FIELD_MODULUS \ ((int16_t)1353) #define LIBCRUX_ML_KEM_VECTOR_TRAITS_INVERSE_OF_MODULUS_MOD_MONTGOMERY_R \ (62209U) typedef struct libcrux_ml_kem_vector_portable_vector_type_PortableVector_s { int16_t elements[16U]; } libcrux_ml_kem_vector_portable_vector_type_PortableVector; static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_vector_type_from_i16_array( Eurydice_slice array) { libcrux_ml_kem_vector_portable_vector_type_PortableVector lit; int16_t ret[16U]; Result_c0 dst; Eurydice_slice_to_array2( &dst, Eurydice_slice_subslice2(array, (size_t)0U, (size_t)16U, int16_t), Eurydice_slice, int16_t[16U]); unwrap_41_f9(dst, ret); memcpy(lit.elements, ret, (size_t)16U * sizeof(int16_t)); return lit; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_from_i16_array_0d(Eurydice_slice array) { return libcrux_ml_kem_vector_portable_vector_type_from_i16_array(array); } typedef struct uint8_t_x11_s { uint8_t fst; uint8_t snd; uint8_t thd; uint8_t f3; uint8_t f4; uint8_t f5; uint8_t f6; uint8_t f7; uint8_t f8; uint8_t f9; uint8_t f10; } uint8_t_x11; static KRML_MUSTINLINE uint8_t_x11 libcrux_ml_kem_vector_portable_serialize_serialize_11_int(Eurydice_slice v) { uint8_t r0 = (uint8_t)Eurydice_slice_index(v, (size_t)0U, int16_t, int16_t *); uint8_t r1 = (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)1U, int16_t, int16_t *) & (int16_t)31) << 3U | (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)0U, int16_t, int16_t *) >> 8U); uint8_t r2 = (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)2U, int16_t, int16_t *) & (int16_t)3) << 6U | (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)1U, int16_t, int16_t *) >> 5U); uint8_t r3 = (uint8_t)(Eurydice_slice_index(v, (size_t)2U, int16_t, int16_t *) >> 2U & (int16_t)255); uint8_t r4 = (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)3U, int16_t, int16_t *) & (int16_t)127) << 1U | (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)2U, int16_t, int16_t *) >> 10U); uint8_t r5 = (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)4U, int16_t, int16_t *) & (int16_t)15) << 4U | (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)3U, int16_t, int16_t *) >> 7U); uint8_t r6 = (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)5U, int16_t, int16_t *) & (int16_t)1) << 7U | (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)4U, int16_t, int16_t *) >> 4U); uint8_t r7 = (uint8_t)(Eurydice_slice_index(v, (size_t)5U, int16_t, int16_t *) >> 1U & (int16_t)255); uint8_t r8 = (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)6U, int16_t, int16_t *) & (int16_t)63) << 2U | (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)5U, int16_t, int16_t *) >> 9U); uint8_t r9 = (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)7U, int16_t, int16_t *) & (int16_t)7) << 5U | (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)6U, int16_t, int16_t *) >> 6U); uint8_t r10 = (uint8_t)(Eurydice_slice_index(v, (size_t)7U, int16_t, int16_t *) >> 3U); return (CLITERAL(uint8_t_x11){.fst = r0, .snd = r1, .thd = r2, .f3 = r3, .f4 = r4, .f5 = r5, .f6 = r6, .f7 = r7, .f8 = r8, .f9 = r9, .f10 = r10}); } static KRML_MUSTINLINE void libcrux_ml_kem_vector_portable_serialize_serialize_11( libcrux_ml_kem_vector_portable_vector_type_PortableVector v, uint8_t ret[22U]) { uint8_t_x11 r0_10 = libcrux_ml_kem_vector_portable_serialize_serialize_11_int( Eurydice_array_to_subslice2(v.elements, (size_t)0U, (size_t)8U, int16_t)); uint8_t_x11 r11_21 = libcrux_ml_kem_vector_portable_serialize_serialize_11_int( Eurydice_array_to_subslice2(v.elements, (size_t)8U, (size_t)16U, int16_t)); uint8_t result[22U] = {0U}; result[0U] = r0_10.fst; result[1U] = r0_10.snd; result[2U] = r0_10.thd; result[3U] = r0_10.f3; result[4U] = r0_10.f4; result[5U] = r0_10.f5; result[6U] = r0_10.f6; result[7U] = r0_10.f7; result[8U] = r0_10.f8; result[9U] = r0_10.f9; result[10U] = r0_10.f10; result[11U] = r11_21.fst; result[12U] = r11_21.snd; result[13U] = r11_21.thd; result[14U] = r11_21.f3; result[15U] = r11_21.f4; result[16U] = r11_21.f5; result[17U] = r11_21.f6; result[18U] = r11_21.f7; result[19U] = r11_21.f8; result[20U] = r11_21.f9; result[21U] = r11_21.f10; memcpy(ret, result, (size_t)22U * sizeof(uint8_t)); } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline void libcrux_ml_kem_vector_portable_serialize_11_0d( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, uint8_t ret[22U]) { libcrux_ml_kem_vector_portable_serialize_serialize_11(a, ret); } typedef struct int16_t_x8_s { int16_t fst; int16_t snd; int16_t thd; int16_t f3; int16_t f4; int16_t f5; int16_t f6; int16_t f7; } int16_t_x8; static KRML_MUSTINLINE int16_t_x8 libcrux_ml_kem_vector_portable_serialize_deserialize_11_int( Eurydice_slice bytes) { int16_t r0 = ((int16_t)Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *) & (int16_t)7) << 8U | (int16_t)Eurydice_slice_index(bytes, (size_t)0U, uint8_t, uint8_t *); int16_t r1 = ((int16_t)Eurydice_slice_index(bytes, (size_t)2U, uint8_t, uint8_t *) & (int16_t)63) << 5U | (int16_t)Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *) >> 3U; int16_t r2 = (((int16_t)Eurydice_slice_index(bytes, (size_t)4U, uint8_t, uint8_t *) & (int16_t)1) << 10U | (int16_t)Eurydice_slice_index(bytes, (size_t)3U, uint8_t, uint8_t *) << 2U) | (int16_t)Eurydice_slice_index(bytes, (size_t)2U, uint8_t, uint8_t *) >> 6U; int16_t r3 = ((int16_t)Eurydice_slice_index(bytes, (size_t)5U, uint8_t, uint8_t *) & (int16_t)15) << 7U | (int16_t)Eurydice_slice_index(bytes, (size_t)4U, uint8_t, uint8_t *) >> 1U; int16_t r4 = ((int16_t)Eurydice_slice_index(bytes, (size_t)6U, uint8_t, uint8_t *) & (int16_t)127) << 4U | (int16_t)Eurydice_slice_index(bytes, (size_t)5U, uint8_t, uint8_t *) >> 4U; int16_t r5 = (((int16_t)Eurydice_slice_index(bytes, (size_t)8U, uint8_t, uint8_t *) & (int16_t)3) << 9U | (int16_t)Eurydice_slice_index(bytes, (size_t)7U, uint8_t, uint8_t *) << 1U) | (int16_t)Eurydice_slice_index(bytes, (size_t)6U, uint8_t, uint8_t *) >> 7U; int16_t r6 = ((int16_t)Eurydice_slice_index(bytes, (size_t)9U, uint8_t, uint8_t *) & (int16_t)31) << 6U | (int16_t)Eurydice_slice_index(bytes, (size_t)8U, uint8_t, uint8_t *) >> 2U; int16_t r7 = (int16_t)Eurydice_slice_index(bytes, (size_t)10U, uint8_t, uint8_t *) << 3U | (int16_t)Eurydice_slice_index(bytes, (size_t)9U, uint8_t, uint8_t *) >> 5U; return (CLITERAL(int16_t_x8){.fst = r0, .snd = r1, .thd = r2, .f3 = r3, .f4 = r4, .f5 = r5, .f6 = r6, .f7 = r7}); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_vector_type_zero(void) { libcrux_ml_kem_vector_portable_vector_type_PortableVector lit; lit.elements[0U] = (int16_t)0; lit.elements[1U] = (int16_t)0; lit.elements[2U] = (int16_t)0; lit.elements[3U] = (int16_t)0; lit.elements[4U] = (int16_t)0; lit.elements[5U] = (int16_t)0; lit.elements[6U] = (int16_t)0; lit.elements[7U] = (int16_t)0; lit.elements[8U] = (int16_t)0; lit.elements[9U] = (int16_t)0; lit.elements[10U] = (int16_t)0; lit.elements[11U] = (int16_t)0; lit.elements[12U] = (int16_t)0; lit.elements[13U] = (int16_t)0; lit.elements[14U] = (int16_t)0; lit.elements[15U] = (int16_t)0; return lit; } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_serialize_deserialize_11(Eurydice_slice bytes) { int16_t_x8 v0_7 = libcrux_ml_kem_vector_portable_serialize_deserialize_11_int( Eurydice_slice_subslice2(bytes, (size_t)0U, (size_t)11U, uint8_t)); int16_t_x8 v8_15 = libcrux_ml_kem_vector_portable_serialize_deserialize_11_int( Eurydice_slice_subslice2(bytes, (size_t)11U, (size_t)22U, uint8_t)); libcrux_ml_kem_vector_portable_vector_type_PortableVector v = libcrux_ml_kem_vector_portable_vector_type_zero(); v.elements[0U] = v0_7.fst; v.elements[1U] = v0_7.snd; v.elements[2U] = v0_7.thd; v.elements[3U] = v0_7.f3; v.elements[4U] = v0_7.f4; v.elements[5U] = v0_7.f5; v.elements[6U] = v0_7.f6; v.elements[7U] = v0_7.f7; v.elements[8U] = v8_15.fst; v.elements[9U] = v8_15.snd; v.elements[10U] = v8_15.thd; v.elements[11U] = v8_15.f3; v.elements[12U] = v8_15.f4; v.elements[13U] = v8_15.f5; v.elements[14U] = v8_15.f6; v.elements[15U] = v8_15.f7; return v; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_deserialize_11_0d(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_serialize_deserialize_11(a); } static KRML_MUSTINLINE void libcrux_ml_kem_vector_portable_vector_type_to_i16_array( libcrux_ml_kem_vector_portable_vector_type_PortableVector x, int16_t ret[16U]) { memcpy(ret, x.elements, (size_t)16U * sizeof(int16_t)); } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline void libcrux_ml_kem_vector_portable_to_i16_array_0d( libcrux_ml_kem_vector_portable_vector_type_PortableVector x, int16_t ret[16U]) { libcrux_ml_kem_vector_portable_vector_type_to_i16_array(x, ret); } static const uint8_t libcrux_ml_kem_vector_rej_sample_table_REJECTION_SAMPLE_SHUFFLE_TABLE [256U][16U] = {{255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {6U, 7U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 6U, 7U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 6U, 7U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 6U, 7U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 6U, 7U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 6U, 7U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 6U, 7U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 6U, 7U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {8U, 9U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 8U, 9U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 8U, 9U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 8U, 9U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 8U, 9U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 8U, 9U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 8U, 9U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 8U, 9U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {6U, 7U, 8U, 9U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 6U, 7U, 8U, 9U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 6U, 7U, 8U, 9U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 6U, 7U, 8U, 9U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 6U, 7U, 8U, 9U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 6U, 7U, 8U, 9U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 255U, 255U, 255U, 255U, 255U, 255U}, {10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {6U, 7U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 6U, 7U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 6U, 7U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 6U, 7U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 6U, 7U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 6U, 7U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 6U, 7U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 6U, 7U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U}, {8U, 9U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 8U, 9U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 8U, 9U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 8U, 9U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 8U, 9U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 8U, 9U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 8U, 9U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 8U, 9U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U}, {6U, 7U, 8U, 9U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 6U, 7U, 8U, 9U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 6U, 7U, 8U, 9U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 6U, 7U, 8U, 9U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 6U, 7U, 8U, 9U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 6U, 7U, 8U, 9U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 10U, 11U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 10U, 11U, 255U, 255U, 255U, 255U}, {12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {6U, 7U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 6U, 7U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 6U, 7U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 6U, 7U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 6U, 7U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 6U, 7U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 6U, 7U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 6U, 7U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U}, {8U, 9U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 8U, 9U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 8U, 9U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 8U, 9U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 8U, 9U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 8U, 9U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 8U, 9U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 8U, 9U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U}, {6U, 7U, 8U, 9U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 6U, 7U, 8U, 9U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 6U, 7U, 8U, 9U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 6U, 7U, 8U, 9U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 6U, 7U, 8U, 9U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 6U, 7U, 8U, 9U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 12U, 13U, 255U, 255U, 255U, 255U}, {10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U}, {6U, 7U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 6U, 7U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 6U, 7U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 6U, 7U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 6U, 7U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 6U, 7U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 6U, 7U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 6U, 7U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U}, {8U, 9U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 8U, 9U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 8U, 9U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 8U, 9U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 8U, 9U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 8U, 9U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 8U, 9U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 8U, 9U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U}, {6U, 7U, 8U, 9U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 6U, 7U, 8U, 9U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 6U, 7U, 8U, 9U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 6U, 7U, 8U, 9U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U}, {4U, 5U, 6U, 7U, 8U, 9U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 6U, 7U, 8U, 9U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 10U, 11U, 12U, 13U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 10U, 11U, 12U, 13U, 255U, 255U}, {14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {6U, 7U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 6U, 7U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 6U, 7U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 6U, 7U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 6U, 7U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 6U, 7U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 6U, 7U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 6U, 7U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {8U, 9U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 8U, 9U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 8U, 9U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 8U, 9U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 8U, 9U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 8U, 9U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 8U, 9U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 8U, 9U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {6U, 7U, 8U, 9U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 6U, 7U, 8U, 9U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 6U, 7U, 8U, 9U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 6U, 7U, 8U, 9U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 6U, 7U, 8U, 9U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 6U, 7U, 8U, 9U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 14U, 15U, 255U, 255U, 255U, 255U}, {10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {6U, 7U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 6U, 7U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 6U, 7U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 6U, 7U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 6U, 7U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 6U, 7U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 6U, 7U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 6U, 7U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U}, {8U, 9U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 8U, 9U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 8U, 9U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 8U, 9U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 8U, 9U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 8U, 9U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 8U, 9U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 8U, 9U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U}, {6U, 7U, 8U, 9U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 6U, 7U, 8U, 9U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 6U, 7U, 8U, 9U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 6U, 7U, 8U, 9U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U}, {4U, 5U, 6U, 7U, 8U, 9U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 6U, 7U, 8U, 9U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 10U, 11U, 14U, 15U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 10U, 11U, 14U, 15U, 255U, 255U}, {12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {6U, 7U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 6U, 7U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 6U, 7U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 6U, 7U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 6U, 7U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 6U, 7U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 6U, 7U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 6U, 7U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U}, {8U, 9U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 8U, 9U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 8U, 9U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 8U, 9U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 8U, 9U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 8U, 9U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 8U, 9U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 8U, 9U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U}, {6U, 7U, 8U, 9U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 6U, 7U, 8U, 9U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 6U, 7U, 8U, 9U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 6U, 7U, 8U, 9U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U}, {4U, 5U, 6U, 7U, 8U, 9U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 6U, 7U, 8U, 9U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 12U, 13U, 14U, 15U, 255U, 255U}, {10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {4U, 5U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U}, {6U, 7U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 6U, 7U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 6U, 7U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 6U, 7U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U}, {4U, 5U, 6U, 7U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 6U, 7U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 6U, 7U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 6U, 7U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U}, {8U, 9U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 8U, 9U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {2U, 3U, 8U, 9U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 8U, 9U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U}, {4U, 5U, 8U, 9U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 8U, 9U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U}, {2U, 3U, 4U, 5U, 8U, 9U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 8U, 9U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U}, {6U, 7U, 8U, 9U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U, 255U, 255U}, {0U, 1U, 6U, 7U, 8U, 9U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U}, {2U, 3U, 6U, 7U, 8U, 9U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U}, {0U, 1U, 2U, 3U, 6U, 7U, 8U, 9U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U}, {4U, 5U, 6U, 7U, 8U, 9U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U, 255U, 255U}, {0U, 1U, 4U, 5U, 6U, 7U, 8U, 9U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U}, {2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 10U, 11U, 12U, 13U, 14U, 15U, 255U, 255U}, {0U, 1U, 2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 10U, 11U, 12U, 13U, 14U, 15U}}; /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_ZERO_0d(void) { return libcrux_ml_kem_vector_portable_vector_type_zero(); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_arithmetic_add( libcrux_ml_kem_vector_portable_vector_type_PortableVector lhs, libcrux_ml_kem_vector_portable_vector_type_PortableVector *rhs) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; size_t uu____0 = i0; lhs.elements[uu____0] = lhs.elements[uu____0] + rhs->elements[i0]; } return lhs; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_add_0d( libcrux_ml_kem_vector_portable_vector_type_PortableVector lhs, libcrux_ml_kem_vector_portable_vector_type_PortableVector *rhs) { return libcrux_ml_kem_vector_portable_arithmetic_add(lhs, rhs); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_arithmetic_sub( libcrux_ml_kem_vector_portable_vector_type_PortableVector lhs, libcrux_ml_kem_vector_portable_vector_type_PortableVector *rhs) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; size_t uu____0 = i0; lhs.elements[uu____0] = lhs.elements[uu____0] - rhs->elements[i0]; } return lhs; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_sub_0d( libcrux_ml_kem_vector_portable_vector_type_PortableVector lhs, libcrux_ml_kem_vector_portable_vector_type_PortableVector *rhs) { return libcrux_ml_kem_vector_portable_arithmetic_sub(lhs, rhs); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_arithmetic_multiply_by_constant( libcrux_ml_kem_vector_portable_vector_type_PortableVector v, int16_t c) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; size_t uu____0 = i0; v.elements[uu____0] = v.elements[uu____0] * c; } return v; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_multiply_by_constant_0d( libcrux_ml_kem_vector_portable_vector_type_PortableVector v, int16_t c) { return libcrux_ml_kem_vector_portable_arithmetic_multiply_by_constant(v, c); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_arithmetic_bitwise_and_with_constant( libcrux_ml_kem_vector_portable_vector_type_PortableVector v, int16_t c) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; size_t uu____0 = i0; v.elements[uu____0] = v.elements[uu____0] & c; } return v; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_bitwise_and_with_constant_0d( libcrux_ml_kem_vector_portable_vector_type_PortableVector v, int16_t c) { return libcrux_ml_kem_vector_portable_arithmetic_bitwise_and_with_constant(v, c); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_arithmetic_cond_subtract_3329( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { core_ops_range_Range_b3 iter = core_iter_traits_collect___core__iter__traits__collect__IntoIterator_for_I__1__into_iter( (CLITERAL(core_ops_range_Range_b3){ .start = (size_t)0U, .end = LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR}), core_ops_range_Range_b3, core_ops_range_Range_b3); while (true) { Option_b3 uu____0 = core_iter_range___core__iter__traits__iterator__Iterator_for_core__ops__range__Range_A___6__next( &iter, size_t, Option_b3); if (!(uu____0.tag == None)) { size_t i = uu____0.f0; if (v.elements[i] >= (int16_t)3329) { size_t uu____1 = i; v.elements[uu____1] = v.elements[uu____1] - (int16_t)3329; } continue; } return v; } } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_cond_subtract_3329_0d( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { return libcrux_ml_kem_vector_portable_arithmetic_cond_subtract_3329(v); } #define LIBCRUX_ML_KEM_VECTOR_PORTABLE_ARITHMETIC_BARRETT_MULTIPLIER \ ((int32_t)20159) #define LIBCRUX_ML_KEM_VECTOR_PORTABLE_ARITHMETIC_BARRETT_SHIFT ((int32_t)26) #define LIBCRUX_ML_KEM_VECTOR_PORTABLE_ARITHMETIC_BARRETT_R \ ((int32_t)1 << (uint32_t) \ LIBCRUX_ML_KEM_VECTOR_PORTABLE_ARITHMETIC_BARRETT_SHIFT) /** Signed Barrett Reduction Given an input `value`, `barrett_reduce` outputs a representative `result` such that: - result ≡ value (mod FIELD_MODULUS) - the absolute value of `result` is bound as follows: `|result| ≤ FIELD_MODULUS / 2 · (|value|/BARRETT_R + 1) In particular, if `|value| < BARRETT_R`, then `|result| < FIELD_MODULUS`. */ static inline int16_t libcrux_ml_kem_vector_portable_arithmetic_barrett_reduce_element( int16_t value) { int32_t t = (int32_t)value * LIBCRUX_ML_KEM_VECTOR_PORTABLE_ARITHMETIC_BARRETT_MULTIPLIER + (LIBCRUX_ML_KEM_VECTOR_PORTABLE_ARITHMETIC_BARRETT_R >> 1U); int16_t quotient = (int16_t)(t >> (uint32_t) LIBCRUX_ML_KEM_VECTOR_PORTABLE_ARITHMETIC_BARRETT_SHIFT); return value - quotient * LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS; } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_arithmetic_barrett_reduce( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; v.elements[i0] = libcrux_ml_kem_vector_portable_arithmetic_barrett_reduce_element( v.elements[i0]); } return v; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_barrett_reduce_0d( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { return libcrux_ml_kem_vector_portable_arithmetic_barrett_reduce(v); } #define LIBCRUX_ML_KEM_VECTOR_PORTABLE_ARITHMETIC_MONTGOMERY_SHIFT (16U) #define LIBCRUX_ML_KEM_VECTOR_PORTABLE_ARITHMETIC_MONTGOMERY_R \ ((int32_t)1 << (uint32_t) \ LIBCRUX_ML_KEM_VECTOR_PORTABLE_ARITHMETIC_MONTGOMERY_SHIFT) /** Signed Montgomery Reduction Given an input `value`, `montgomery_reduce` outputs a representative `o` such that: - o ≡ value · MONTGOMERY_R^(-1) (mod FIELD_MODULUS) - the absolute value of `o` is bound as follows: `|result| ≤ (|value| / MONTGOMERY_R) + (FIELD_MODULUS / 2) In particular, if `|value| ≤ FIELD_MODULUS * MONTGOMERY_R`, then `|o| < (3 · FIELD_MODULUS) / 2`. */ static inline int16_t libcrux_ml_kem_vector_portable_arithmetic_montgomery_reduce_element( int32_t value) { int32_t k = (int32_t)(int16_t)value * (int32_t)LIBCRUX_ML_KEM_VECTOR_TRAITS_INVERSE_OF_MODULUS_MOD_MONTGOMERY_R; int32_t k_times_modulus = (int32_t)(int16_t)k * (int32_t)LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS; int16_t c = (int16_t)(k_times_modulus >> (uint32_t) LIBCRUX_ML_KEM_VECTOR_PORTABLE_ARITHMETIC_MONTGOMERY_SHIFT); int16_t value_high = (int16_t)(value >> (uint32_t) LIBCRUX_ML_KEM_VECTOR_PORTABLE_ARITHMETIC_MONTGOMERY_SHIFT); return value_high - c; } /** If `fe` is some field element 'x' of the Kyber field and `fer` is congruent to `y · MONTGOMERY_R`, this procedure outputs a value that is congruent to `x · y`, as follows: `fe · fer ≡ x · y · MONTGOMERY_R (mod FIELD_MODULUS)` `montgomery_reduce` takes the value `x · y · MONTGOMERY_R` and outputs a representative `x · y · MONTGOMERY_R * MONTGOMERY_R^{-1} ≡ x · y (mod FIELD_MODULUS)`. */ static KRML_MUSTINLINE int16_t libcrux_ml_kem_vector_portable_arithmetic_montgomery_multiply_fe_by_fer( int16_t fe, int16_t fer) { return libcrux_ml_kem_vector_portable_arithmetic_montgomery_reduce_element( (int32_t)fe * (int32_t)fer); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_arithmetic_montgomery_multiply_by_constant( libcrux_ml_kem_vector_portable_vector_type_PortableVector v, int16_t c) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; v.elements[i0] = libcrux_ml_kem_vector_portable_arithmetic_montgomery_multiply_fe_by_fer( v.elements[i0], c); } return v; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_montgomery_multiply_by_constant_0d( libcrux_ml_kem_vector_portable_vector_type_PortableVector v, int16_t r) { return libcrux_ml_kem_vector_portable_arithmetic_montgomery_multiply_by_constant( v, r); } /** The `compress_*` functions implement the `Compress` function specified in the NIST FIPS 203 standard (Page 18, Expression 4.5), which is defined as: ```plaintext Compress_d: ℤq -> ℤ_{2ᵈ} Compress_d(x) = ⌈(2ᵈ/q)·x⌋ ``` Since `⌈x⌋ = ⌊x + 1/2⌋` we have: ```plaintext Compress_d(x) = ⌊(2ᵈ/q)·x + 1/2⌋ = ⌊(2^{d+1}·x + q) / 2q⌋ ``` For further information about the function implementations, consult the `implementation_notes.pdf` document in this directory. The NIST FIPS 203 standard can be found at . */ static inline uint8_t libcrux_ml_kem_vector_portable_compress_compress_message_coefficient( uint16_t fe) { int16_t shifted = (int16_t)1664 - (int16_t)fe; int16_t mask = shifted >> 15U; int16_t shifted_to_positive = mask ^ shifted; int16_t shifted_positive_in_range = shifted_to_positive - (int16_t)832; return (uint8_t)(shifted_positive_in_range >> 15U & (int16_t)1); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_compress_compress_1( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; v.elements[i0] = (int16_t) libcrux_ml_kem_vector_portable_compress_compress_message_coefficient( (uint16_t)v.elements[i0]); } return v; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_compress_1_0d( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { return libcrux_ml_kem_vector_portable_compress_compress_1(v); } static KRML_MUSTINLINE uint32_t libcrux_ml_kem_vector_portable_arithmetic_get_n_least_significant_bits( uint8_t n, uint32_t value) { return value & ((1U << (uint32_t)n) - 1U); } static inline int16_t libcrux_ml_kem_vector_portable_compress_compress_ciphertext_coefficient( uint8_t coefficient_bits, uint16_t fe) { uint64_t compressed = (uint64_t)fe << (uint32_t)coefficient_bits; compressed = compressed + 1664ULL; compressed = compressed * 10321340ULL; compressed = compressed >> 35U; return (int16_t) libcrux_ml_kem_vector_portable_arithmetic_get_n_least_significant_bits( coefficient_bits, (uint32_t)compressed); } static KRML_MUSTINLINE void libcrux_ml_kem_vector_portable_ntt_ntt_step( libcrux_ml_kem_vector_portable_vector_type_PortableVector *v, int16_t zeta, size_t i, size_t j) { int16_t t = libcrux_ml_kem_vector_portable_arithmetic_montgomery_multiply_fe_by_fer( v->elements[j], zeta); v->elements[j] = v->elements[i] - t; v->elements[i] = v->elements[i] + t; } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_ntt_ntt_layer_1_step( libcrux_ml_kem_vector_portable_vector_type_PortableVector v, int16_t zeta0, int16_t zeta1, int16_t zeta2, int16_t zeta3) { libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta0, (size_t)0U, (size_t)2U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta0, (size_t)1U, (size_t)3U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta1, (size_t)4U, (size_t)6U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta1, (size_t)5U, (size_t)7U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta2, (size_t)8U, (size_t)10U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta2, (size_t)9U, (size_t)11U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta3, (size_t)12U, (size_t)14U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta3, (size_t)13U, (size_t)15U); return v; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_ntt_layer_1_step_0d( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, int16_t zeta0, int16_t zeta1, int16_t zeta2, int16_t zeta3) { return libcrux_ml_kem_vector_portable_ntt_ntt_layer_1_step(a, zeta0, zeta1, zeta2, zeta3); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_ntt_ntt_layer_2_step( libcrux_ml_kem_vector_portable_vector_type_PortableVector v, int16_t zeta0, int16_t zeta1) { libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta0, (size_t)0U, (size_t)4U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta0, (size_t)1U, (size_t)5U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta0, (size_t)2U, (size_t)6U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta0, (size_t)3U, (size_t)7U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta1, (size_t)8U, (size_t)12U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta1, (size_t)9U, (size_t)13U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta1, (size_t)10U, (size_t)14U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta1, (size_t)11U, (size_t)15U); return v; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_ntt_layer_2_step_0d( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, int16_t zeta0, int16_t zeta1) { return libcrux_ml_kem_vector_portable_ntt_ntt_layer_2_step(a, zeta0, zeta1); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_ntt_ntt_layer_3_step( libcrux_ml_kem_vector_portable_vector_type_PortableVector v, int16_t zeta) { libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta, (size_t)0U, (size_t)8U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta, (size_t)1U, (size_t)9U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta, (size_t)2U, (size_t)10U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta, (size_t)3U, (size_t)11U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta, (size_t)4U, (size_t)12U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta, (size_t)5U, (size_t)13U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta, (size_t)6U, (size_t)14U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&v, zeta, (size_t)7U, (size_t)15U); return v; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_ntt_layer_3_step_0d( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, int16_t zeta) { return libcrux_ml_kem_vector_portable_ntt_ntt_layer_3_step(a, zeta); } static KRML_MUSTINLINE void libcrux_ml_kem_vector_portable_ntt_inv_ntt_step( libcrux_ml_kem_vector_portable_vector_type_PortableVector *v, int16_t zeta, size_t i, size_t j) { int16_t a_minus_b = v->elements[j] - v->elements[i]; v->elements[i] = libcrux_ml_kem_vector_portable_arithmetic_barrett_reduce_element( v->elements[i] + v->elements[j]); v->elements[j] = libcrux_ml_kem_vector_portable_arithmetic_montgomery_multiply_fe_by_fer( a_minus_b, zeta); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_ntt_inv_ntt_layer_1_step( libcrux_ml_kem_vector_portable_vector_type_PortableVector v, int16_t zeta0, int16_t zeta1, int16_t zeta2, int16_t zeta3) { libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta0, (size_t)0U, (size_t)2U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta0, (size_t)1U, (size_t)3U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta1, (size_t)4U, (size_t)6U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta1, (size_t)5U, (size_t)7U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta2, (size_t)8U, (size_t)10U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta2, (size_t)9U, (size_t)11U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta3, (size_t)12U, (size_t)14U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta3, (size_t)13U, (size_t)15U); return v; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_inv_ntt_layer_1_step_0d( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, int16_t zeta0, int16_t zeta1, int16_t zeta2, int16_t zeta3) { return libcrux_ml_kem_vector_portable_ntt_inv_ntt_layer_1_step( a, zeta0, zeta1, zeta2, zeta3); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_ntt_inv_ntt_layer_2_step( libcrux_ml_kem_vector_portable_vector_type_PortableVector v, int16_t zeta0, int16_t zeta1) { libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta0, (size_t)0U, (size_t)4U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta0, (size_t)1U, (size_t)5U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta0, (size_t)2U, (size_t)6U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta0, (size_t)3U, (size_t)7U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta1, (size_t)8U, (size_t)12U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta1, (size_t)9U, (size_t)13U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta1, (size_t)10U, (size_t)14U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta1, (size_t)11U, (size_t)15U); return v; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_inv_ntt_layer_2_step_0d( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, int16_t zeta0, int16_t zeta1) { return libcrux_ml_kem_vector_portable_ntt_inv_ntt_layer_2_step(a, zeta0, zeta1); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_ntt_inv_ntt_layer_3_step( libcrux_ml_kem_vector_portable_vector_type_PortableVector v, int16_t zeta) { libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta, (size_t)0U, (size_t)8U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta, (size_t)1U, (size_t)9U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta, (size_t)2U, (size_t)10U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta, (size_t)3U, (size_t)11U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta, (size_t)4U, (size_t)12U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta, (size_t)5U, (size_t)13U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta, (size_t)6U, (size_t)14U); libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&v, zeta, (size_t)7U, (size_t)15U); return v; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_inv_ntt_layer_3_step_0d( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, int16_t zeta) { return libcrux_ml_kem_vector_portable_ntt_inv_ntt_layer_3_step(a, zeta); } /** Compute the product of two Kyber binomials with respect to the modulus `X² - zeta`. This function almost implements Algorithm 11 of the NIST FIPS 203 standard, which is reproduced below: ```plaintext Input: a₀, a₁, b₀, b₁ ∈ ℤq. Input: γ ∈ ℤq. Output: c₀, c₁ ∈ ℤq. c₀ ← a₀·b₀ + a₁·b₁·γ c₁ ← a₀·b₁ + a₁·b₀ return c₀, c₁ ``` We say "almost" because the coefficients output by this function are in the Montgomery domain (unlike in the specification). The NIST FIPS 203 standard can be found at . */ static KRML_MUSTINLINE void libcrux_ml_kem_vector_portable_ntt_ntt_multiply_binomials( libcrux_ml_kem_vector_portable_vector_type_PortableVector *a, libcrux_ml_kem_vector_portable_vector_type_PortableVector *b, int16_t zeta, size_t i, size_t j, libcrux_ml_kem_vector_portable_vector_type_PortableVector *out) { int16_t o0 = libcrux_ml_kem_vector_portable_arithmetic_montgomery_reduce_element( (int32_t)a->elements[i] * (int32_t)b->elements[i] + (int32_t) libcrux_ml_kem_vector_portable_arithmetic_montgomery_reduce_element( (int32_t)a->elements[j] * (int32_t)b->elements[j]) * (int32_t)zeta); int16_t o1 = libcrux_ml_kem_vector_portable_arithmetic_montgomery_reduce_element( (int32_t)a->elements[i] * (int32_t)b->elements[j] + (int32_t)a->elements[j] * (int32_t)b->elements[i]); out->elements[i] = o0; out->elements[j] = o1; } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_ntt_ntt_multiply( libcrux_ml_kem_vector_portable_vector_type_PortableVector *lhs, libcrux_ml_kem_vector_portable_vector_type_PortableVector *rhs, int16_t zeta0, int16_t zeta1, int16_t zeta2, int16_t zeta3) { libcrux_ml_kem_vector_portable_vector_type_PortableVector out = libcrux_ml_kem_vector_portable_vector_type_zero(); libcrux_ml_kem_vector_portable_ntt_ntt_multiply_binomials( lhs, rhs, zeta0, (size_t)0U, (size_t)1U, &out); libcrux_ml_kem_vector_portable_ntt_ntt_multiply_binomials( lhs, rhs, -zeta0, (size_t)2U, (size_t)3U, &out); libcrux_ml_kem_vector_portable_ntt_ntt_multiply_binomials( lhs, rhs, zeta1, (size_t)4U, (size_t)5U, &out); libcrux_ml_kem_vector_portable_ntt_ntt_multiply_binomials( lhs, rhs, -zeta1, (size_t)6U, (size_t)7U, &out); libcrux_ml_kem_vector_portable_ntt_ntt_multiply_binomials( lhs, rhs, zeta2, (size_t)8U, (size_t)9U, &out); libcrux_ml_kem_vector_portable_ntt_ntt_multiply_binomials( lhs, rhs, -zeta2, (size_t)10U, (size_t)11U, &out); libcrux_ml_kem_vector_portable_ntt_ntt_multiply_binomials( lhs, rhs, zeta3, (size_t)12U, (size_t)13U, &out); libcrux_ml_kem_vector_portable_ntt_ntt_multiply_binomials( lhs, rhs, -zeta3, (size_t)14U, (size_t)15U, &out); return out; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_ntt_multiply_0d( libcrux_ml_kem_vector_portable_vector_type_PortableVector *lhs, libcrux_ml_kem_vector_portable_vector_type_PortableVector *rhs, int16_t zeta0, int16_t zeta1, int16_t zeta2, int16_t zeta3) { return libcrux_ml_kem_vector_portable_ntt_ntt_multiply(lhs, rhs, zeta0, zeta1, zeta2, zeta3); } static KRML_MUSTINLINE void libcrux_ml_kem_vector_portable_serialize_serialize_1( libcrux_ml_kem_vector_portable_vector_type_PortableVector v, uint8_t ret[2U]) { uint8_t result[2U] = {0U}; for (size_t i = (size_t)0U; i < (size_t)8U; i++) { size_t i0 = i; size_t uu____0 = (size_t)0U; result[uu____0] = (uint32_t)result[uu____0] | (uint32_t)(uint8_t)v.elements[i0] << (uint32_t)i0; } for (size_t i = (size_t)8U; i < (size_t)16U; i++) { size_t i0 = i; size_t uu____1 = (size_t)1U; result[uu____1] = (uint32_t)result[uu____1] | (uint32_t)(uint8_t)v.elements[i0] << (uint32_t)(i0 - (size_t)8U); } memcpy(ret, result, (size_t)2U * sizeof(uint8_t)); } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline void libcrux_ml_kem_vector_portable_serialize_1_0d( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, uint8_t ret[2U]) { libcrux_ml_kem_vector_portable_serialize_serialize_1(a, ret); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_serialize_deserialize_1(Eurydice_slice v) { libcrux_ml_kem_vector_portable_vector_type_PortableVector result = libcrux_ml_kem_vector_portable_vector_type_zero(); for (size_t i = (size_t)0U; i < (size_t)8U; i++) { size_t i0 = i; result.elements[i0] = (int16_t)((uint32_t)Eurydice_slice_index( v, (size_t)0U, uint8_t, uint8_t *) >> (uint32_t)i0 & 1U); } for (size_t i = (size_t)8U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; result.elements[i0] = (int16_t)((uint32_t)Eurydice_slice_index( v, (size_t)1U, uint8_t, uint8_t *) >> (uint32_t)(i0 - (size_t)8U) & 1U); } return result; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_deserialize_1_0d(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_serialize_deserialize_1(a); } typedef struct uint8_t_x4_s { uint8_t fst; uint8_t snd; uint8_t thd; uint8_t f3; } uint8_t_x4; static KRML_MUSTINLINE uint8_t_x4 libcrux_ml_kem_vector_portable_serialize_serialize_4_int(Eurydice_slice v) { uint8_t result0 = (uint32_t)(uint8_t)Eurydice_slice_index(v, (size_t)1U, int16_t, int16_t *) << 4U | (uint32_t)(uint8_t)Eurydice_slice_index(v, (size_t)0U, int16_t, int16_t *); uint8_t result1 = (uint32_t)(uint8_t)Eurydice_slice_index(v, (size_t)3U, int16_t, int16_t *) << 4U | (uint32_t)(uint8_t)Eurydice_slice_index(v, (size_t)2U, int16_t, int16_t *); uint8_t result2 = (uint32_t)(uint8_t)Eurydice_slice_index(v, (size_t)5U, int16_t, int16_t *) << 4U | (uint32_t)(uint8_t)Eurydice_slice_index(v, (size_t)4U, int16_t, int16_t *); uint8_t result3 = (uint32_t)(uint8_t)Eurydice_slice_index(v, (size_t)7U, int16_t, int16_t *) << 4U | (uint32_t)(uint8_t)Eurydice_slice_index(v, (size_t)6U, int16_t, int16_t *); return (CLITERAL(uint8_t_x4){ .fst = result0, .snd = result1, .thd = result2, .f3 = result3}); } static KRML_MUSTINLINE void libcrux_ml_kem_vector_portable_serialize_serialize_4( libcrux_ml_kem_vector_portable_vector_type_PortableVector v, uint8_t ret[8U]) { uint8_t_x4 result0_3 = libcrux_ml_kem_vector_portable_serialize_serialize_4_int( Eurydice_array_to_subslice2(v.elements, (size_t)0U, (size_t)8U, int16_t)); uint8_t_x4 result4_7 = libcrux_ml_kem_vector_portable_serialize_serialize_4_int( Eurydice_array_to_subslice2(v.elements, (size_t)8U, (size_t)16U, int16_t)); uint8_t result[8U] = {0U}; result[0U] = result0_3.fst; result[1U] = result0_3.snd; result[2U] = result0_3.thd; result[3U] = result0_3.f3; result[4U] = result4_7.fst; result[5U] = result4_7.snd; result[6U] = result4_7.thd; result[7U] = result4_7.f3; memcpy(ret, result, (size_t)8U * sizeof(uint8_t)); } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline void libcrux_ml_kem_vector_portable_serialize_4_0d( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, uint8_t ret[8U]) { libcrux_ml_kem_vector_portable_serialize_serialize_4(a, ret); } static KRML_MUSTINLINE int16_t_x8 libcrux_ml_kem_vector_portable_serialize_deserialize_4_int( Eurydice_slice bytes) { int16_t v0 = (int16_t)((uint32_t)Eurydice_slice_index(bytes, (size_t)0U, uint8_t, uint8_t *) & 15U); int16_t v1 = (int16_t)((uint32_t)Eurydice_slice_index(bytes, (size_t)0U, uint8_t, uint8_t *) >> 4U & 15U); int16_t v2 = (int16_t)((uint32_t)Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *) & 15U); int16_t v3 = (int16_t)((uint32_t)Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *) >> 4U & 15U); int16_t v4 = (int16_t)((uint32_t)Eurydice_slice_index(bytes, (size_t)2U, uint8_t, uint8_t *) & 15U); int16_t v5 = (int16_t)((uint32_t)Eurydice_slice_index(bytes, (size_t)2U, uint8_t, uint8_t *) >> 4U & 15U); int16_t v6 = (int16_t)((uint32_t)Eurydice_slice_index(bytes, (size_t)3U, uint8_t, uint8_t *) & 15U); int16_t v7 = (int16_t)((uint32_t)Eurydice_slice_index(bytes, (size_t)3U, uint8_t, uint8_t *) >> 4U & 15U); return (CLITERAL(int16_t_x8){.fst = v0, .snd = v1, .thd = v2, .f3 = v3, .f4 = v4, .f5 = v5, .f6 = v6, .f7 = v7}); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_serialize_deserialize_4(Eurydice_slice bytes) { int16_t_x8 v0_7 = libcrux_ml_kem_vector_portable_serialize_deserialize_4_int( Eurydice_slice_subslice2(bytes, (size_t)0U, (size_t)4U, uint8_t)); int16_t_x8 v8_15 = libcrux_ml_kem_vector_portable_serialize_deserialize_4_int( Eurydice_slice_subslice2(bytes, (size_t)4U, (size_t)8U, uint8_t)); libcrux_ml_kem_vector_portable_vector_type_PortableVector v = libcrux_ml_kem_vector_portable_vector_type_zero(); v.elements[0U] = v0_7.fst; v.elements[1U] = v0_7.snd; v.elements[2U] = v0_7.thd; v.elements[3U] = v0_7.f3; v.elements[4U] = v0_7.f4; v.elements[5U] = v0_7.f5; v.elements[6U] = v0_7.f6; v.elements[7U] = v0_7.f7; v.elements[8U] = v8_15.fst; v.elements[9U] = v8_15.snd; v.elements[10U] = v8_15.thd; v.elements[11U] = v8_15.f3; v.elements[12U] = v8_15.f4; v.elements[13U] = v8_15.f5; v.elements[14U] = v8_15.f6; v.elements[15U] = v8_15.f7; return v; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_deserialize_4_0d(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_serialize_deserialize_4(a); } typedef struct uint8_t_x5_s { uint8_t fst; uint8_t snd; uint8_t thd; uint8_t f3; uint8_t f4; } uint8_t_x5; static KRML_MUSTINLINE uint8_t_x5 libcrux_ml_kem_vector_portable_serialize_serialize_5_int(Eurydice_slice v) { uint8_t r0 = (uint8_t)(Eurydice_slice_index(v, (size_t)0U, int16_t, int16_t *) | Eurydice_slice_index(v, (size_t)1U, int16_t, int16_t *) << 5U); uint8_t r1 = (uint8_t)((Eurydice_slice_index(v, (size_t)1U, int16_t, int16_t *) >> 3U | Eurydice_slice_index(v, (size_t)2U, int16_t, int16_t *) << 2U) | Eurydice_slice_index(v, (size_t)3U, int16_t, int16_t *) << 7U); uint8_t r2 = (uint8_t)(Eurydice_slice_index(v, (size_t)3U, int16_t, int16_t *) >> 1U | Eurydice_slice_index(v, (size_t)4U, int16_t, int16_t *) << 4U); uint8_t r3 = (uint8_t)((Eurydice_slice_index(v, (size_t)4U, int16_t, int16_t *) >> 4U | Eurydice_slice_index(v, (size_t)5U, int16_t, int16_t *) << 1U) | Eurydice_slice_index(v, (size_t)6U, int16_t, int16_t *) << 6U); uint8_t r4 = (uint8_t)(Eurydice_slice_index(v, (size_t)6U, int16_t, int16_t *) >> 2U | Eurydice_slice_index(v, (size_t)7U, int16_t, int16_t *) << 3U); return (CLITERAL(uint8_t_x5){ .fst = r0, .snd = r1, .thd = r2, .f3 = r3, .f4 = r4}); } static KRML_MUSTINLINE void libcrux_ml_kem_vector_portable_serialize_serialize_5( libcrux_ml_kem_vector_portable_vector_type_PortableVector v, uint8_t ret[10U]) { uint8_t_x5 r0_4 = libcrux_ml_kem_vector_portable_serialize_serialize_5_int( Eurydice_array_to_subslice2(v.elements, (size_t)0U, (size_t)8U, int16_t)); uint8_t_x5 r5_9 = libcrux_ml_kem_vector_portable_serialize_serialize_5_int( Eurydice_array_to_subslice2(v.elements, (size_t)8U, (size_t)16U, int16_t)); uint8_t result[10U] = {0U}; result[0U] = r0_4.fst; result[1U] = r0_4.snd; result[2U] = r0_4.thd; result[3U] = r0_4.f3; result[4U] = r0_4.f4; result[5U] = r5_9.fst; result[6U] = r5_9.snd; result[7U] = r5_9.thd; result[8U] = r5_9.f3; result[9U] = r5_9.f4; memcpy(ret, result, (size_t)10U * sizeof(uint8_t)); } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline void libcrux_ml_kem_vector_portable_serialize_5_0d( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, uint8_t ret[10U]) { libcrux_ml_kem_vector_portable_serialize_serialize_5(a, ret); } static KRML_MUSTINLINE int16_t_x8 libcrux_ml_kem_vector_portable_serialize_deserialize_5_int( Eurydice_slice bytes) { int16_t v0 = (int16_t)((uint32_t)Eurydice_slice_index(bytes, (size_t)0U, uint8_t, uint8_t *) & 31U); int16_t v1 = (int16_t)(((uint32_t)Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *) & 3U) << 3U | (uint32_t)Eurydice_slice_index(bytes, (size_t)0U, uint8_t, uint8_t *) >> 5U); int16_t v2 = (int16_t)((uint32_t)Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *) >> 2U & 31U); int16_t v3 = (int16_t)(((uint32_t)Eurydice_slice_index(bytes, (size_t)2U, uint8_t, uint8_t *) & 15U) << 1U | (uint32_t)Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *) >> 7U); int16_t v4 = (int16_t)(((uint32_t)Eurydice_slice_index(bytes, (size_t)3U, uint8_t, uint8_t *) & 1U) << 4U | (uint32_t)Eurydice_slice_index(bytes, (size_t)2U, uint8_t, uint8_t *) >> 4U); int16_t v5 = (int16_t)((uint32_t)Eurydice_slice_index(bytes, (size_t)3U, uint8_t, uint8_t *) >> 1U & 31U); int16_t v6 = (int16_t)(((uint32_t)Eurydice_slice_index(bytes, (size_t)4U, uint8_t, uint8_t *) & 7U) << 2U | (uint32_t)Eurydice_slice_index(bytes, (size_t)3U, uint8_t, uint8_t *) >> 6U); int16_t v7 = (int16_t)((uint32_t)Eurydice_slice_index(bytes, (size_t)4U, uint8_t, uint8_t *) >> 3U); return (CLITERAL(int16_t_x8){.fst = v0, .snd = v1, .thd = v2, .f3 = v3, .f4 = v4, .f5 = v5, .f6 = v6, .f7 = v7}); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_serialize_deserialize_5(Eurydice_slice bytes) { int16_t_x8 v0_7 = libcrux_ml_kem_vector_portable_serialize_deserialize_5_int( Eurydice_slice_subslice2(bytes, (size_t)0U, (size_t)5U, uint8_t)); int16_t_x8 v8_15 = libcrux_ml_kem_vector_portable_serialize_deserialize_5_int( Eurydice_slice_subslice2(bytes, (size_t)5U, (size_t)10U, uint8_t)); libcrux_ml_kem_vector_portable_vector_type_PortableVector v = libcrux_ml_kem_vector_portable_vector_type_zero(); v.elements[0U] = v0_7.fst; v.elements[1U] = v0_7.snd; v.elements[2U] = v0_7.thd; v.elements[3U] = v0_7.f3; v.elements[4U] = v0_7.f4; v.elements[5U] = v0_7.f5; v.elements[6U] = v0_7.f6; v.elements[7U] = v0_7.f7; v.elements[8U] = v8_15.fst; v.elements[9U] = v8_15.snd; v.elements[10U] = v8_15.thd; v.elements[11U] = v8_15.f3; v.elements[12U] = v8_15.f4; v.elements[13U] = v8_15.f5; v.elements[14U] = v8_15.f6; v.elements[15U] = v8_15.f7; return v; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_deserialize_5_0d(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_serialize_deserialize_5(a); } static KRML_MUSTINLINE uint8_t_x5 libcrux_ml_kem_vector_portable_serialize_serialize_10_int(Eurydice_slice v) { uint8_t r0 = (uint8_t)(Eurydice_slice_index(v, (size_t)0U, int16_t, int16_t *) & (int16_t)255); uint8_t r1 = (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)1U, int16_t, int16_t *) & (int16_t)63) << 2U | (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)0U, int16_t, int16_t *) >> 8U & (int16_t)3); uint8_t r2 = (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)2U, int16_t, int16_t *) & (int16_t)15) << 4U | (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)1U, int16_t, int16_t *) >> 6U & (int16_t)15); uint8_t r3 = (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)3U, int16_t, int16_t *) & (int16_t)3) << 6U | (uint32_t)(uint8_t)(Eurydice_slice_index(v, (size_t)2U, int16_t, int16_t *) >> 4U & (int16_t)63); uint8_t r4 = (uint8_t)(Eurydice_slice_index(v, (size_t)3U, int16_t, int16_t *) >> 2U & (int16_t)255); return (CLITERAL(uint8_t_x5){ .fst = r0, .snd = r1, .thd = r2, .f3 = r3, .f4 = r4}); } static KRML_MUSTINLINE void libcrux_ml_kem_vector_portable_serialize_serialize_10( libcrux_ml_kem_vector_portable_vector_type_PortableVector v, uint8_t ret[20U]) { uint8_t_x5 r0_4 = libcrux_ml_kem_vector_portable_serialize_serialize_10_int( Eurydice_array_to_subslice2(v.elements, (size_t)0U, (size_t)4U, int16_t)); uint8_t_x5 r5_9 = libcrux_ml_kem_vector_portable_serialize_serialize_10_int( Eurydice_array_to_subslice2(v.elements, (size_t)4U, (size_t)8U, int16_t)); uint8_t_x5 r10_14 = libcrux_ml_kem_vector_portable_serialize_serialize_10_int( Eurydice_array_to_subslice2(v.elements, (size_t)8U, (size_t)12U, int16_t)); uint8_t_x5 r15_19 = libcrux_ml_kem_vector_portable_serialize_serialize_10_int( Eurydice_array_to_subslice2(v.elements, (size_t)12U, (size_t)16U, int16_t)); uint8_t result[20U] = {0U}; result[0U] = r0_4.fst; result[1U] = r0_4.snd; result[2U] = r0_4.thd; result[3U] = r0_4.f3; result[4U] = r0_4.f4; result[5U] = r5_9.fst; result[6U] = r5_9.snd; result[7U] = r5_9.thd; result[8U] = r5_9.f3; result[9U] = r5_9.f4; result[10U] = r10_14.fst; result[11U] = r10_14.snd; result[12U] = r10_14.thd; result[13U] = r10_14.f3; result[14U] = r10_14.f4; result[15U] = r15_19.fst; result[16U] = r15_19.snd; result[17U] = r15_19.thd; result[18U] = r15_19.f3; result[19U] = r15_19.f4; memcpy(ret, result, (size_t)20U * sizeof(uint8_t)); } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline void libcrux_ml_kem_vector_portable_serialize_10_0d( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, uint8_t ret[20U]) { libcrux_ml_kem_vector_portable_serialize_serialize_10(a, ret); } static KRML_MUSTINLINE int16_t_x8 libcrux_ml_kem_vector_portable_serialize_deserialize_10_int( Eurydice_slice bytes) { int16_t r0 = ((int16_t)Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *) & (int16_t)3) << 8U | ((int16_t)Eurydice_slice_index(bytes, (size_t)0U, uint8_t, uint8_t *) & (int16_t)255); int16_t r1 = ((int16_t)Eurydice_slice_index(bytes, (size_t)2U, uint8_t, uint8_t *) & (int16_t)15) << 6U | (int16_t)Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *) >> 2U; int16_t r2 = ((int16_t)Eurydice_slice_index(bytes, (size_t)3U, uint8_t, uint8_t *) & (int16_t)63) << 4U | (int16_t)Eurydice_slice_index(bytes, (size_t)2U, uint8_t, uint8_t *) >> 4U; int16_t r3 = (int16_t)Eurydice_slice_index(bytes, (size_t)4U, uint8_t, uint8_t *) << 2U | (int16_t)Eurydice_slice_index(bytes, (size_t)3U, uint8_t, uint8_t *) >> 6U; int16_t r4 = ((int16_t)Eurydice_slice_index(bytes, (size_t)6U, uint8_t, uint8_t *) & (int16_t)3) << 8U | ((int16_t)Eurydice_slice_index(bytes, (size_t)5U, uint8_t, uint8_t *) & (int16_t)255); int16_t r5 = ((int16_t)Eurydice_slice_index(bytes, (size_t)7U, uint8_t, uint8_t *) & (int16_t)15) << 6U | (int16_t)Eurydice_slice_index(bytes, (size_t)6U, uint8_t, uint8_t *) >> 2U; int16_t r6 = ((int16_t)Eurydice_slice_index(bytes, (size_t)8U, uint8_t, uint8_t *) & (int16_t)63) << 4U | (int16_t)Eurydice_slice_index(bytes, (size_t)7U, uint8_t, uint8_t *) >> 4U; int16_t r7 = (int16_t)Eurydice_slice_index(bytes, (size_t)9U, uint8_t, uint8_t *) << 2U | (int16_t)Eurydice_slice_index(bytes, (size_t)8U, uint8_t, uint8_t *) >> 6U; return (CLITERAL(int16_t_x8){.fst = r0, .snd = r1, .thd = r2, .f3 = r3, .f4 = r4, .f5 = r5, .f6 = r6, .f7 = r7}); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_serialize_deserialize_10(Eurydice_slice bytes) { int16_t_x8 v0_7 = libcrux_ml_kem_vector_portable_serialize_deserialize_10_int( Eurydice_slice_subslice2(bytes, (size_t)0U, (size_t)10U, uint8_t)); int16_t_x8 v8_15 = libcrux_ml_kem_vector_portable_serialize_deserialize_10_int( Eurydice_slice_subslice2(bytes, (size_t)10U, (size_t)20U, uint8_t)); libcrux_ml_kem_vector_portable_vector_type_PortableVector v = libcrux_ml_kem_vector_portable_vector_type_zero(); v.elements[0U] = v0_7.fst; v.elements[1U] = v0_7.snd; v.elements[2U] = v0_7.thd; v.elements[3U] = v0_7.f3; v.elements[4U] = v0_7.f4; v.elements[5U] = v0_7.f5; v.elements[6U] = v0_7.f6; v.elements[7U] = v0_7.f7; v.elements[8U] = v8_15.fst; v.elements[9U] = v8_15.snd; v.elements[10U] = v8_15.thd; v.elements[11U] = v8_15.f3; v.elements[12U] = v8_15.f4; v.elements[13U] = v8_15.f5; v.elements[14U] = v8_15.f6; v.elements[15U] = v8_15.f7; return v; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_deserialize_10_0d(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_serialize_deserialize_10(a); } typedef struct uint8_t_x3_s { uint8_t fst; uint8_t snd; uint8_t thd; } uint8_t_x3; static KRML_MUSTINLINE uint8_t_x3 libcrux_ml_kem_vector_portable_serialize_serialize_12_int(Eurydice_slice v) { uint8_t r0 = (uint8_t)(Eurydice_slice_index(v, (size_t)0U, int16_t, int16_t *) & (int16_t)255); uint8_t r1 = (uint8_t)(Eurydice_slice_index(v, (size_t)0U, int16_t, int16_t *) >> 8U | (Eurydice_slice_index(v, (size_t)1U, int16_t, int16_t *) & (int16_t)15) << 4U); uint8_t r2 = (uint8_t)(Eurydice_slice_index(v, (size_t)1U, int16_t, int16_t *) >> 4U & (int16_t)255); return (CLITERAL(uint8_t_x3){.fst = r0, .snd = r1, .thd = r2}); } static KRML_MUSTINLINE void libcrux_ml_kem_vector_portable_serialize_serialize_12( libcrux_ml_kem_vector_portable_vector_type_PortableVector v, uint8_t ret[24U]) { uint8_t_x3 r0_2 = libcrux_ml_kem_vector_portable_serialize_serialize_12_int( Eurydice_array_to_subslice2(v.elements, (size_t)0U, (size_t)2U, int16_t)); uint8_t_x3 r3_5 = libcrux_ml_kem_vector_portable_serialize_serialize_12_int( Eurydice_array_to_subslice2(v.elements, (size_t)2U, (size_t)4U, int16_t)); uint8_t_x3 r6_8 = libcrux_ml_kem_vector_portable_serialize_serialize_12_int( Eurydice_array_to_subslice2(v.elements, (size_t)4U, (size_t)6U, int16_t)); uint8_t_x3 r9_11 = libcrux_ml_kem_vector_portable_serialize_serialize_12_int( Eurydice_array_to_subslice2(v.elements, (size_t)6U, (size_t)8U, int16_t)); uint8_t_x3 r12_14 = libcrux_ml_kem_vector_portable_serialize_serialize_12_int( Eurydice_array_to_subslice2(v.elements, (size_t)8U, (size_t)10U, int16_t)); uint8_t_x3 r15_17 = libcrux_ml_kem_vector_portable_serialize_serialize_12_int( Eurydice_array_to_subslice2(v.elements, (size_t)10U, (size_t)12U, int16_t)); uint8_t_x3 r18_20 = libcrux_ml_kem_vector_portable_serialize_serialize_12_int( Eurydice_array_to_subslice2(v.elements, (size_t)12U, (size_t)14U, int16_t)); uint8_t_x3 r21_23 = libcrux_ml_kem_vector_portable_serialize_serialize_12_int( Eurydice_array_to_subslice2(v.elements, (size_t)14U, (size_t)16U, int16_t)); uint8_t result[24U] = {0U}; result[0U] = r0_2.fst; result[1U] = r0_2.snd; result[2U] = r0_2.thd; result[3U] = r3_5.fst; result[4U] = r3_5.snd; result[5U] = r3_5.thd; result[6U] = r6_8.fst; result[7U] = r6_8.snd; result[8U] = r6_8.thd; result[9U] = r9_11.fst; result[10U] = r9_11.snd; result[11U] = r9_11.thd; result[12U] = r12_14.fst; result[13U] = r12_14.snd; result[14U] = r12_14.thd; result[15U] = r15_17.fst; result[16U] = r15_17.snd; result[17U] = r15_17.thd; result[18U] = r18_20.fst; result[19U] = r18_20.snd; result[20U] = r18_20.thd; result[21U] = r21_23.fst; result[22U] = r21_23.snd; result[23U] = r21_23.thd; memcpy(ret, result, (size_t)24U * sizeof(uint8_t)); } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline void libcrux_ml_kem_vector_portable_serialize_12_0d( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, uint8_t ret[24U]) { libcrux_ml_kem_vector_portable_serialize_serialize_12(a, ret); } typedef struct int16_t_x2_s { int16_t fst; int16_t snd; } int16_t_x2; static KRML_MUSTINLINE int16_t_x2 libcrux_ml_kem_vector_portable_serialize_deserialize_12_int( Eurydice_slice bytes) { int16_t byte0 = (int16_t)Eurydice_slice_index(bytes, (size_t)0U, uint8_t, uint8_t *); int16_t byte1 = (int16_t)Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *); int16_t byte2 = (int16_t)Eurydice_slice_index(bytes, (size_t)2U, uint8_t, uint8_t *); int16_t r0 = (byte1 & (int16_t)15) << 8U | (byte0 & (int16_t)255); int16_t r1 = byte2 << 4U | (byte1 >> 4U & (int16_t)15); return (CLITERAL(int16_t_x2){.fst = r0, .snd = r1}); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_serialize_deserialize_12(Eurydice_slice bytes) { int16_t_x2 v0_1 = libcrux_ml_kem_vector_portable_serialize_deserialize_12_int( Eurydice_slice_subslice2(bytes, (size_t)0U, (size_t)3U, uint8_t)); int16_t_x2 v2_3 = libcrux_ml_kem_vector_portable_serialize_deserialize_12_int( Eurydice_slice_subslice2(bytes, (size_t)3U, (size_t)6U, uint8_t)); int16_t_x2 v4_5 = libcrux_ml_kem_vector_portable_serialize_deserialize_12_int( Eurydice_slice_subslice2(bytes, (size_t)6U, (size_t)9U, uint8_t)); int16_t_x2 v6_7 = libcrux_ml_kem_vector_portable_serialize_deserialize_12_int( Eurydice_slice_subslice2(bytes, (size_t)9U, (size_t)12U, uint8_t)); int16_t_x2 v8_9 = libcrux_ml_kem_vector_portable_serialize_deserialize_12_int( Eurydice_slice_subslice2(bytes, (size_t)12U, (size_t)15U, uint8_t)); int16_t_x2 v10_11 = libcrux_ml_kem_vector_portable_serialize_deserialize_12_int( Eurydice_slice_subslice2(bytes, (size_t)15U, (size_t)18U, uint8_t)); int16_t_x2 v12_13 = libcrux_ml_kem_vector_portable_serialize_deserialize_12_int( Eurydice_slice_subslice2(bytes, (size_t)18U, (size_t)21U, uint8_t)); int16_t_x2 v14_15 = libcrux_ml_kem_vector_portable_serialize_deserialize_12_int( Eurydice_slice_subslice2(bytes, (size_t)21U, (size_t)24U, uint8_t)); libcrux_ml_kem_vector_portable_vector_type_PortableVector re = libcrux_ml_kem_vector_portable_vector_type_zero(); re.elements[0U] = v0_1.fst; re.elements[1U] = v0_1.snd; re.elements[2U] = v2_3.fst; re.elements[3U] = v2_3.snd; re.elements[4U] = v4_5.fst; re.elements[5U] = v4_5.snd; re.elements[6U] = v6_7.fst; re.elements[7U] = v6_7.snd; re.elements[8U] = v8_9.fst; re.elements[9U] = v8_9.snd; re.elements[10U] = v10_11.fst; re.elements[11U] = v10_11.snd; re.elements[12U] = v12_13.fst; re.elements[13U] = v12_13.snd; re.elements[14U] = v14_15.fst; re.elements[15U] = v14_15.snd; return re; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_deserialize_12_0d(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_serialize_deserialize_12(a); } static KRML_MUSTINLINE size_t libcrux_ml_kem_vector_portable_sampling_rej_sample(Eurydice_slice a, Eurydice_slice result) { size_t sampled = (size_t)0U; for (size_t i = (size_t)0U; i < Eurydice_slice_len(a, uint8_t) / (size_t)3U; i++) { size_t i0 = i; int16_t b1 = (int16_t)Eurydice_slice_index(a, i0 * (size_t)3U + (size_t)0U, uint8_t, uint8_t *); int16_t b2 = (int16_t)Eurydice_slice_index(a, i0 * (size_t)3U + (size_t)1U, uint8_t, uint8_t *); int16_t b3 = (int16_t)Eurydice_slice_index(a, i0 * (size_t)3U + (size_t)2U, uint8_t, uint8_t *); int16_t d1 = (b2 & (int16_t)15) << 8U | b1; int16_t d2 = b3 << 4U | b2 >> 4U; bool uu____0; int16_t uu____1; bool uu____2; size_t uu____3; int16_t uu____4; size_t uu____5; int16_t uu____6; if (d1 < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS) { if (sampled < (size_t)16U) { Eurydice_slice_index(result, sampled, int16_t, int16_t *) = d1; sampled++; uu____1 = d2; uu____6 = LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS; uu____0 = uu____1 < uu____6; if (uu____0) { uu____3 = sampled; uu____2 = uu____3 < (size_t)16U; if (uu____2) { uu____4 = d2; uu____5 = sampled; Eurydice_slice_index(result, uu____5, int16_t, int16_t *) = uu____4; sampled++; continue; } } continue; } } uu____1 = d2; uu____6 = LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS; uu____0 = uu____1 < uu____6; if (uu____0) { uu____3 = sampled; uu____2 = uu____3 < (size_t)16U; if (uu____2) { uu____4 = d2; uu____5 = sampled; Eurydice_slice_index(result, uu____5, int16_t, int16_t *) = uu____4; sampled++; continue; } } } return sampled; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline size_t libcrux_ml_kem_vector_portable_rej_sample_0d( Eurydice_slice a, Eurydice_slice out) { return libcrux_ml_kem_vector_portable_sampling_rej_sample(a, out); } #define LIBCRUX_ML_KEM_MLKEM768_VECTOR_U_COMPRESSION_FACTOR_768 ((size_t)10U) #define LIBCRUX_ML_KEM_MLKEM768_C1_BLOCK_SIZE_768 \ (LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT * \ LIBCRUX_ML_KEM_MLKEM768_VECTOR_U_COMPRESSION_FACTOR_768 / (size_t)8U) #define LIBCRUX_ML_KEM_MLKEM768_RANK_768 ((size_t)3U) #define LIBCRUX_ML_KEM_MLKEM768_C1_SIZE_768 \ (LIBCRUX_ML_KEM_MLKEM768_C1_BLOCK_SIZE_768 * LIBCRUX_ML_KEM_MLKEM768_RANK_768) #define LIBCRUX_ML_KEM_MLKEM768_VECTOR_V_COMPRESSION_FACTOR_768 ((size_t)4U) #define LIBCRUX_ML_KEM_MLKEM768_C2_SIZE_768 \ (LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT * \ LIBCRUX_ML_KEM_MLKEM768_VECTOR_V_COMPRESSION_FACTOR_768 / (size_t)8U) #define LIBCRUX_ML_KEM_MLKEM768_CPA_PKE_CIPHERTEXT_SIZE_768 \ (LIBCRUX_ML_KEM_MLKEM768_C1_SIZE_768 + LIBCRUX_ML_KEM_MLKEM768_C2_SIZE_768) #define LIBCRUX_ML_KEM_MLKEM768_T_AS_NTT_ENCODED_SIZE_768 \ (LIBCRUX_ML_KEM_MLKEM768_RANK_768 * \ LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT * \ LIBCRUX_ML_KEM_CONSTANTS_BITS_PER_COEFFICIENT / (size_t)8U) #define LIBCRUX_ML_KEM_MLKEM768_CPA_PKE_PUBLIC_KEY_SIZE_768 \ (LIBCRUX_ML_KEM_MLKEM768_T_AS_NTT_ENCODED_SIZE_768 + (size_t)32U) #define LIBCRUX_ML_KEM_MLKEM768_CPA_PKE_SECRET_KEY_SIZE_768 \ (LIBCRUX_ML_KEM_MLKEM768_RANK_768 * \ LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT * \ LIBCRUX_ML_KEM_CONSTANTS_BITS_PER_COEFFICIENT / (size_t)8U) #define LIBCRUX_ML_KEM_MLKEM768_ETA1 ((size_t)2U) #define LIBCRUX_ML_KEM_MLKEM768_ETA1_RANDOMNESS_SIZE \ (LIBCRUX_ML_KEM_MLKEM768_ETA1 * (size_t)64U) #define LIBCRUX_ML_KEM_MLKEM768_ETA2 ((size_t)2U) #define LIBCRUX_ML_KEM_MLKEM768_ETA2_RANDOMNESS_SIZE \ (LIBCRUX_ML_KEM_MLKEM768_ETA2 * (size_t)64U) #define LIBCRUX_ML_KEM_MLKEM768_IMPLICIT_REJECTION_HASH_INPUT_SIZE \ (LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE + \ LIBCRUX_ML_KEM_MLKEM768_CPA_PKE_CIPHERTEXT_SIZE_768) typedef libcrux_ml_kem_types_MlKemPrivateKey_55 libcrux_ml_kem_mlkem768_MlKem768PrivateKey; typedef libcrux_ml_kem_types_MlKemPublicKey_15 libcrux_ml_kem_mlkem768_MlKem768PublicKey; #define LIBCRUX_ML_KEM_MLKEM768_RANKED_BYTES_PER_RING_ELEMENT_768 \ (LIBCRUX_ML_KEM_MLKEM768_RANK_768 * \ LIBCRUX_ML_KEM_CONSTANTS_BITS_PER_RING_ELEMENT / (size_t)8U) #define LIBCRUX_ML_KEM_MLKEM768_SECRET_KEY_SIZE_768 \ (LIBCRUX_ML_KEM_MLKEM768_CPA_PKE_SECRET_KEY_SIZE_768 + \ LIBCRUX_ML_KEM_MLKEM768_CPA_PKE_PUBLIC_KEY_SIZE_768 + \ LIBCRUX_ML_KEM_CONSTANTS_H_DIGEST_SIZE + \ LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE) /** A monomorphic instance of libcrux_ml_kem.polynomial.PolynomialRingElement with types libcrux_ml_kem_vector_portable_vector_type_PortableVector */ typedef struct libcrux_ml_kem_polynomial_PolynomialRingElement_f0_s { libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficients[16U]; } libcrux_ml_kem_polynomial_PolynomialRingElement_f0; /** This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.ZERO_89 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static inline libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_polynomial_ZERO_89_ea(void) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 lit; lit.coefficients[0U] = libcrux_ml_kem_vector_portable_ZERO_0d(); lit.coefficients[1U] = libcrux_ml_kem_vector_portable_ZERO_0d(); lit.coefficients[2U] = libcrux_ml_kem_vector_portable_ZERO_0d(); lit.coefficients[3U] = libcrux_ml_kem_vector_portable_ZERO_0d(); lit.coefficients[4U] = libcrux_ml_kem_vector_portable_ZERO_0d(); lit.coefficients[5U] = libcrux_ml_kem_vector_portable_ZERO_0d(); lit.coefficients[6U] = libcrux_ml_kem_vector_portable_ZERO_0d(); lit.coefficients[7U] = libcrux_ml_kem_vector_portable_ZERO_0d(); lit.coefficients[8U] = libcrux_ml_kem_vector_portable_ZERO_0d(); lit.coefficients[9U] = libcrux_ml_kem_vector_portable_ZERO_0d(); lit.coefficients[10U] = libcrux_ml_kem_vector_portable_ZERO_0d(); lit.coefficients[11U] = libcrux_ml_kem_vector_portable_ZERO_0d(); lit.coefficients[12U] = libcrux_ml_kem_vector_portable_ZERO_0d(); lit.coefficients[13U] = libcrux_ml_kem_vector_portable_ZERO_0d(); lit.coefficients[14U] = libcrux_ml_kem_vector_portable_ZERO_0d(); lit.coefficients[15U] = libcrux_ml_kem_vector_portable_ZERO_0d(); return lit; } /** A monomorphic instance of libcrux_ml_kem.ind_cpa.deserialize_secret_key.closure with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static inline libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_ind_cpa_deserialize_secret_key_closure_6b(size_t _) { return libcrux_ml_kem_polynomial_ZERO_89_ea(); } /** A monomorphic instance of libcrux_ml_kem.serialize.deserialize_to_uncompressed_ring_element with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_serialize_deserialize_to_uncompressed_ring_element_af( Eurydice_slice serialized) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 re = libcrux_ml_kem_polynomial_ZERO_89_ea(); for (size_t i = (size_t)0U; i < Eurydice_slice_len(serialized, uint8_t) / (size_t)24U; i++) { size_t i0 = i; Eurydice_slice bytes = Eurydice_slice_subslice2( serialized, i0 * (size_t)24U, i0 * (size_t)24U + (size_t)24U, uint8_t); libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_deserialize_12_0d(bytes); re.coefficients[i0] = uu____0; } return re; } /** Call [`deserialize_to_uncompressed_ring_element`] for each ring element. */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.deserialize_secret_key with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_deserialize_secret_key_24( Eurydice_slice secret_key, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 ret[3U]) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 secret_as_ntt[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { secret_as_ntt[i] = libcrux_ml_kem_polynomial_ZERO_89_ea(); } for (size_t i = (size_t)0U; i < Eurydice_slice_len(secret_key, uint8_t) / LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT; i++) { size_t i0 = i; Eurydice_slice secret_bytes = Eurydice_slice_subslice2( secret_key, i0 * LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT, i0 * LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT + LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT, uint8_t); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 uu____0 = libcrux_ml_kem_serialize_deserialize_to_uncompressed_ring_element_af( secret_bytes); secret_as_ntt[i0] = uu____0; } memcpy( ret, secret_as_ntt, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); } /** A monomorphic instance of libcrux_ml_kem.ind_cpa.unpacked.IndCpaPrivateKeyUnpacked with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - $3size_t */ typedef struct libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_f8_s { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 secret_as_ntt[3U]; } libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_f8; /** A monomorphic instance of libcrux_ml_kem.ind_cpa.deserialize_then_decompress_u.closure with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - CIPHERTEXT_SIZE= 1088 - U_COMPRESSION_FACTOR= 10 */ static inline libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_ind_cpa_deserialize_then_decompress_u_closure_7c(size_t _) { return libcrux_ml_kem_polynomial_ZERO_89_ea(); } /** A monomorphic instance of libcrux_ml_kem.vector.portable.compress.decompress_ciphertext_coefficient with const generics - COEFFICIENT_BITS= 10 */ static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_compress_decompress_ciphertext_coefficient_6b( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; int32_t decompressed = (int32_t)v.elements[i0] * (int32_t)LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS; decompressed = (decompressed << 1U) + ((int32_t)1 << (uint32_t)(int32_t)10); decompressed = decompressed >> (uint32_t)((int32_t)10 + (int32_t)1); v.elements[i0] = (int16_t)decompressed; } return v; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ /** A monomorphic instance of libcrux_ml_kem.vector.portable.decompress_ciphertext_coefficient_0d with const generics - COEFFICIENT_BITS= 10 */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_decompress_ciphertext_coefficient_0d_5a( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { return libcrux_ml_kem_vector_portable_compress_decompress_ciphertext_coefficient_6b( v); } /** A monomorphic instance of libcrux_ml_kem.serialize.deserialize_then_decompress_10 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_serialize_deserialize_then_decompress_10_2c( Eurydice_slice serialized) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 re = libcrux_ml_kem_polynomial_ZERO_89_ea(); for (size_t i = (size_t)0U; i < Eurydice_slice_len(serialized, uint8_t) / (size_t)20U; i++) { size_t i0 = i; Eurydice_slice bytes = Eurydice_slice_subslice2( serialized, i0 * (size_t)20U, i0 * (size_t)20U + (size_t)20U, uint8_t); libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient = libcrux_ml_kem_vector_portable_deserialize_10_0d(bytes); libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_decompress_ciphertext_coefficient_0d_5a( coefficient); re.coefficients[i0] = uu____0; } return re; } /** A monomorphic instance of libcrux_ml_kem.vector.portable.compress.decompress_ciphertext_coefficient with const generics - COEFFICIENT_BITS= 11 */ static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_compress_decompress_ciphertext_coefficient_6b0( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; int32_t decompressed = (int32_t)v.elements[i0] * (int32_t)LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS; decompressed = (decompressed << 1U) + ((int32_t)1 << (uint32_t)(int32_t)11); decompressed = decompressed >> (uint32_t)((int32_t)11 + (int32_t)1); v.elements[i0] = (int16_t)decompressed; } return v; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ /** A monomorphic instance of libcrux_ml_kem.vector.portable.decompress_ciphertext_coefficient_0d with const generics - COEFFICIENT_BITS= 11 */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_decompress_ciphertext_coefficient_0d_5a0( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { return libcrux_ml_kem_vector_portable_compress_decompress_ciphertext_coefficient_6b0( v); } /** A monomorphic instance of libcrux_ml_kem.serialize.deserialize_then_decompress_11 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_serialize_deserialize_then_decompress_11_8d( Eurydice_slice serialized) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 re = libcrux_ml_kem_polynomial_ZERO_89_ea(); for (size_t i = (size_t)0U; i < Eurydice_slice_len(serialized, uint8_t) / (size_t)22U; i++) { size_t i0 = i; Eurydice_slice bytes = Eurydice_slice_subslice2( serialized, i0 * (size_t)22U, i0 * (size_t)22U + (size_t)22U, uint8_t); libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient = libcrux_ml_kem_vector_portable_deserialize_11_0d(bytes); libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_decompress_ciphertext_coefficient_0d_5a0( coefficient); re.coefficients[i0] = uu____0; } return re; } /** A monomorphic instance of libcrux_ml_kem.serialize.deserialize_then_decompress_ring_element_u with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - COMPRESSION_FACTOR= 10 */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_serialize_deserialize_then_decompress_ring_element_u_34( Eurydice_slice serialized) { return libcrux_ml_kem_serialize_deserialize_then_decompress_10_2c(serialized); } typedef struct libcrux_ml_kem_vector_portable_vector_type_PortableVector_x2_s { libcrux_ml_kem_vector_portable_vector_type_PortableVector fst; libcrux_ml_kem_vector_portable_vector_type_PortableVector snd; } libcrux_ml_kem_vector_portable_vector_type_PortableVector_x2; /** A monomorphic instance of libcrux_ml_kem.vector.traits.montgomery_multiply_fe with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_traits_montgomery_multiply_fe_67( libcrux_ml_kem_vector_portable_vector_type_PortableVector v, int16_t fer) { return libcrux_ml_kem_vector_portable_montgomery_multiply_by_constant_0d(v, fer); } /** A monomorphic instance of libcrux_ml_kem.ntt.ntt_layer_int_vec_step with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector_x2 libcrux_ml_kem_ntt_ntt_layer_int_vec_step_0c( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, libcrux_ml_kem_vector_portable_vector_type_PortableVector b, int16_t zeta_r) { libcrux_ml_kem_vector_portable_vector_type_PortableVector t = libcrux_ml_kem_vector_traits_montgomery_multiply_fe_67(b, zeta_r); b = libcrux_ml_kem_vector_portable_sub_0d(a, &t); a = libcrux_ml_kem_vector_portable_add_0d(a, &t); return ( CLITERAL(libcrux_ml_kem_vector_portable_vector_type_PortableVector_x2){ .fst = a, .snd = b}); } /** A monomorphic instance of libcrux_ml_kem.ntt.ntt_at_layer_4_plus with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_ntt_ntt_at_layer_4_plus_51( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *re, size_t layer, size_t _initial_coefficient_bound) { size_t step = (size_t)1U << (uint32_t)layer; for (size_t i0 = (size_t)0U; i0 < (size_t)128U >> (uint32_t)layer; i0++) { size_t round = i0; zeta_i[0U] = zeta_i[0U] + (size_t)1U; size_t offset = round * step * (size_t)2U; size_t offset_vec = offset / (size_t)16U; size_t step_vec = step / (size_t)16U; for (size_t i = offset_vec; i < offset_vec + step_vec; i++) { size_t j = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector_x2 uu____0 = libcrux_ml_kem_ntt_ntt_layer_int_vec_step_0c( re->coefficients[j], re->coefficients[j + step_vec], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[zeta_i[0U]]); libcrux_ml_kem_vector_portable_vector_type_PortableVector x = uu____0.fst; libcrux_ml_kem_vector_portable_vector_type_PortableVector y = uu____0.snd; re->coefficients[j] = x; re->coefficients[j + step_vec] = y; } } } /** A monomorphic instance of libcrux_ml_kem.ntt.ntt_at_layer_3 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_ntt_ntt_at_layer_3_fd( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *re, size_t _layer, size_t _initial_coefficient_bound) { for (size_t i = (size_t)0U; i < (size_t)16U; i++) { size_t round = i; zeta_i[0U] = zeta_i[0U] + (size_t)1U; libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_ntt_layer_3_step_0d( re->coefficients[round], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[zeta_i[0U]]); re->coefficients[round] = uu____0; } } /** A monomorphic instance of libcrux_ml_kem.ntt.ntt_at_layer_2 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_ntt_ntt_at_layer_2_ad( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *re, size_t _layer, size_t _initial_coefficient_bound) { for (size_t i = (size_t)0U; i < (size_t)16U; i++) { size_t round = i; zeta_i[0U] = zeta_i[0U] + (size_t)1U; re->coefficients[round] = libcrux_ml_kem_vector_portable_ntt_layer_2_step_0d( re->coefficients[round], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[zeta_i[0U]], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[zeta_i[0U] + (size_t)1U]); zeta_i[0U] = zeta_i[0U] + (size_t)1U; } } /** A monomorphic instance of libcrux_ml_kem.ntt.ntt_at_layer_1 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_ntt_ntt_at_layer_1_a2( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *re, size_t _layer, size_t _initial_coefficient_bound) { for (size_t i = (size_t)0U; i < (size_t)16U; i++) { size_t round = i; zeta_i[0U] = zeta_i[0U] + (size_t)1U; re->coefficients[round] = libcrux_ml_kem_vector_portable_ntt_layer_1_step_0d( re->coefficients[round], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[zeta_i[0U]], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[zeta_i[0U] + (size_t)1U], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[zeta_i[0U] + (size_t)2U], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[zeta_i[0U] + (size_t)3U]); zeta_i[0U] = zeta_i[0U] + (size_t)3U; } } /** This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.poly_barrett_reduce_89 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_polynomial_poly_barrett_reduce_89_8b( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *self) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT; i++) { size_t i0 = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_barrett_reduce_0d( self->coefficients[i0]); self->coefficients[i0] = uu____0; } } /** A monomorphic instance of libcrux_ml_kem.ntt.ntt_vector_u with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - VECTOR_U_COMPRESSION_FACTOR= 10 */ static KRML_MUSTINLINE void libcrux_ml_kem_ntt_ntt_vector_u_9f( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *re) { size_t zeta_i = (size_t)0U; libcrux_ml_kem_ntt_ntt_at_layer_4_plus_51(&zeta_i, re, (size_t)7U, (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_4_plus_51(&zeta_i, re, (size_t)6U, (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_4_plus_51(&zeta_i, re, (size_t)5U, (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_4_plus_51(&zeta_i, re, (size_t)4U, (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_3_fd(&zeta_i, re, (size_t)3U, (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_2_ad(&zeta_i, re, (size_t)2U, (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_1_a2(&zeta_i, re, (size_t)1U, (size_t)3328U); libcrux_ml_kem_polynomial_poly_barrett_reduce_89_8b(re); } /** Call [`deserialize_then_decompress_ring_element_u`] on each ring element in the `ciphertext`. */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.deserialize_then_decompress_u with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - CIPHERTEXT_SIZE= 1088 - U_COMPRESSION_FACTOR= 10 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_deserialize_then_decompress_u_f4( uint8_t *ciphertext, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 ret[3U]) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 u_as_ntt[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { u_as_ntt[i] = libcrux_ml_kem_polynomial_ZERO_89_ea(); } for (size_t i = (size_t)0U; i < Eurydice_slice_len( Eurydice_array_to_slice((size_t)1088U, ciphertext, uint8_t), uint8_t) / (LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT * (size_t)10U / (size_t)8U); i++) { size_t i0 = i; Eurydice_slice u_bytes = Eurydice_array_to_subslice2( ciphertext, i0 * (LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT * (size_t)10U / (size_t)8U), i0 * (LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT * (size_t)10U / (size_t)8U) + LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT * (size_t)10U / (size_t)8U, uint8_t); u_as_ntt[i0] = libcrux_ml_kem_serialize_deserialize_then_decompress_ring_element_u_34( u_bytes); libcrux_ml_kem_ntt_ntt_vector_u_9f(&u_as_ntt[i0]); } memcpy( ret, u_as_ntt, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); } /** A monomorphic instance of libcrux_ml_kem.vector.portable.compress.decompress_ciphertext_coefficient with const generics - COEFFICIENT_BITS= 4 */ static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_compress_decompress_ciphertext_coefficient_6b1( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; int32_t decompressed = (int32_t)v.elements[i0] * (int32_t)LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS; decompressed = (decompressed << 1U) + ((int32_t)1 << (uint32_t)(int32_t)4); decompressed = decompressed >> (uint32_t)((int32_t)4 + (int32_t)1); v.elements[i0] = (int16_t)decompressed; } return v; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ /** A monomorphic instance of libcrux_ml_kem.vector.portable.decompress_ciphertext_coefficient_0d with const generics - COEFFICIENT_BITS= 4 */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_decompress_ciphertext_coefficient_0d_5a1( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { return libcrux_ml_kem_vector_portable_compress_decompress_ciphertext_coefficient_6b1( v); } /** A monomorphic instance of libcrux_ml_kem.serialize.deserialize_then_decompress_4 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_serialize_deserialize_then_decompress_4_41( Eurydice_slice serialized) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 re = libcrux_ml_kem_polynomial_ZERO_89_ea(); for (size_t i = (size_t)0U; i < Eurydice_slice_len(serialized, uint8_t) / (size_t)8U; i++) { size_t i0 = i; Eurydice_slice bytes = Eurydice_slice_subslice2( serialized, i0 * (size_t)8U, i0 * (size_t)8U + (size_t)8U, uint8_t); libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient = libcrux_ml_kem_vector_portable_deserialize_4_0d(bytes); libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_decompress_ciphertext_coefficient_0d_5a1( coefficient); re.coefficients[i0] = uu____0; } return re; } /** A monomorphic instance of libcrux_ml_kem.vector.portable.compress.decompress_ciphertext_coefficient with const generics - COEFFICIENT_BITS= 5 */ static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_compress_decompress_ciphertext_coefficient_6b2( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; int32_t decompressed = (int32_t)v.elements[i0] * (int32_t)LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS; decompressed = (decompressed << 1U) + ((int32_t)1 << (uint32_t)(int32_t)5); decompressed = decompressed >> (uint32_t)((int32_t)5 + (int32_t)1); v.elements[i0] = (int16_t)decompressed; } return v; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ /** A monomorphic instance of libcrux_ml_kem.vector.portable.decompress_ciphertext_coefficient_0d with const generics - COEFFICIENT_BITS= 5 */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_decompress_ciphertext_coefficient_0d_5a2( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { return libcrux_ml_kem_vector_portable_compress_decompress_ciphertext_coefficient_6b2( v); } /** A monomorphic instance of libcrux_ml_kem.serialize.deserialize_then_decompress_5 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_serialize_deserialize_then_decompress_5_4e( Eurydice_slice serialized) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 re = libcrux_ml_kem_polynomial_ZERO_89_ea(); for (size_t i = (size_t)0U; i < Eurydice_slice_len(serialized, uint8_t) / (size_t)10U; i++) { size_t i0 = i; Eurydice_slice bytes = Eurydice_slice_subslice2( serialized, i0 * (size_t)10U, i0 * (size_t)10U + (size_t)10U, uint8_t); re.coefficients[i0] = libcrux_ml_kem_vector_portable_deserialize_5_0d(bytes); libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____1 = libcrux_ml_kem_vector_portable_decompress_ciphertext_coefficient_0d_5a2( re.coefficients[i0]); re.coefficients[i0] = uu____1; } return re; } /** A monomorphic instance of libcrux_ml_kem.serialize.deserialize_then_decompress_ring_element_v with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - COMPRESSION_FACTOR= 4 */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_serialize_deserialize_then_decompress_ring_element_v_56( Eurydice_slice serialized) { return libcrux_ml_kem_serialize_deserialize_then_decompress_4_41(serialized); } /** Given two `KyberPolynomialRingElement`s in their NTT representations, compute their product. Given two polynomials in the NTT domain `f^` and `ĵ`, the `iᵗʰ` coefficient of the product `k̂` is determined by the calculation: ```plaintext ĥ[2·i] + ĥ[2·i + 1]X = (f^[2·i] + f^[2·i + 1]X)·(ĝ[2·i] + ĝ[2·i + 1]X) mod (X² - ζ^(2·BitRev₇(i) + 1)) ``` This function almost implements Algorithm 10 of the NIST FIPS 203 standard, which is reproduced below: ```plaintext Input: Two arrays fˆ ∈ ℤ₂₅₆ and ĝ ∈ ℤ₂₅₆. Output: An array ĥ ∈ ℤq. for(i ← 0; i < 128; i++) (ĥ[2i], ĥ[2i+1]) ← BaseCaseMultiply(fˆ[2i], fˆ[2i+1], ĝ[2i], ĝ[2i+1], ζ^(2·BitRev₇(i) + 1)) end for return ĥ ``` We say "almost" because the coefficients of the ring element output by this function are in the Montgomery domain. The NIST FIPS 203 standard can be found at . */ /** This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.ntt_multiply_89 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_polynomial_ntt_multiply_89_2a( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *self, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *rhs) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 out = libcrux_ml_kem_polynomial_ZERO_89_ea(); for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT; i++) { size_t i0 = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_ntt_multiply_0d( &self->coefficients[i0], &rhs->coefficients[i0], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[(size_t)64U + (size_t)4U * i0], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[(size_t)64U + (size_t)4U * i0 + (size_t)1U], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[(size_t)64U + (size_t)4U * i0 + (size_t)2U], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[(size_t)64U + (size_t)4U * i0 + (size_t)3U]); out.coefficients[i0] = uu____0; } return out; } /** Given two polynomial ring elements `lhs` and `rhs`, compute the pointwise sum of their constituent coefficients. */ /** This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.add_to_ring_element_89 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_polynomial_add_to_ring_element_89_84( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *self, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *rhs) { for (size_t i = (size_t)0U; i < Eurydice_slice_len( Eurydice_array_to_slice( (size_t)16U, self->coefficients, libcrux_ml_kem_vector_portable_vector_type_PortableVector), libcrux_ml_kem_vector_portable_vector_type_PortableVector); i++) { size_t i0 = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_add_0d(self->coefficients[i0], &rhs->coefficients[i0]); self->coefficients[i0] = uu____0; } } /** A monomorphic instance of libcrux_ml_kem.invert_ntt.invert_ntt_at_layer_1 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_1_83( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *re, size_t _layer) { for (size_t i = (size_t)0U; i < (size_t)16U; i++) { size_t round = i; zeta_i[0U] = zeta_i[0U] - (size_t)1U; re->coefficients[round] = libcrux_ml_kem_vector_portable_inv_ntt_layer_1_step_0d( re->coefficients[round], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[zeta_i[0U]], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[zeta_i[0U] - (size_t)1U], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[zeta_i[0U] - (size_t)2U], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[zeta_i[0U] - (size_t)3U]); zeta_i[0U] = zeta_i[0U] - (size_t)3U; } } /** A monomorphic instance of libcrux_ml_kem.invert_ntt.invert_ntt_at_layer_2 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_2_c3( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *re, size_t _layer) { for (size_t i = (size_t)0U; i < (size_t)16U; i++) { size_t round = i; zeta_i[0U] = zeta_i[0U] - (size_t)1U; re->coefficients[round] = libcrux_ml_kem_vector_portable_inv_ntt_layer_2_step_0d( re->coefficients[round], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[zeta_i[0U]], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[zeta_i[0U] - (size_t)1U]); zeta_i[0U] = zeta_i[0U] - (size_t)1U; } } /** A monomorphic instance of libcrux_ml_kem.invert_ntt.invert_ntt_at_layer_3 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_3_68( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *re, size_t _layer) { for (size_t i = (size_t)0U; i < (size_t)16U; i++) { size_t round = i; zeta_i[0U] = zeta_i[0U] - (size_t)1U; libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_inv_ntt_layer_3_step_0d( re->coefficients[round], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[zeta_i[0U]]); re->coefficients[round] = uu____0; } } /** A monomorphic instance of libcrux_ml_kem.invert_ntt.inv_ntt_layer_int_vec_step_reduce with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector_x2 libcrux_ml_kem_invert_ntt_inv_ntt_layer_int_vec_step_reduce_65( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, libcrux_ml_kem_vector_portable_vector_type_PortableVector b, int16_t zeta_r) { libcrux_ml_kem_vector_portable_vector_type_PortableVector a_minus_b = libcrux_ml_kem_vector_portable_sub_0d(b, &a); a = libcrux_ml_kem_vector_portable_barrett_reduce_0d( libcrux_ml_kem_vector_portable_add_0d(a, &b)); b = libcrux_ml_kem_vector_traits_montgomery_multiply_fe_67(a_minus_b, zeta_r); return ( CLITERAL(libcrux_ml_kem_vector_portable_vector_type_PortableVector_x2){ .fst = a, .snd = b}); } /** A monomorphic instance of libcrux_ml_kem.invert_ntt.invert_ntt_at_layer_4_plus with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_4_plus_6e( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *re, size_t layer) { size_t step = (size_t)1U << (uint32_t)layer; for (size_t i0 = (size_t)0U; i0 < (size_t)128U >> (uint32_t)layer; i0++) { size_t round = i0; zeta_i[0U] = zeta_i[0U] - (size_t)1U; size_t offset = round * step * (size_t)2U; size_t offset_vec = offset / LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; size_t step_vec = step / LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; for (size_t i = offset_vec; i < offset_vec + step_vec; i++) { size_t j = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector_x2 uu____0 = libcrux_ml_kem_invert_ntt_inv_ntt_layer_int_vec_step_reduce_65( re->coefficients[j], re->coefficients[j + step_vec], libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[zeta_i[0U]]); libcrux_ml_kem_vector_portable_vector_type_PortableVector x = uu____0.fst; libcrux_ml_kem_vector_portable_vector_type_PortableVector y = uu____0.snd; re->coefficients[j] = x; re->coefficients[j + step_vec] = y; } } } /** A monomorphic instance of libcrux_ml_kem.invert_ntt.invert_ntt_montgomery with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_invert_ntt_invert_ntt_montgomery_f6( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *re) { size_t zeta_i = LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT / (size_t)2U; libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_1_83(&zeta_i, re, (size_t)1U); libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_2_c3(&zeta_i, re, (size_t)2U); libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_3_68(&zeta_i, re, (size_t)3U); libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_4_plus_6e(&zeta_i, re, (size_t)4U); libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_4_plus_6e(&zeta_i, re, (size_t)5U); libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_4_plus_6e(&zeta_i, re, (size_t)6U); libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_4_plus_6e(&zeta_i, re, (size_t)7U); libcrux_ml_kem_polynomial_poly_barrett_reduce_89_8b(re); } /** This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.subtract_reduce_89 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_polynomial_subtract_reduce_89_d4( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *self, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 b) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT; i++) { size_t i0 = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient_normal_form = libcrux_ml_kem_vector_portable_montgomery_multiply_by_constant_0d( b.coefficients[i0], (int16_t)1441); libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_barrett_reduce_0d( libcrux_ml_kem_vector_portable_sub_0d(self->coefficients[i0], &coefficient_normal_form)); b.coefficients[i0] = uu____0; } return b; } /** The following functions compute various expressions involving vectors and matrices. The computation of these expressions has been abstracted away into these functions in order to save on loop iterations. Compute v − InverseNTT(sᵀ ◦ NTT(u)) */ /** A monomorphic instance of libcrux_ml_kem.matrix.compute_message with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_matrix_compute_message_b3( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *v, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *secret_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *u_as_ntt) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 result = libcrux_ml_kem_polynomial_ZERO_89_ea(); for (size_t i = (size_t)0U; i < (size_t)3U; i++) { size_t i0 = i; libcrux_ml_kem_polynomial_PolynomialRingElement_f0 product = libcrux_ml_kem_polynomial_ntt_multiply_89_2a(&secret_as_ntt[i0], &u_as_ntt[i0]); libcrux_ml_kem_polynomial_add_to_ring_element_89_84(&result, &product); } libcrux_ml_kem_invert_ntt_invert_ntt_montgomery_f6(&result); result = libcrux_ml_kem_polynomial_subtract_reduce_89_d4(v, result); return result; } /** A monomorphic instance of libcrux_ml_kem.vector.portable.arithmetic.shift_right with const generics - SHIFT_BY= 15 */ static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_arithmetic_shift_right_94( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; v.elements[i0] = v.elements[i0] >> (uint32_t)(int32_t)15; } return v; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ /** A monomorphic instance of libcrux_ml_kem.vector.portable.shift_right_0d with const generics - SHIFT_BY= 15 */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_shift_right_0d_19( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { return libcrux_ml_kem_vector_portable_arithmetic_shift_right_94(v); } /** A monomorphic instance of libcrux_ml_kem.vector.traits.to_unsigned_representative with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_traits_to_unsigned_representative_db( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { libcrux_ml_kem_vector_portable_vector_type_PortableVector t = libcrux_ml_kem_vector_portable_shift_right_0d_19(a); libcrux_ml_kem_vector_portable_vector_type_PortableVector fm = libcrux_ml_kem_vector_portable_bitwise_and_with_constant_0d( t, LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS); return libcrux_ml_kem_vector_portable_add_0d(a, &fm); } /** A monomorphic instance of libcrux_ml_kem.serialize.compress_then_serialize_message with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_serialize_compress_then_serialize_message_aa( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 re, uint8_t ret[32U]) { uint8_t serialized[32U] = {0U}; for (size_t i = (size_t)0U; i < (size_t)16U; i++) { size_t i0 = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient = libcrux_ml_kem_vector_traits_to_unsigned_representative_db( re.coefficients[i0]); libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient_compressed = libcrux_ml_kem_vector_portable_compress_1_0d(coefficient); uint8_t bytes[2U]; libcrux_ml_kem_vector_portable_serialize_1_0d(coefficient_compressed, bytes); Eurydice_slice uu____0 = Eurydice_array_to_subslice2( serialized, (size_t)2U * i0, (size_t)2U * i0 + (size_t)2U, uint8_t); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)2U, bytes, uint8_t), uint8_t); } memcpy(ret, serialized, (size_t)32U * sizeof(uint8_t)); } /** This function implements Algorithm 14 of the NIST FIPS 203 specification; this is the Kyber CPA-PKE decryption algorithm. Algorithm 14 is reproduced below: ```plaintext Input: decryption key dkₚₖₑ ∈ 𝔹^{384k}. Input: ciphertext c ∈ 𝔹^{32(dᵤk + dᵥ)}. Output: message m ∈ 𝔹^{32}. c₁ ← c[0 : 32dᵤk] c₂ ← c[32dᵤk : 32(dᵤk + dᵥ)] u ← Decompress_{dᵤ}(ByteDecode_{dᵤ}(c₁)) v ← Decompress_{dᵥ}(ByteDecode_{dᵥ}(c₂)) ŝ ← ByteDecode₁₂(dkₚₖₑ) w ← v - NTT-¹(ŝᵀ ◦ NTT(u)) m ← ByteEncode₁(Compress₁(w)) return m ``` The NIST FIPS 203 standard can be found at . */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.decrypt_unpacked with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - CIPHERTEXT_SIZE= 1088 - VECTOR_U_ENCODED_SIZE= 960 - U_COMPRESSION_FACTOR= 10 - V_COMPRESSION_FACTOR= 4 */ static inline void libcrux_ml_kem_ind_cpa_decrypt_unpacked_6d( libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_f8 *secret_key, uint8_t *ciphertext, uint8_t ret[32U]) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 u_as_ntt[3U]; libcrux_ml_kem_ind_cpa_deserialize_then_decompress_u_f4(ciphertext, u_as_ntt); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 v = libcrux_ml_kem_serialize_deserialize_then_decompress_ring_element_v_56( Eurydice_array_to_subslice_from((size_t)1088U, ciphertext, (size_t)960U, uint8_t, size_t)); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 message = libcrux_ml_kem_matrix_compute_message_b3(&v, secret_key->secret_as_ntt, u_as_ntt); uint8_t ret0[32U]; libcrux_ml_kem_serialize_compress_then_serialize_message_aa(message, ret0); memcpy(ret, ret0, (size_t)32U * sizeof(uint8_t)); } /** A monomorphic instance of libcrux_ml_kem.ind_cpa.decrypt with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - CIPHERTEXT_SIZE= 1088 - VECTOR_U_ENCODED_SIZE= 960 - U_COMPRESSION_FACTOR= 10 - V_COMPRESSION_FACTOR= 4 */ static inline void libcrux_ml_kem_ind_cpa_decrypt_43(Eurydice_slice secret_key, uint8_t *ciphertext, uint8_t ret[32U]) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 secret_as_ntt[3U]; libcrux_ml_kem_ind_cpa_deserialize_secret_key_24(secret_key, secret_as_ntt); /* Passing arrays by value in Rust generates a copy in C */ libcrux_ml_kem_polynomial_PolynomialRingElement_f0 copy_of_secret_as_ntt[3U]; memcpy( copy_of_secret_as_ntt, secret_as_ntt, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_f8 secret_key_unpacked; memcpy( secret_key_unpacked.secret_as_ntt, copy_of_secret_as_ntt, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); uint8_t ret0[32U]; libcrux_ml_kem_ind_cpa_decrypt_unpacked_6d(&secret_key_unpacked, ciphertext, ret0); memcpy(ret, ret0, (size_t)32U * sizeof(uint8_t)); } /** This function found in impl {(libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash)} */ /** A monomorphic instance of libcrux_ml_kem.hash_functions.portable.G_f1 with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_hash_functions_portable_G_f1_e4( Eurydice_slice input, uint8_t ret[64U]) { libcrux_ml_kem_hash_functions_portable_G(input, ret); } /** A monomorphic instance of libcrux_ml_kem.hash_functions.portable.PRF with const generics - LEN= 32 */ static KRML_MUSTINLINE void libcrux_ml_kem_hash_functions_portable_PRF_2b( Eurydice_slice input, uint8_t ret[32U]) { uint8_t digest[32U] = {0U}; libcrux_sha3_portable_shake256( Eurydice_array_to_slice((size_t)32U, digest, uint8_t), input); memcpy(ret, digest, (size_t)32U * sizeof(uint8_t)); } /** This function found in impl {(libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash)} */ /** A monomorphic instance of libcrux_ml_kem.hash_functions.portable.PRF_f1 with const generics - K= 3 - LEN= 32 */ static KRML_MUSTINLINE void libcrux_ml_kem_hash_functions_portable_PRF_f1_ee( Eurydice_slice input, uint8_t ret[32U]) { libcrux_ml_kem_hash_functions_portable_PRF_2b(input, ret); } /** A monomorphic instance of libcrux_ml_kem.serialize.deserialize_ring_elements_reduced.closure with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - PUBLIC_KEY_SIZE= 1152 - K= 3 */ static inline libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_closure_cd( size_t _i) { return libcrux_ml_kem_polynomial_ZERO_89_ea(); } /** Only use with public values. This MUST NOT be used with secret inputs, like its caller `deserialize_ring_elements_reduced`. */ /** A monomorphic instance of libcrux_ml_kem.serialize.deserialize_to_reduced_ring_element with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_serialize_deserialize_to_reduced_ring_element_4c( Eurydice_slice serialized) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 re = libcrux_ml_kem_polynomial_ZERO_89_ea(); for (size_t i = (size_t)0U; i < Eurydice_slice_len(serialized, uint8_t) / (size_t)24U; i++) { size_t i0 = i; Eurydice_slice bytes = Eurydice_slice_subslice2( serialized, i0 * (size_t)24U, i0 * (size_t)24U + (size_t)24U, uint8_t); libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient = libcrux_ml_kem_vector_portable_deserialize_12_0d(bytes); libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_cond_subtract_3329_0d(coefficient); re.coefficients[i0] = uu____0; } return re; } /** This function deserializes ring elements and reduces the result by the field modulus. This function MUST NOT be used on secret inputs. */ /** A monomorphic instance of libcrux_ml_kem.serialize.deserialize_ring_elements_reduced with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - PUBLIC_KEY_SIZE= 1152 - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_33( Eurydice_slice public_key, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 ret[3U]) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 deserialized_pk[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { deserialized_pk[i] = libcrux_ml_kem_polynomial_ZERO_89_ea(); } for (size_t i = (size_t)0U; i < Eurydice_slice_len(public_key, uint8_t) / LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT; i++) { size_t i0 = i; Eurydice_slice ring_element = Eurydice_slice_subslice2( public_key, i0 * LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT, i0 * LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT + LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT, uint8_t); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 uu____0 = libcrux_ml_kem_serialize_deserialize_to_reduced_ring_element_4c( ring_element); deserialized_pk[i0] = uu____0; } memcpy( ret, deserialized_pk, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); } /** A monomorphic instance of libcrux_ml_kem.matrix.sample_matrix_A.closure.closure with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 */ static inline libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_matrix_sample_matrix_A_closure_closure_78(size_t _j) { return libcrux_ml_kem_polynomial_ZERO_89_ea(); } /** A monomorphic instance of libcrux_ml_kem.matrix.sample_matrix_A.closure with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 */ static inline void libcrux_ml_kem_matrix_sample_matrix_A_closure_4b( size_t _i, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 ret[3U]) { for (size_t i = (size_t)0U; i < (size_t)3U; i++) { ret[i] = libcrux_ml_kem_polynomial_ZERO_89_ea(); } } /** A monomorphic instance of libcrux_ml_kem.hash_functions.portable.PortableHash with const generics - $3size_t */ typedef struct libcrux_ml_kem_hash_functions_portable_PortableHash_58_s { libcrux_sha3_generic_keccak_KeccakState_48 shake128_state[3U]; } libcrux_ml_kem_hash_functions_portable_PortableHash_58; /** A monomorphic instance of libcrux_ml_kem.hash_functions.portable.shake128_init_absorb with const generics - K= 3 */ static KRML_MUSTINLINE libcrux_ml_kem_hash_functions_portable_PortableHash_58 libcrux_ml_kem_hash_functions_portable_shake128_init_absorb_b7( uint8_t input[3U][34U]) { libcrux_sha3_generic_keccak_KeccakState_48 shake128_state[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { shake128_state[i] = libcrux_sha3_portable_incremental_shake128_init(); } for (size_t i = (size_t)0U; i < (size_t)3U; i++) { size_t i0 = i; libcrux_sha3_portable_incremental_shake128_absorb_final( &shake128_state[i0], Eurydice_array_to_slice((size_t)34U, input[i0], uint8_t)); } /* Passing arrays by value in Rust generates a copy in C */ libcrux_sha3_generic_keccak_KeccakState_48 copy_of_shake128_state[3U]; memcpy(copy_of_shake128_state, shake128_state, (size_t)3U * sizeof(libcrux_sha3_generic_keccak_KeccakState_48)); libcrux_ml_kem_hash_functions_portable_PortableHash_58 lit; memcpy(lit.shake128_state, copy_of_shake128_state, (size_t)3U * sizeof(libcrux_sha3_generic_keccak_KeccakState_48)); return lit; } /** This function found in impl {(libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash)} */ /** A monomorphic instance of libcrux_ml_kem.hash_functions.portable.shake128_init_absorb_f1 with const generics - K= 3 */ static KRML_MUSTINLINE libcrux_ml_kem_hash_functions_portable_PortableHash_58 libcrux_ml_kem_hash_functions_portable_shake128_init_absorb_f1_8c( uint8_t input[3U][34U]) { /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_input[3U][34U]; memcpy(copy_of_input, input, (size_t)3U * sizeof(uint8_t[34U])); return libcrux_ml_kem_hash_functions_portable_shake128_init_absorb_b7( copy_of_input); } /** A monomorphic instance of libcrux_ml_kem.hash_functions.portable.shake128_squeeze_three_blocks with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_hash_functions_portable_shake128_squeeze_three_blocks_ca( libcrux_ml_kem_hash_functions_portable_PortableHash_58 *st, uint8_t ret[3U][504U]) { uint8_t out[3U][504U] = {{0U}}; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { size_t i0 = i; libcrux_sha3_portable_incremental_shake128_squeeze_first_three_blocks( &st->shake128_state[i0], Eurydice_array_to_slice((size_t)504U, out[i0], uint8_t)); } memcpy(ret, out, (size_t)3U * sizeof(uint8_t[504U])); } /** This function found in impl {(libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash)} */ /** A monomorphic instance of libcrux_ml_kem.hash_functions.portable.shake128_squeeze_three_blocks_f1 with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_hash_functions_portable_shake128_squeeze_three_blocks_f1_69( libcrux_ml_kem_hash_functions_portable_PortableHash_58 *self, uint8_t ret[3U][504U]) { libcrux_ml_kem_hash_functions_portable_shake128_squeeze_three_blocks_ca(self, ret); } /** If `bytes` contains a set of uniformly random bytes, this function uniformly samples a ring element `â` that is treated as being the NTT representation of the corresponding polynomial `a`. Since rejection sampling is used, it is possible the supplied bytes are not enough to sample the element, in which case an `Err` is returned and the caller must try again with a fresh set of bytes. This function partially implements Algorithm 6 of the NIST FIPS 203 standard, We say "partially" because this implementation only accepts a finite set of bytes as input and returns an error if the set is not enough; Algorithm 6 of the FIPS 203 standard on the other hand samples from an infinite stream of bytes until the ring element is filled. Algorithm 6 is reproduced below: ```plaintext Input: byte stream B ∈ 𝔹*. Output: array â ∈ ℤ₂₅₆. i ← 0 j ← 0 while j < 256 do d₁ ← B[i] + 256·(B[i+1] mod 16) d₂ ← ⌊B[i+1]/16⌋ + 16·B[i+2] if d₁ < q then â[j] ← d₁ j ← j + 1 end if if d₂ < q and j < 256 then â[j] ← d₂ j ← j + 1 end if i ← i + 3 end while return â ``` The NIST FIPS 203 standard can be found at . */ /** A monomorphic instance of libcrux_ml_kem.sampling.sample_from_uniform_distribution_next with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - N= 504 */ static KRML_MUSTINLINE bool libcrux_ml_kem_sampling_sample_from_uniform_distribution_next_db( uint8_t randomness[3U][504U], size_t *sampled_coefficients, int16_t (*out)[272U]) { for (size_t i0 = (size_t)0U; i0 < (size_t)3U; i0++) { size_t i1 = i0; for (size_t i = (size_t)0U; i < (size_t)504U / (size_t)24U; i++) { size_t r = i; if (sampled_coefficients[i1] < LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT) { Eurydice_slice uu____0 = Eurydice_array_to_subslice2(randomness[i1], r * (size_t)24U, r * (size_t)24U + (size_t)24U, uint8_t); size_t sampled = libcrux_ml_kem_vector_portable_rej_sample_0d( uu____0, Eurydice_array_to_subslice2( out[i1], sampled_coefficients[i1], sampled_coefficients[i1] + (size_t)16U, int16_t)); size_t uu____1 = i1; sampled_coefficients[uu____1] = sampled_coefficients[uu____1] + sampled; } } } bool done = true; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { size_t i0 = i; if (sampled_coefficients[i0] >= LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT) { sampled_coefficients[i0] = LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT; } else { done = false; } } return done; } /** A monomorphic instance of libcrux_ml_kem.hash_functions.portable.shake128_squeeze_block with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_hash_functions_portable_shake128_squeeze_block_dd( libcrux_ml_kem_hash_functions_portable_PortableHash_58 *st, uint8_t ret[3U][168U]) { uint8_t out[3U][168U] = {{0U}}; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { size_t i0 = i; libcrux_sha3_portable_incremental_shake128_squeeze_next_block( &st->shake128_state[i0], Eurydice_array_to_slice((size_t)168U, out[i0], uint8_t)); } memcpy(ret, out, (size_t)3U * sizeof(uint8_t[168U])); } /** This function found in impl {(libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash)} */ /** A monomorphic instance of libcrux_ml_kem.hash_functions.portable.shake128_squeeze_block_f1 with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_hash_functions_portable_shake128_squeeze_block_f1_60( libcrux_ml_kem_hash_functions_portable_PortableHash_58 *self, uint8_t ret[3U][168U]) { libcrux_ml_kem_hash_functions_portable_shake128_squeeze_block_dd(self, ret); } /** If `bytes` contains a set of uniformly random bytes, this function uniformly samples a ring element `â` that is treated as being the NTT representation of the corresponding polynomial `a`. Since rejection sampling is used, it is possible the supplied bytes are not enough to sample the element, in which case an `Err` is returned and the caller must try again with a fresh set of bytes. This function partially implements Algorithm 6 of the NIST FIPS 203 standard, We say "partially" because this implementation only accepts a finite set of bytes as input and returns an error if the set is not enough; Algorithm 6 of the FIPS 203 standard on the other hand samples from an infinite stream of bytes until the ring element is filled. Algorithm 6 is reproduced below: ```plaintext Input: byte stream B ∈ 𝔹*. Output: array â ∈ ℤ₂₅₆. i ← 0 j ← 0 while j < 256 do d₁ ← B[i] + 256·(B[i+1] mod 16) d₂ ← ⌊B[i+1]/16⌋ + 16·B[i+2] if d₁ < q then â[j] ← d₁ j ← j + 1 end if if d₂ < q and j < 256 then â[j] ← d₂ j ← j + 1 end if i ← i + 3 end while return â ``` The NIST FIPS 203 standard can be found at . */ /** A monomorphic instance of libcrux_ml_kem.sampling.sample_from_uniform_distribution_next with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - N= 168 */ static KRML_MUSTINLINE bool libcrux_ml_kem_sampling_sample_from_uniform_distribution_next_db0( uint8_t randomness[3U][168U], size_t *sampled_coefficients, int16_t (*out)[272U]) { for (size_t i0 = (size_t)0U; i0 < (size_t)3U; i0++) { size_t i1 = i0; for (size_t i = (size_t)0U; i < (size_t)168U / (size_t)24U; i++) { size_t r = i; if (sampled_coefficients[i1] < LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT) { Eurydice_slice uu____0 = Eurydice_array_to_subslice2(randomness[i1], r * (size_t)24U, r * (size_t)24U + (size_t)24U, uint8_t); size_t sampled = libcrux_ml_kem_vector_portable_rej_sample_0d( uu____0, Eurydice_array_to_subslice2( out[i1], sampled_coefficients[i1], sampled_coefficients[i1] + (size_t)16U, int16_t)); size_t uu____1 = i1; sampled_coefficients[uu____1] = sampled_coefficients[uu____1] + sampled; } } } bool done = true; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { size_t i0 = i; if (sampled_coefficients[i0] >= LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT) { sampled_coefficients[i0] = LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT; } else { done = false; } } return done; } /** This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.from_i16_array_89 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_polynomial_from_i16_array_89_c1(Eurydice_slice a) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 result = libcrux_ml_kem_polynomial_ZERO_89_ea(); for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT; i++) { size_t i0 = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_from_i16_array_0d( Eurydice_slice_subslice2(a, i0 * (size_t)16U, (i0 + (size_t)1U) * (size_t)16U, int16_t)); result.coefficients[i0] = uu____0; } return result; } /** A monomorphic instance of libcrux_ml_kem.sampling.sample_from_xof.closure with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 */ static inline libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_sampling_sample_from_xof_closure_04(int16_t s[272U]) { return libcrux_ml_kem_polynomial_from_i16_array_89_c1( Eurydice_array_to_subslice2(s, (size_t)0U, (size_t)256U, int16_t)); } /** A monomorphic instance of libcrux_ml_kem.sampling.sample_from_xof with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_sampling_sample_from_xof_3f( uint8_t seeds[3U][34U], libcrux_ml_kem_polynomial_PolynomialRingElement_f0 ret[3U]) { size_t sampled_coefficients[3U] = {0U}; int16_t out[3U][272U] = {{0U}}; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_seeds[3U][34U]; memcpy(copy_of_seeds, seeds, (size_t)3U * sizeof(uint8_t[34U])); libcrux_ml_kem_hash_functions_portable_PortableHash_58 xof_state = libcrux_ml_kem_hash_functions_portable_shake128_init_absorb_f1_8c( copy_of_seeds); uint8_t randomness0[3U][504U]; libcrux_ml_kem_hash_functions_portable_shake128_squeeze_three_blocks_f1_69( &xof_state, randomness0); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_randomness0[3U][504U]; memcpy(copy_of_randomness0, randomness0, (size_t)3U * sizeof(uint8_t[504U])); bool done = libcrux_ml_kem_sampling_sample_from_uniform_distribution_next_db( copy_of_randomness0, sampled_coefficients, out); while (true) { if (done) { break; } else { uint8_t randomness[3U][168U]; libcrux_ml_kem_hash_functions_portable_shake128_squeeze_block_f1_60( &xof_state, randomness); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_randomness[3U][168U]; memcpy(copy_of_randomness, randomness, (size_t)3U * sizeof(uint8_t[168U])); done = libcrux_ml_kem_sampling_sample_from_uniform_distribution_next_db0( copy_of_randomness, sampled_coefficients, out); } } /* Passing arrays by value in Rust generates a copy in C */ int16_t copy_of_out[3U][272U]; memcpy(copy_of_out, out, (size_t)3U * sizeof(int16_t[272U])); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 ret0[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { ret0[i] = libcrux_ml_kem_sampling_sample_from_xof_closure_04(copy_of_out[i]); } memcpy( ret, ret0, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); } /** A monomorphic instance of libcrux_ml_kem.matrix.sample_matrix_A with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_matrix_sample_matrix_A_38( uint8_t seed[34U], bool transpose, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 ret[3U][3U]) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 A_transpose[3U][3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { libcrux_ml_kem_matrix_sample_matrix_A_closure_4b(i, A_transpose[i]); } for (size_t i0 = (size_t)0U; i0 < (size_t)3U; i0++) { size_t i1 = i0; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_seed[34U]; memcpy(copy_of_seed, seed, (size_t)34U * sizeof(uint8_t)); uint8_t seeds[3U][34U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { memcpy(seeds[i], copy_of_seed, (size_t)34U * sizeof(uint8_t)); } for (size_t i = (size_t)0U; i < (size_t)3U; i++) { size_t j = i; seeds[j][32U] = (uint8_t)i1; seeds[j][33U] = (uint8_t)j; } /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_seeds[3U][34U]; memcpy(copy_of_seeds, seeds, (size_t)3U * sizeof(uint8_t[34U])); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 sampled[3U]; libcrux_ml_kem_sampling_sample_from_xof_3f(copy_of_seeds, sampled); for (size_t i = (size_t)0U; i < Eurydice_slice_len( Eurydice_array_to_slice( (size_t)3U, sampled, libcrux_ml_kem_polynomial_PolynomialRingElement_f0), libcrux_ml_kem_polynomial_PolynomialRingElement_f0); i++) { size_t j = i; libcrux_ml_kem_polynomial_PolynomialRingElement_f0 sample = sampled[j]; if (transpose) { A_transpose[j][i1] = sample; } else { A_transpose[i1][j] = sample; } } } memcpy(ret, A_transpose, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0[3U])); } /** A monomorphic instance of K. with types libcrux_ml_kem_polynomial_PolynomialRingElement libcrux_ml_kem_vector_portable_vector_type_PortableVector[3size_t], uint8_t */ typedef struct tuple_b0_s { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 fst[3U]; uint8_t snd; } tuple_b0; /** A monomorphic instance of libcrux_ml_kem.ind_cpa.sample_vector_cbd_then_ntt.closure with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - ETA= 2 - ETA_RANDOMNESS_SIZE= 128 */ static inline libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_ind_cpa_sample_vector_cbd_then_ntt_closure_f7(size_t _i) { return libcrux_ml_kem_polynomial_ZERO_89_ea(); } /** A monomorphic instance of libcrux_ml_kem.hash_functions.portable.PRFxN with const generics - K= 3 - LEN= 128 */ static KRML_MUSTINLINE void libcrux_ml_kem_hash_functions_portable_PRFxN_c5( uint8_t (*input)[33U], uint8_t ret[3U][128U]) { uint8_t out[3U][128U] = {{0U}}; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { size_t i0 = i; libcrux_sha3_portable_shake256( Eurydice_array_to_slice((size_t)128U, out[i0], uint8_t), Eurydice_array_to_slice((size_t)33U, input[i0], uint8_t)); } memcpy(ret, out, (size_t)3U * sizeof(uint8_t[128U])); } /** This function found in impl {(libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash)} */ /** A monomorphic instance of libcrux_ml_kem.hash_functions.portable.PRFxN_f1 with const generics - K= 3 - LEN= 128 */ static KRML_MUSTINLINE void libcrux_ml_kem_hash_functions_portable_PRFxN_f1_93( uint8_t (*input)[33U], uint8_t ret[3U][128U]) { libcrux_ml_kem_hash_functions_portable_PRFxN_c5(input, ret); } /** Given a series of uniformly random bytes in `randomness`, for some number `eta`, the `sample_from_binomial_distribution_{eta}` functions sample a ring element from a binomial distribution centered at 0 that uses two sets of `eta` coin flips. If, for example, `eta = ETA`, each ring coefficient is a value `v` such such that `v ∈ {-ETA, -ETA + 1, ..., 0, ..., ETA + 1, ETA}` and: ```plaintext - If v < 0, Pr[v] = Pr[-v] - If v >= 0, Pr[v] = BINOMIAL_COEFFICIENT(2 * ETA; ETA - v) / 2 ^ (2 * ETA) ``` The values `v < 0` are mapped to the appropriate `KyberFieldElement`. The expected value is: ```plaintext E[X] = (-ETA)Pr[-ETA] + (-(ETA - 1))Pr[-(ETA - 1)] + ... + (ETA - 1)Pr[ETA - 1] + (ETA)Pr[ETA] = 0 since Pr[-v] = Pr[v] when v < 0. ``` And the variance is: ```plaintext Var(X) = E[(X - E[X])^2] = E[X^2] = sum_(v=-ETA to ETA)v^2 * (BINOMIAL_COEFFICIENT(2 * ETA; ETA - v) / 2^(2 * ETA)) = ETA / 2 ``` This function implements Algorithm 7 of the NIST FIPS 203 standard, which is reproduced below: ```plaintext Input: byte array B ∈ 𝔹^{64η}. Output: array f ∈ ℤ₂₅₆. b ← BytesToBits(B) for (i ← 0; i < 256; i++) x ← ∑(j=0 to η - 1) b[2iη + j] y ← ∑(j=0 to η - 1) b[2iη + η + j] f[i] ← x−y mod q end for return f ``` The NIST FIPS 203 standard can be found at . */ /** A monomorphic instance of libcrux_ml_kem.sampling.sample_from_binomial_distribution_2 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_sampling_sample_from_binomial_distribution_2_85( Eurydice_slice randomness) { int16_t sampled_i16s[256U] = {0U}; for (size_t i0 = (size_t)0U; i0 < Eurydice_slice_len(randomness, uint8_t) / (size_t)4U; i0++) { size_t chunk_number = i0; Eurydice_slice byte_chunk = Eurydice_slice_subslice2( randomness, chunk_number * (size_t)4U, chunk_number * (size_t)4U + (size_t)4U, uint8_t); uint32_t random_bits_as_u32 = (((uint32_t)Eurydice_slice_index(byte_chunk, (size_t)0U, uint8_t, uint8_t *) | (uint32_t)Eurydice_slice_index(byte_chunk, (size_t)1U, uint8_t, uint8_t *) << 8U) | (uint32_t)Eurydice_slice_index(byte_chunk, (size_t)2U, uint8_t, uint8_t *) << 16U) | (uint32_t)Eurydice_slice_index(byte_chunk, (size_t)3U, uint8_t, uint8_t *) << 24U; uint32_t even_bits = random_bits_as_u32 & 1431655765U; uint32_t odd_bits = random_bits_as_u32 >> 1U & 1431655765U; uint32_t coin_toss_outcomes = even_bits + odd_bits; for (uint32_t i = 0U; i < CORE_NUM__U32_8__BITS / 4U; i++) { uint32_t outcome_set = i; uint32_t outcome_set0 = outcome_set * 4U; int16_t outcome_1 = (int16_t)(coin_toss_outcomes >> (uint32_t)outcome_set0 & 3U); int16_t outcome_2 = (int16_t)(coin_toss_outcomes >> (uint32_t)(outcome_set0 + 2U) & 3U); size_t offset = (size_t)(outcome_set0 >> 2U); sampled_i16s[(size_t)8U * chunk_number + offset] = outcome_1 - outcome_2; } } return libcrux_ml_kem_polynomial_from_i16_array_89_c1( Eurydice_array_to_slice((size_t)256U, sampled_i16s, int16_t)); } /** A monomorphic instance of libcrux_ml_kem.sampling.sample_from_binomial_distribution_3 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_sampling_sample_from_binomial_distribution_3_eb( Eurydice_slice randomness) { int16_t sampled_i16s[256U] = {0U}; for (size_t i0 = (size_t)0U; i0 < Eurydice_slice_len(randomness, uint8_t) / (size_t)3U; i0++) { size_t chunk_number = i0; Eurydice_slice byte_chunk = Eurydice_slice_subslice2( randomness, chunk_number * (size_t)3U, chunk_number * (size_t)3U + (size_t)3U, uint8_t); uint32_t random_bits_as_u24 = ((uint32_t)Eurydice_slice_index(byte_chunk, (size_t)0U, uint8_t, uint8_t *) | (uint32_t)Eurydice_slice_index(byte_chunk, (size_t)1U, uint8_t, uint8_t *) << 8U) | (uint32_t)Eurydice_slice_index(byte_chunk, (size_t)2U, uint8_t, uint8_t *) << 16U; uint32_t first_bits = random_bits_as_u24 & 2396745U; uint32_t second_bits = random_bits_as_u24 >> 1U & 2396745U; uint32_t third_bits = random_bits_as_u24 >> 2U & 2396745U; uint32_t coin_toss_outcomes = first_bits + second_bits + third_bits; for (int32_t i = (int32_t)0; i < (int32_t)24 / (int32_t)6; i++) { int32_t outcome_set = i; int32_t outcome_set0 = outcome_set * (int32_t)6; int16_t outcome_1 = (int16_t)(coin_toss_outcomes >> (uint32_t)outcome_set0 & 7U); int16_t outcome_2 = (int16_t)(coin_toss_outcomes >> (uint32_t)(outcome_set0 + (int32_t)3) & 7U); size_t offset = (size_t)(outcome_set0 / (int32_t)6); sampled_i16s[(size_t)4U * chunk_number + offset] = outcome_1 - outcome_2; } } return libcrux_ml_kem_polynomial_from_i16_array_89_c1( Eurydice_array_to_slice((size_t)256U, sampled_i16s, int16_t)); } /** A monomorphic instance of libcrux_ml_kem.sampling.sample_from_binomial_distribution with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - ETA= 2 */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_sampling_sample_from_binomial_distribution_c6( Eurydice_slice randomness) { return libcrux_ml_kem_sampling_sample_from_binomial_distribution_2_85( randomness); } /** A monomorphic instance of libcrux_ml_kem.ntt.ntt_at_layer_7 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_ntt_ntt_at_layer_7_f4( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *re) { size_t step = LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT / (size_t)2U; for (size_t i = (size_t)0U; i < step; i++) { size_t j = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector t = libcrux_ml_kem_vector_portable_multiply_by_constant_0d( re->coefficients[j + step], (int16_t)-1600); re->coefficients[j + step] = libcrux_ml_kem_vector_portable_sub_0d(re->coefficients[j], &t); libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____1 = libcrux_ml_kem_vector_portable_add_0d(re->coefficients[j], &t); re->coefficients[j] = uu____1; } } /** A monomorphic instance of libcrux_ml_kem.ntt.ntt_binomially_sampled_ring_element with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_ntt_ntt_binomially_sampled_ring_element_0f( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *re) { libcrux_ml_kem_ntt_ntt_at_layer_7_f4(re); size_t zeta_i = (size_t)1U; libcrux_ml_kem_ntt_ntt_at_layer_4_plus_51(&zeta_i, re, (size_t)6U, (size_t)3U); libcrux_ml_kem_ntt_ntt_at_layer_4_plus_51(&zeta_i, re, (size_t)5U, (size_t)3U); libcrux_ml_kem_ntt_ntt_at_layer_4_plus_51(&zeta_i, re, (size_t)4U, (size_t)3U); libcrux_ml_kem_ntt_ntt_at_layer_3_fd(&zeta_i, re, (size_t)3U, (size_t)3U); libcrux_ml_kem_ntt_ntt_at_layer_2_ad(&zeta_i, re, (size_t)2U, (size_t)3U); libcrux_ml_kem_ntt_ntt_at_layer_1_a2(&zeta_i, re, (size_t)1U, (size_t)3U); libcrux_ml_kem_polynomial_poly_barrett_reduce_89_8b(re); } /** Sample a vector of ring elements from a centered binomial distribution and convert them into their NTT representations. */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.sample_vector_cbd_then_ntt with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - ETA= 2 - ETA_RANDOMNESS_SIZE= 128 */ static KRML_MUSTINLINE tuple_b0 libcrux_ml_kem_ind_cpa_sample_vector_cbd_then_ntt_fc(uint8_t prf_input[33U], uint8_t domain_separator) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 re_as_ntt[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { re_as_ntt[i] = libcrux_ml_kem_polynomial_ZERO_89_ea(); } /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_prf_input[33U]; memcpy(copy_of_prf_input, prf_input, (size_t)33U * sizeof(uint8_t)); uint8_t prf_inputs[3U][33U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { memcpy(prf_inputs[i], copy_of_prf_input, (size_t)33U * sizeof(uint8_t)); } for (size_t i = (size_t)0U; i < (size_t)3U; i++) { size_t i0 = i; prf_inputs[i0][32U] = domain_separator; domain_separator = (uint32_t)domain_separator + 1U; } uint8_t prf_outputs[3U][128U]; libcrux_ml_kem_hash_functions_portable_PRFxN_f1_93(prf_inputs, prf_outputs); for (size_t i = (size_t)0U; i < (size_t)3U; i++) { size_t i0 = i; re_as_ntt[i0] = libcrux_ml_kem_sampling_sample_from_binomial_distribution_c6( Eurydice_array_to_slice((size_t)128U, prf_outputs[i0], uint8_t)); libcrux_ml_kem_ntt_ntt_binomially_sampled_ring_element_0f(&re_as_ntt[i0]); } /* Passing arrays by value in Rust generates a copy in C */ libcrux_ml_kem_polynomial_PolynomialRingElement_f0 copy_of_re_as_ntt[3U]; memcpy( copy_of_re_as_ntt, re_as_ntt, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); tuple_b0 lit; memcpy( lit.fst, copy_of_re_as_ntt, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); lit.snd = domain_separator; return lit; } /** A monomorphic instance of libcrux_ml_kem.ind_cpa.sample_ring_element_cbd.closure with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - ETA2_RANDOMNESS_SIZE= 128 - ETA2= 2 */ static inline libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_ind_cpa_sample_ring_element_cbd_closure_77(size_t _i) { return libcrux_ml_kem_polynomial_ZERO_89_ea(); } /** Sample a vector of ring elements from a centered binomial distribution. */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.sample_ring_element_cbd with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - ETA2_RANDOMNESS_SIZE= 128 - ETA2= 2 */ static KRML_MUSTINLINE tuple_b0 libcrux_ml_kem_ind_cpa_sample_ring_element_cbd_ac(uint8_t prf_input[33U], uint8_t domain_separator) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 error_1[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { error_1[i] = libcrux_ml_kem_polynomial_ZERO_89_ea(); } /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_prf_input[33U]; memcpy(copy_of_prf_input, prf_input, (size_t)33U * sizeof(uint8_t)); uint8_t prf_inputs[3U][33U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { memcpy(prf_inputs[i], copy_of_prf_input, (size_t)33U * sizeof(uint8_t)); } for (size_t i = (size_t)0U; i < (size_t)3U; i++) { size_t i0 = i; prf_inputs[i0][32U] = domain_separator; domain_separator = (uint32_t)domain_separator + 1U; } uint8_t prf_outputs[3U][128U]; libcrux_ml_kem_hash_functions_portable_PRFxN_f1_93(prf_inputs, prf_outputs); for (size_t i = (size_t)0U; i < (size_t)3U; i++) { size_t i0 = i; libcrux_ml_kem_polynomial_PolynomialRingElement_f0 uu____1 = libcrux_ml_kem_sampling_sample_from_binomial_distribution_c6( Eurydice_array_to_slice((size_t)128U, prf_outputs[i0], uint8_t)); error_1[i0] = uu____1; } /* Passing arrays by value in Rust generates a copy in C */ libcrux_ml_kem_polynomial_PolynomialRingElement_f0 copy_of_error_1[3U]; memcpy( copy_of_error_1, error_1, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); tuple_b0 lit; memcpy( lit.fst, copy_of_error_1, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); lit.snd = domain_separator; return lit; } /** A monomorphic instance of libcrux_ml_kem.hash_functions.portable.PRF with const generics - LEN= 128 */ static KRML_MUSTINLINE void libcrux_ml_kem_hash_functions_portable_PRF_2b0( Eurydice_slice input, uint8_t ret[128U]) { uint8_t digest[128U] = {0U}; libcrux_sha3_portable_shake256( Eurydice_array_to_slice((size_t)128U, digest, uint8_t), input); memcpy(ret, digest, (size_t)128U * sizeof(uint8_t)); } /** This function found in impl {(libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash)} */ /** A monomorphic instance of libcrux_ml_kem.hash_functions.portable.PRF_f1 with const generics - K= 3 - LEN= 128 */ static KRML_MUSTINLINE void libcrux_ml_kem_hash_functions_portable_PRF_f1_ee0( Eurydice_slice input, uint8_t ret[128U]) { libcrux_ml_kem_hash_functions_portable_PRF_2b0(input, ret); } /** A monomorphic instance of libcrux_ml_kem.matrix.compute_vector_u.closure with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static inline libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_matrix_compute_vector_u_closure_d6(size_t _i) { return libcrux_ml_kem_polynomial_ZERO_89_ea(); } /** This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.add_error_reduce_89 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_polynomial_add_error_reduce_89_38( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *self, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *error) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT; i++) { size_t j = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient_normal_form = libcrux_ml_kem_vector_portable_montgomery_multiply_by_constant_0d( self->coefficients[j], (int16_t)1441); libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_barrett_reduce_0d( libcrux_ml_kem_vector_portable_add_0d(coefficient_normal_form, &error->coefficients[j])); self->coefficients[j] = uu____0; } } /** Compute u := InvertNTT(Aᵀ ◦ r̂) + e₁ */ /** A monomorphic instance of libcrux_ml_kem.matrix.compute_vector_u with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_matrix_compute_vector_u_59( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 (*a_as_ntt)[3U], libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *r_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *error_1, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 ret[3U]) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 result[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { result[i] = libcrux_ml_kem_polynomial_ZERO_89_ea(); } for (size_t i0 = (size_t)0U; i0 < Eurydice_slice_len( Eurydice_array_to_slice( (size_t)3U, a_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_f0[3U]), libcrux_ml_kem_polynomial_PolynomialRingElement_f0[3U]); i0++) { size_t i1 = i0; libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *row = a_as_ntt[i1]; for (size_t i = (size_t)0U; i < Eurydice_slice_len( Eurydice_array_to_slice( (size_t)3U, row, libcrux_ml_kem_polynomial_PolynomialRingElement_f0), libcrux_ml_kem_polynomial_PolynomialRingElement_f0); i++) { size_t j = i; libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *a_element = &row[j]; libcrux_ml_kem_polynomial_PolynomialRingElement_f0 product = libcrux_ml_kem_polynomial_ntt_multiply_89_2a(a_element, &r_as_ntt[j]); libcrux_ml_kem_polynomial_add_to_ring_element_89_84(&result[i1], &product); } libcrux_ml_kem_invert_ntt_invert_ntt_montgomery_f6(&result[i1]); libcrux_ml_kem_polynomial_add_error_reduce_89_38(&result[i1], &error_1[i1]); } memcpy( ret, result, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); } /** A monomorphic instance of libcrux_ml_kem.vector.traits.decompress_1 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_traits_decompress_1_63( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_ZERO_0d(); return libcrux_ml_kem_vector_portable_bitwise_and_with_constant_0d( libcrux_ml_kem_vector_portable_sub_0d(uu____0, &v), (int16_t)1665); } /** A monomorphic instance of libcrux_ml_kem.serialize.deserialize_then_decompress_message with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_serialize_deserialize_then_decompress_message_0d( uint8_t serialized[32U]) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 re = libcrux_ml_kem_polynomial_ZERO_89_ea(); for (size_t i = (size_t)0U; i < (size_t)16U; i++) { size_t i0 = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient_compressed = libcrux_ml_kem_vector_portable_deserialize_1_0d( Eurydice_array_to_subslice2(serialized, (size_t)2U * i0, (size_t)2U * i0 + (size_t)2U, uint8_t)); libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_traits_decompress_1_63(coefficient_compressed); re.coefficients[i0] = uu____0; } return re; } /** This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.add_message_error_reduce_89 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_polynomial_add_message_error_reduce_89_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *self, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *message, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 result) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT; i++) { size_t i0 = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient_normal_form = libcrux_ml_kem_vector_portable_montgomery_multiply_by_constant_0d( result.coefficients[i0], (int16_t)1441); libcrux_ml_kem_vector_portable_vector_type_PortableVector tmp = libcrux_ml_kem_vector_portable_add_0d(self->coefficients[i0], &message->coefficients[i0]); libcrux_ml_kem_vector_portable_vector_type_PortableVector tmp0 = libcrux_ml_kem_vector_portable_add_0d(coefficient_normal_form, &tmp); libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_barrett_reduce_0d(tmp0); result.coefficients[i0] = uu____0; } return result; } /** Compute InverseNTT(tᵀ ◦ r̂) + e₂ + message */ /** A monomorphic instance of libcrux_ml_kem.matrix.compute_ring_element_v with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_matrix_compute_ring_element_v_54( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *t_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *r_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *error_2, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *message) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 result = libcrux_ml_kem_polynomial_ZERO_89_ea(); for (size_t i = (size_t)0U; i < (size_t)3U; i++) { size_t i0 = i; libcrux_ml_kem_polynomial_PolynomialRingElement_f0 product = libcrux_ml_kem_polynomial_ntt_multiply_89_2a(&t_as_ntt[i0], &r_as_ntt[i0]); libcrux_ml_kem_polynomial_add_to_ring_element_89_84(&result, &product); } libcrux_ml_kem_invert_ntt_invert_ntt_montgomery_f6(&result); result = libcrux_ml_kem_polynomial_add_message_error_reduce_89_ea( error_2, message, result); return result; } /** A monomorphic instance of libcrux_ml_kem.vector.portable.compress.compress with const generics - COEFFICIENT_BITS= 10 */ static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_compress_compress_02( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; int16_t uu____0 = libcrux_ml_kem_vector_portable_compress_compress_ciphertext_coefficient( (uint8_t)(int32_t)10, (uint16_t)v.elements[i0]); v.elements[i0] = uu____0; } return v; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ /** A monomorphic instance of libcrux_ml_kem.vector.portable.compress_0d with const generics - COEFFICIENT_BITS= 10 */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_compress_0d_28( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { return libcrux_ml_kem_vector_portable_compress_compress_02(v); } /** A monomorphic instance of libcrux_ml_kem.serialize.compress_then_serialize_10 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - OUT_LEN= 320 */ static KRML_MUSTINLINE void libcrux_ml_kem_serialize_compress_then_serialize_10_fc( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *re, uint8_t ret[320U]) { uint8_t serialized[320U] = {0U}; for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT; i++) { size_t i0 = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient = libcrux_ml_kem_vector_portable_compress_0d_28( libcrux_ml_kem_vector_traits_to_unsigned_representative_db( re->coefficients[i0])); uint8_t bytes[20U]; libcrux_ml_kem_vector_portable_serialize_10_0d(coefficient, bytes); Eurydice_slice uu____0 = Eurydice_array_to_subslice2( serialized, (size_t)20U * i0, (size_t)20U * i0 + (size_t)20U, uint8_t); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)20U, bytes, uint8_t), uint8_t); } memcpy(ret, serialized, (size_t)320U * sizeof(uint8_t)); } /** A monomorphic instance of libcrux_ml_kem.vector.portable.compress.compress with const generics - COEFFICIENT_BITS= 11 */ static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_compress_compress_020( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; int16_t uu____0 = libcrux_ml_kem_vector_portable_compress_compress_ciphertext_coefficient( (uint8_t)(int32_t)11, (uint16_t)v.elements[i0]); v.elements[i0] = uu____0; } return v; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ /** A monomorphic instance of libcrux_ml_kem.vector.portable.compress_0d with const generics - COEFFICIENT_BITS= 11 */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_compress_0d_280( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { return libcrux_ml_kem_vector_portable_compress_compress_020(v); } /** A monomorphic instance of libcrux_ml_kem.serialize.compress_then_serialize_11 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - OUT_LEN= 320 */ static KRML_MUSTINLINE void libcrux_ml_kem_serialize_compress_then_serialize_11_e1( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *re, uint8_t ret[320U]) { uint8_t serialized[320U] = {0U}; for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT; i++) { size_t i0 = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient = libcrux_ml_kem_vector_portable_compress_0d_280( libcrux_ml_kem_vector_traits_to_unsigned_representative_db( re->coefficients[i0])); uint8_t bytes[22U]; libcrux_ml_kem_vector_portable_serialize_11_0d(coefficient, bytes); Eurydice_slice uu____0 = Eurydice_array_to_subslice2( serialized, (size_t)22U * i0, (size_t)22U * i0 + (size_t)22U, uint8_t); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)22U, bytes, uint8_t), uint8_t); } memcpy(ret, serialized, (size_t)320U * sizeof(uint8_t)); } /** A monomorphic instance of libcrux_ml_kem.serialize.compress_then_serialize_ring_element_u with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - COMPRESSION_FACTOR= 10 - OUT_LEN= 320 */ static KRML_MUSTINLINE void libcrux_ml_kem_serialize_compress_then_serialize_ring_element_u_5f( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *re, uint8_t ret[320U]) { uint8_t uu____0[320U]; libcrux_ml_kem_serialize_compress_then_serialize_10_fc(re, uu____0); memcpy(ret, uu____0, (size_t)320U * sizeof(uint8_t)); } /** Call [`compress_then_serialize_ring_element_u`] on each ring element. */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.compress_then_serialize_u with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - OUT_LEN= 960 - COMPRESSION_FACTOR= 10 - BLOCK_LEN= 320 */ static inline void libcrux_ml_kem_ind_cpa_compress_then_serialize_u_a7( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 input[3U], Eurydice_slice out) { for (size_t i = (size_t)0U; i < Eurydice_slice_len( Eurydice_array_to_slice( (size_t)3U, input, libcrux_ml_kem_polynomial_PolynomialRingElement_f0), libcrux_ml_kem_polynomial_PolynomialRingElement_f0); i++) { size_t i0 = i; libcrux_ml_kem_polynomial_PolynomialRingElement_f0 re = input[i0]; Eurydice_slice uu____0 = Eurydice_slice_subslice2( out, i0 * ((size_t)960U / (size_t)3U), (i0 + (size_t)1U) * ((size_t)960U / (size_t)3U), uint8_t); uint8_t ret[320U]; libcrux_ml_kem_serialize_compress_then_serialize_ring_element_u_5f(&re, ret); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)320U, ret, uint8_t), uint8_t); } } /** A monomorphic instance of libcrux_ml_kem.vector.portable.compress.compress with const generics - COEFFICIENT_BITS= 4 */ static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_compress_compress_021( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; int16_t uu____0 = libcrux_ml_kem_vector_portable_compress_compress_ciphertext_coefficient( (uint8_t)(int32_t)4, (uint16_t)v.elements[i0]); v.elements[i0] = uu____0; } return v; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ /** A monomorphic instance of libcrux_ml_kem.vector.portable.compress_0d with const generics - COEFFICIENT_BITS= 4 */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_compress_0d_281( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { return libcrux_ml_kem_vector_portable_compress_compress_021(v); } /** A monomorphic instance of libcrux_ml_kem.serialize.compress_then_serialize_4 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_serialize_compress_then_serialize_4_9a( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 re, Eurydice_slice serialized) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT; i++) { size_t i0 = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient = libcrux_ml_kem_vector_portable_compress_0d_281( libcrux_ml_kem_vector_traits_to_unsigned_representative_db( re.coefficients[i0])); uint8_t bytes[8U]; libcrux_ml_kem_vector_portable_serialize_4_0d(coefficient, bytes); Eurydice_slice_copy( Eurydice_slice_subslice2(serialized, (size_t)8U * i0, (size_t)8U * i0 + (size_t)8U, uint8_t), Eurydice_array_to_slice((size_t)8U, bytes, uint8_t), uint8_t); } } /** A monomorphic instance of libcrux_ml_kem.vector.portable.compress.compress with const generics - COEFFICIENT_BITS= 5 */ static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_compress_compress_022( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; int16_t uu____0 = libcrux_ml_kem_vector_portable_compress_compress_ciphertext_coefficient( (uint8_t)(int32_t)5, (uint16_t)v.elements[i0]); v.elements[i0] = uu____0; } return v; } /** This function found in impl {(libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ /** A monomorphic instance of libcrux_ml_kem.vector.portable.compress_0d with const generics - COEFFICIENT_BITS= 5 */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_compress_0d_282( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { return libcrux_ml_kem_vector_portable_compress_compress_022(v); } /** A monomorphic instance of libcrux_ml_kem.serialize.compress_then_serialize_5 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_serialize_compress_then_serialize_5_1f( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 re, Eurydice_slice serialized) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT; i++) { size_t i0 = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficients = libcrux_ml_kem_vector_portable_compress_0d_282( libcrux_ml_kem_vector_traits_to_unsigned_representative_db( re.coefficients[i0])); uint8_t bytes[10U]; libcrux_ml_kem_vector_portable_serialize_5_0d(coefficients, bytes); Eurydice_slice_copy( Eurydice_slice_subslice2(serialized, (size_t)10U * i0, (size_t)10U * i0 + (size_t)10U, uint8_t), Eurydice_array_to_slice((size_t)10U, bytes, uint8_t), uint8_t); } } /** A monomorphic instance of libcrux_ml_kem.serialize.compress_then_serialize_ring_element_v with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - COMPRESSION_FACTOR= 4 - OUT_LEN= 128 */ static KRML_MUSTINLINE void libcrux_ml_kem_serialize_compress_then_serialize_ring_element_v_4e( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 re, Eurydice_slice out) { libcrux_ml_kem_serialize_compress_then_serialize_4_9a(re, out); } /** A monomorphic instance of libcrux_ml_kem.ind_cpa.encrypt with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - CIPHERTEXT_SIZE= 1088 - T_AS_NTT_ENCODED_SIZE= 1152 - C1_LEN= 960 - C2_LEN= 128 - U_COMPRESSION_FACTOR= 10 - V_COMPRESSION_FACTOR= 4 - BLOCK_LEN= 320 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 - ETA2= 2 - ETA2_RANDOMNESS_SIZE= 128 */ static inline void libcrux_ml_kem_ind_cpa_encrypt_60(Eurydice_slice public_key, uint8_t message[32U], Eurydice_slice randomness, uint8_t ret[1088U]) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 t_as_ntt[3U]; libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_33( Eurydice_slice_subslice_to(public_key, (size_t)1152U, uint8_t, size_t), t_as_ntt); Eurydice_slice seed = Eurydice_slice_subslice_from(public_key, (size_t)1152U, uint8_t, size_t); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 A[3U][3U]; uint8_t ret0[34U]; libcrux_ml_kem_utils_into_padded_array_ea1(seed, ret0); libcrux_ml_kem_matrix_sample_matrix_A_38(ret0, false, A); uint8_t prf_input[33U]; libcrux_ml_kem_utils_into_padded_array_ea2(randomness, prf_input); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_prf_input0[33U]; memcpy(copy_of_prf_input0, prf_input, (size_t)33U * sizeof(uint8_t)); tuple_b0 uu____1 = libcrux_ml_kem_ind_cpa_sample_vector_cbd_then_ntt_fc( copy_of_prf_input0, 0U); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 r_as_ntt[3U]; memcpy( r_as_ntt, uu____1.fst, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); uint8_t domain_separator0 = uu____1.snd; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_prf_input[33U]; memcpy(copy_of_prf_input, prf_input, (size_t)33U * sizeof(uint8_t)); tuple_b0 uu____3 = libcrux_ml_kem_ind_cpa_sample_ring_element_cbd_ac( copy_of_prf_input, domain_separator0); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 error_1[3U]; memcpy( error_1, uu____3.fst, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); uint8_t domain_separator = uu____3.snd; prf_input[32U] = domain_separator; uint8_t prf_output[128U]; libcrux_ml_kem_hash_functions_portable_PRF_f1_ee0( Eurydice_array_to_slice((size_t)33U, prf_input, uint8_t), prf_output); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 error_2 = libcrux_ml_kem_sampling_sample_from_binomial_distribution_c6( Eurydice_array_to_slice((size_t)128U, prf_output, uint8_t)); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 u[3U]; libcrux_ml_kem_matrix_compute_vector_u_59(A, r_as_ntt, error_1, u); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_message[32U]; memcpy(copy_of_message, message, (size_t)32U * sizeof(uint8_t)); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 message_as_ring_element = libcrux_ml_kem_serialize_deserialize_then_decompress_message_0d( copy_of_message); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 v = libcrux_ml_kem_matrix_compute_ring_element_v_54( t_as_ntt, r_as_ntt, &error_2, &message_as_ring_element); uint8_t ciphertext[1088U] = {0U}; libcrux_ml_kem_polynomial_PolynomialRingElement_f0 uu____5[3U]; memcpy( uu____5, u, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); libcrux_ml_kem_ind_cpa_compress_then_serialize_u_a7( uu____5, Eurydice_array_to_subslice2(ciphertext, (size_t)0U, (size_t)960U, uint8_t)); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 uu____6 = v; libcrux_ml_kem_serialize_compress_then_serialize_ring_element_v_4e( uu____6, Eurydice_array_to_subslice_from((size_t)1088U, ciphertext, (size_t)960U, uint8_t, size_t)); memcpy(ret, ciphertext, (size_t)1088U * sizeof(uint8_t)); } /** This function found in impl {(libcrux_ml_kem::variant::Variant for libcrux_ml_kem::variant::MlKem)#1} */ /** A monomorphic instance of libcrux_ml_kem.variant.kdf_d8 with types libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - CIPHERTEXT_SIZE= 1088 */ static KRML_MUSTINLINE void libcrux_ml_kem_variant_kdf_d8_41( Eurydice_slice shared_secret, libcrux_ml_kem_mlkem768_MlKem768Ciphertext *_, uint8_t ret[32U]) { uint8_t out[32U] = {0U}; Eurydice_slice_copy(Eurydice_array_to_slice((size_t)32U, out, uint8_t), shared_secret, uint8_t); memcpy(ret, out, (size_t)32U * sizeof(uint8_t)); } /** A monomorphic instance of libcrux_ml_kem.ind_cca.decapsulate with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]], libcrux_ml_kem_variant_MlKem with const generics - K= 3 - SECRET_KEY_SIZE= 2400 - CPA_SECRET_KEY_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 - CIPHERTEXT_SIZE= 1088 - T_AS_NTT_ENCODED_SIZE= 1152 - C1_SIZE= 960 - C2_SIZE= 128 - VECTOR_U_COMPRESSION_FACTOR= 10 - VECTOR_V_COMPRESSION_FACTOR= 4 - C1_BLOCK_SIZE= 320 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 - ETA2= 2 - ETA2_RANDOMNESS_SIZE= 128 - IMPLICIT_REJECTION_HASH_INPUT_SIZE= 1120 */ static inline void libcrux_ml_kem_ind_cca_decapsulate_70( libcrux_ml_kem_types_MlKemPrivateKey_55 *private_key, libcrux_ml_kem_mlkem768_MlKem768Ciphertext *ciphertext, uint8_t ret[32U]) { Eurydice_slice_uint8_t_x2 uu____0 = Eurydice_slice_split_at( Eurydice_array_to_slice((size_t)2400U, private_key->value, uint8_t), (size_t)1152U, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice ind_cpa_secret_key = uu____0.fst; Eurydice_slice secret_key0 = uu____0.snd; Eurydice_slice_uint8_t_x2 uu____1 = Eurydice_slice_split_at( secret_key0, (size_t)1184U, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice ind_cpa_public_key = uu____1.fst; Eurydice_slice secret_key = uu____1.snd; Eurydice_slice_uint8_t_x2 uu____2 = Eurydice_slice_split_at( secret_key, LIBCRUX_ML_KEM_CONSTANTS_H_DIGEST_SIZE, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice ind_cpa_public_key_hash = uu____2.fst; Eurydice_slice implicit_rejection_value = uu____2.snd; uint8_t decrypted[32U]; libcrux_ml_kem_ind_cpa_decrypt_43(ind_cpa_secret_key, ciphertext->value, decrypted); uint8_t to_hash0[64U]; libcrux_ml_kem_utils_into_padded_array_ea( Eurydice_array_to_slice((size_t)32U, decrypted, uint8_t), to_hash0); Eurydice_slice_copy( Eurydice_array_to_subslice_from( (size_t)64U, to_hash0, LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE, uint8_t, size_t), ind_cpa_public_key_hash, uint8_t); uint8_t hashed[64U]; libcrux_ml_kem_hash_functions_portable_G_f1_e4( Eurydice_array_to_slice((size_t)64U, to_hash0, uint8_t), hashed); Eurydice_slice_uint8_t_x2 uu____3 = Eurydice_slice_split_at( Eurydice_array_to_slice((size_t)64U, hashed, uint8_t), LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice shared_secret0 = uu____3.fst; Eurydice_slice pseudorandomness = uu____3.snd; uint8_t to_hash[1120U]; libcrux_ml_kem_utils_into_padded_array_ea0(implicit_rejection_value, to_hash); Eurydice_slice uu____4 = Eurydice_array_to_subslice_from( (size_t)1120U, to_hash, LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE, uint8_t, size_t); Eurydice_slice_copy(uu____4, libcrux_ml_kem_types_as_ref_00_24(ciphertext), uint8_t); uint8_t implicit_rejection_shared_secret0[32U]; libcrux_ml_kem_hash_functions_portable_PRF_f1_ee( Eurydice_array_to_slice((size_t)1120U, to_hash, uint8_t), implicit_rejection_shared_secret0); Eurydice_slice uu____5 = ind_cpa_public_key; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_decrypted[32U]; memcpy(copy_of_decrypted, decrypted, (size_t)32U * sizeof(uint8_t)); uint8_t expected_ciphertext[1088U]; libcrux_ml_kem_ind_cpa_encrypt_60(uu____5, copy_of_decrypted, pseudorandomness, expected_ciphertext); uint8_t implicit_rejection_shared_secret[32U]; libcrux_ml_kem_variant_kdf_d8_41( Eurydice_array_to_slice((size_t)32U, implicit_rejection_shared_secret0, uint8_t), ciphertext, implicit_rejection_shared_secret); uint8_t shared_secret[32U]; libcrux_ml_kem_variant_kdf_d8_41(shared_secret0, ciphertext, shared_secret); uint8_t ret0[32U]; libcrux_ml_kem_constant_time_ops_compare_ciphertexts_select_shared_secret_in_constant_time( libcrux_ml_kem_types_as_ref_00_24(ciphertext), Eurydice_array_to_slice((size_t)1088U, expected_ciphertext, uint8_t), Eurydice_array_to_slice((size_t)32U, shared_secret, uint8_t), Eurydice_array_to_slice((size_t)32U, implicit_rejection_shared_secret, uint8_t), ret0); memcpy(ret, ret0, (size_t)32U * sizeof(uint8_t)); } /** Portable decapsulate */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.instantiations.portable.decapsulate with const generics - K= 3 - SECRET_KEY_SIZE= 2400 - CPA_SECRET_KEY_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 - CIPHERTEXT_SIZE= 1088 - T_AS_NTT_ENCODED_SIZE= 1152 - C1_SIZE= 960 - C2_SIZE= 128 - VECTOR_U_COMPRESSION_FACTOR= 10 - VECTOR_V_COMPRESSION_FACTOR= 4 - C1_BLOCK_SIZE= 320 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 - ETA2= 2 - ETA2_RANDOMNESS_SIZE= 128 - IMPLICIT_REJECTION_HASH_INPUT_SIZE= 1120 */ static inline void libcrux_ml_kem_ind_cca_instantiations_portable_decapsulate_2e( libcrux_ml_kem_types_MlKemPrivateKey_55 *private_key, libcrux_ml_kem_mlkem768_MlKem768Ciphertext *ciphertext, uint8_t ret[32U]) { libcrux_ml_kem_ind_cca_decapsulate_70(private_key, ciphertext, ret); } /** Decapsulate ML-KEM 768 Generates an [`MlKemSharedSecret`]. The input is a reference to an [`MlKem768PrivateKey`] and an [`MlKem768Ciphertext`]. */ static inline void libcrux_ml_kem_mlkem768_portable_decapsulate( libcrux_ml_kem_types_MlKemPrivateKey_55 *private_key, libcrux_ml_kem_mlkem768_MlKem768Ciphertext *ciphertext, uint8_t ret[32U]) { libcrux_ml_kem_ind_cca_instantiations_portable_decapsulate_2e( private_key, ciphertext, ret); } /** This function found in impl {(libcrux_ml_kem::variant::Variant for libcrux_ml_kem::variant::MlKem)#1} */ /** A monomorphic instance of libcrux_ml_kem.variant.entropy_preprocess_d8 with types libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_variant_entropy_preprocess_d8_63( Eurydice_slice randomness, uint8_t ret[32U]) { uint8_t out[32U] = {0U}; Eurydice_slice_copy(Eurydice_array_to_slice((size_t)32U, out, uint8_t), randomness, uint8_t); memcpy(ret, out, (size_t)32U * sizeof(uint8_t)); } /** This function found in impl {(libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash)} */ /** A monomorphic instance of libcrux_ml_kem.hash_functions.portable.H_f1 with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_hash_functions_portable_H_f1_1a( Eurydice_slice input, uint8_t ret[32U]) { libcrux_ml_kem_hash_functions_portable_H(input, ret); } /** A monomorphic instance of libcrux_ml_kem.ind_cca.encapsulate with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]], libcrux_ml_kem_variant_MlKem with const generics - K= 3 - CIPHERTEXT_SIZE= 1088 - PUBLIC_KEY_SIZE= 1184 - T_AS_NTT_ENCODED_SIZE= 1152 - C1_SIZE= 960 - C2_SIZE= 128 - VECTOR_U_COMPRESSION_FACTOR= 10 - VECTOR_V_COMPRESSION_FACTOR= 4 - VECTOR_U_BLOCK_LEN= 320 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 - ETA2= 2 - ETA2_RANDOMNESS_SIZE= 128 */ static inline tuple_3c libcrux_ml_kem_ind_cca_encapsulate_cd( libcrux_ml_kem_types_MlKemPublicKey_15 *public_key, uint8_t randomness[32U]) { uint8_t randomness0[32U]; libcrux_ml_kem_variant_entropy_preprocess_d8_63( Eurydice_array_to_slice((size_t)32U, randomness, uint8_t), randomness0); uint8_t to_hash[64U]; libcrux_ml_kem_utils_into_padded_array_ea( Eurydice_array_to_slice((size_t)32U, randomness0, uint8_t), to_hash); Eurydice_slice uu____0 = Eurydice_array_to_subslice_from( (size_t)64U, to_hash, LIBCRUX_ML_KEM_CONSTANTS_H_DIGEST_SIZE, uint8_t, size_t); uint8_t ret[32U]; libcrux_ml_kem_hash_functions_portable_H_f1_1a( Eurydice_array_to_slice((size_t)1184U, libcrux_ml_kem_types_as_slice_cb_50(public_key), uint8_t), ret); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)32U, ret, uint8_t), uint8_t); uint8_t hashed[64U]; libcrux_ml_kem_hash_functions_portable_G_f1_e4( Eurydice_array_to_slice((size_t)64U, to_hash, uint8_t), hashed); Eurydice_slice_uint8_t_x2 uu____1 = Eurydice_slice_split_at( Eurydice_array_to_slice((size_t)64U, hashed, uint8_t), LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice shared_secret = uu____1.fst; Eurydice_slice pseudorandomness = uu____1.snd; Eurydice_slice uu____2 = Eurydice_array_to_slice( (size_t)1184U, libcrux_ml_kem_types_as_slice_cb_50(public_key), uint8_t); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_randomness[32U]; memcpy(copy_of_randomness, randomness0, (size_t)32U * sizeof(uint8_t)); uint8_t ciphertext[1088U]; libcrux_ml_kem_ind_cpa_encrypt_60(uu____2, copy_of_randomness, pseudorandomness, ciphertext); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_ciphertext[1088U]; memcpy(copy_of_ciphertext, ciphertext, (size_t)1088U * sizeof(uint8_t)); libcrux_ml_kem_mlkem768_MlKem768Ciphertext ciphertext0 = libcrux_ml_kem_types_from_01_9f(copy_of_ciphertext); uint8_t shared_secret_array[32U]; libcrux_ml_kem_variant_kdf_d8_41(shared_secret, &ciphertext0, shared_secret_array); libcrux_ml_kem_mlkem768_MlKem768Ciphertext uu____5 = ciphertext0; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_shared_secret_array[32U]; memcpy(copy_of_shared_secret_array, shared_secret_array, (size_t)32U * sizeof(uint8_t)); tuple_3c lit; lit.fst = uu____5; memcpy(lit.snd, copy_of_shared_secret_array, (size_t)32U * sizeof(uint8_t)); return lit; } /** A monomorphic instance of libcrux_ml_kem.ind_cca.instantiations.portable.encapsulate with const generics - K= 3 - CIPHERTEXT_SIZE= 1088 - PUBLIC_KEY_SIZE= 1184 - T_AS_NTT_ENCODED_SIZE= 1152 - C1_SIZE= 960 - C2_SIZE= 128 - VECTOR_U_COMPRESSION_FACTOR= 10 - VECTOR_V_COMPRESSION_FACTOR= 4 - VECTOR_U_BLOCK_LEN= 320 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 - ETA2= 2 - ETA2_RANDOMNESS_SIZE= 128 */ static inline tuple_3c libcrux_ml_kem_ind_cca_instantiations_portable_encapsulate_c6( libcrux_ml_kem_types_MlKemPublicKey_15 *public_key, uint8_t randomness[32U]) { libcrux_ml_kem_types_MlKemPublicKey_15 *uu____0 = public_key; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_randomness[32U]; memcpy(copy_of_randomness, randomness, (size_t)32U * sizeof(uint8_t)); return libcrux_ml_kem_ind_cca_encapsulate_cd(uu____0, copy_of_randomness); } /** Encapsulate ML-KEM 768 Generates an ([`MlKem768Ciphertext`], [`MlKemSharedSecret`]) tuple. The input is a reference to an [`MlKem768PublicKey`] and [`SHARED_SECRET_SIZE`] bytes of `randomness`. */ static inline tuple_3c libcrux_ml_kem_mlkem768_portable_encapsulate( libcrux_ml_kem_types_MlKemPublicKey_15 *public_key, uint8_t randomness[32U]) { libcrux_ml_kem_types_MlKemPublicKey_15 *uu____0 = public_key; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_randomness[32U]; memcpy(copy_of_randomness, randomness, (size_t)32U * sizeof(uint8_t)); return libcrux_ml_kem_ind_cca_instantiations_portable_encapsulate_c6( uu____0, copy_of_randomness); } /** This function found in impl {(libcrux_ml_kem::variant::Variant for libcrux_ml_kem::variant::MlKem)#1} */ /** A monomorphic instance of libcrux_ml_kem.variant.cpa_keygen_seed_d8 with types libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_variant_cpa_keygen_seed_d8_0e( Eurydice_slice key_generation_seed, uint8_t ret[64U]) { uint8_t seed[33U] = {0U}; Eurydice_slice_copy( Eurydice_array_to_subslice2( seed, (size_t)0U, LIBCRUX_ML_KEM_CONSTANTS_CPA_PKE_KEY_GENERATION_SEED_SIZE, uint8_t), key_generation_seed, uint8_t); seed[LIBCRUX_ML_KEM_CONSTANTS_CPA_PKE_KEY_GENERATION_SEED_SIZE] = (uint8_t)(size_t)3U; uint8_t ret0[64U]; libcrux_ml_kem_hash_functions_portable_G_f1_e4( Eurydice_array_to_slice((size_t)33U, seed, uint8_t), ret0); memcpy(ret, ret0, (size_t)64U * sizeof(uint8_t)); } /** A monomorphic instance of libcrux_ml_kem.matrix.compute_As_plus_e.closure with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static inline libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_matrix_compute_As_plus_e_closure_87(size_t _i) { return libcrux_ml_kem_polynomial_ZERO_89_ea(); } /** A monomorphic instance of libcrux_ml_kem.vector.traits.to_standard_domain with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_traits_to_standard_domain_59( libcrux_ml_kem_vector_portable_vector_type_PortableVector v) { return libcrux_ml_kem_vector_portable_montgomery_multiply_by_constant_0d( v, LIBCRUX_ML_KEM_VECTOR_TRAITS_MONTGOMERY_R_SQUARED_MOD_FIELD_MODULUS); } /** This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.add_standard_error_reduce_89 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_polynomial_add_standard_error_reduce_89_03( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *self, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *error) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT; i++) { size_t j = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient_normal_form = libcrux_ml_kem_vector_traits_to_standard_domain_59( self->coefficients[j]); libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_barrett_reduce_0d( libcrux_ml_kem_vector_portable_add_0d(coefficient_normal_form, &error->coefficients[j])); self->coefficients[j] = uu____0; } } /** Compute  ◦ ŝ + ê */ /** A monomorphic instance of libcrux_ml_kem.matrix.compute_As_plus_e with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_matrix_compute_As_plus_e_60( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 (*matrix_A)[3U], libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *s_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *error_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 ret[3U]) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 result[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { result[i] = libcrux_ml_kem_polynomial_ZERO_89_ea(); } for (size_t i0 = (size_t)0U; i0 < Eurydice_slice_len( Eurydice_array_to_slice( (size_t)3U, matrix_A, libcrux_ml_kem_polynomial_PolynomialRingElement_f0[3U]), libcrux_ml_kem_polynomial_PolynomialRingElement_f0[3U]); i0++) { size_t i1 = i0; libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *row = matrix_A[i1]; for (size_t i = (size_t)0U; i < Eurydice_slice_len( Eurydice_array_to_slice( (size_t)3U, row, libcrux_ml_kem_polynomial_PolynomialRingElement_f0), libcrux_ml_kem_polynomial_PolynomialRingElement_f0); i++) { size_t j = i; libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *matrix_element = &row[j]; libcrux_ml_kem_polynomial_PolynomialRingElement_f0 product = libcrux_ml_kem_polynomial_ntt_multiply_89_2a(matrix_element, &s_as_ntt[j]); libcrux_ml_kem_polynomial_add_to_ring_element_89_84(&result[i1], &product); } libcrux_ml_kem_polynomial_add_standard_error_reduce_89_03( &result[i1], &error_as_ntt[i1]); } memcpy( ret, result, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); } /** A monomorphic instance of libcrux_ml_kem.serialize.serialize_uncompressed_ring_element with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_serialize_serialize_uncompressed_ring_element_5b( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *re, uint8_t ret[384U]) { uint8_t serialized[384U] = {0U}; for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT; i++) { size_t i0 = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient = libcrux_ml_kem_vector_traits_to_unsigned_representative_db( re->coefficients[i0]); uint8_t bytes[24U]; libcrux_ml_kem_vector_portable_serialize_12_0d(coefficient, bytes); Eurydice_slice uu____0 = Eurydice_array_to_subslice2( serialized, (size_t)24U * i0, (size_t)24U * i0 + (size_t)24U, uint8_t); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)24U, bytes, uint8_t), uint8_t); } memcpy(ret, serialized, (size_t)384U * sizeof(uint8_t)); } /** Call [`serialize_uncompressed_ring_element`] for each ring element. */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.serialize_secret_key with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - OUT_LEN= 1152 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_serialize_secret_key_b5( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *key, uint8_t ret[1152U]) { uint8_t out[1152U] = {0U}; for (size_t i = (size_t)0U; i < Eurydice_slice_len( Eurydice_array_to_slice( (size_t)3U, key, libcrux_ml_kem_polynomial_PolynomialRingElement_f0), libcrux_ml_kem_polynomial_PolynomialRingElement_f0); i++) { size_t i0 = i; libcrux_ml_kem_polynomial_PolynomialRingElement_f0 re = key[i0]; Eurydice_slice uu____0 = Eurydice_array_to_subslice2( out, i0 * LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT, (i0 + (size_t)1U) * LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT, uint8_t); uint8_t ret0[384U]; libcrux_ml_kem_serialize_serialize_uncompressed_ring_element_5b(&re, ret0); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)384U, ret0, uint8_t), uint8_t); } memcpy(ret, out, (size_t)1152U * sizeof(uint8_t)); } /** Concatenate `t` and `ρ` into the public key. */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.serialize_public_key with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - RANKED_BYTES_PER_RING_ELEMENT= 1152 - PUBLIC_KEY_SIZE= 1184 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_serialize_public_key_79( libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *t_as_ntt, Eurydice_slice seed_for_a, uint8_t ret[1184U]) { uint8_t public_key_serialized[1184U] = {0U}; Eurydice_slice uu____0 = Eurydice_array_to_subslice2( public_key_serialized, (size_t)0U, (size_t)1152U, uint8_t); uint8_t ret0[1152U]; libcrux_ml_kem_ind_cpa_serialize_secret_key_b5(t_as_ntt, ret0); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)1152U, ret0, uint8_t), uint8_t); Eurydice_slice_copy( Eurydice_array_to_subslice_from((size_t)1184U, public_key_serialized, (size_t)1152U, uint8_t, size_t), seed_for_a, uint8_t); memcpy(ret, public_key_serialized, (size_t)1184U * sizeof(uint8_t)); } /** A monomorphic instance of libcrux_ml_kem.ind_cpa.generate_keypair with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]], libcrux_ml_kem_variant_MlKem with const generics - K= 3 - PRIVATE_KEY_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 - RANKED_BYTES_PER_RING_ELEMENT= 1152 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 */ static inline libcrux_ml_kem_utils_extraction_helper_Keypair768 libcrux_ml_kem_ind_cpa_generate_keypair_fc(Eurydice_slice key_generation_seed) { uint8_t hashed[64U]; libcrux_ml_kem_variant_cpa_keygen_seed_d8_0e(key_generation_seed, hashed); Eurydice_slice_uint8_t_x2 uu____0 = Eurydice_slice_split_at( Eurydice_array_to_slice((size_t)64U, hashed, uint8_t), (size_t)32U, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice seed_for_A0 = uu____0.fst; Eurydice_slice seed_for_secret_and_error = uu____0.snd; libcrux_ml_kem_polynomial_PolynomialRingElement_f0 A_transpose[3U][3U]; uint8_t ret[34U]; libcrux_ml_kem_utils_into_padded_array_ea1(seed_for_A0, ret); libcrux_ml_kem_matrix_sample_matrix_A_38(ret, true, A_transpose); uint8_t prf_input[33U]; libcrux_ml_kem_utils_into_padded_array_ea2(seed_for_secret_and_error, prf_input); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_prf_input0[33U]; memcpy(copy_of_prf_input0, prf_input, (size_t)33U * sizeof(uint8_t)); tuple_b0 uu____2 = libcrux_ml_kem_ind_cpa_sample_vector_cbd_then_ntt_fc( copy_of_prf_input0, 0U); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 secret_as_ntt[3U]; memcpy( secret_as_ntt, uu____2.fst, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); uint8_t domain_separator = uu____2.snd; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_prf_input[33U]; memcpy(copy_of_prf_input, prf_input, (size_t)33U * sizeof(uint8_t)); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 error_as_ntt[3U]; memcpy( error_as_ntt, libcrux_ml_kem_ind_cpa_sample_vector_cbd_then_ntt_fc(copy_of_prf_input, domain_separator) .fst, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 t_as_ntt[3U]; libcrux_ml_kem_matrix_compute_As_plus_e_60(A_transpose, secret_as_ntt, error_as_ntt, t_as_ntt); uint8_t seed_for_A[32U]; Result_00 dst; Eurydice_slice_to_array2(&dst, seed_for_A0, Eurydice_slice, uint8_t[32U]); unwrap_41_83(dst, seed_for_A); uint8_t public_key_serialized[1184U]; libcrux_ml_kem_ind_cpa_serialize_public_key_79( t_as_ntt, Eurydice_array_to_slice((size_t)32U, seed_for_A, uint8_t), public_key_serialized); uint8_t secret_key_serialized[1152U]; libcrux_ml_kem_ind_cpa_serialize_secret_key_b5(secret_as_ntt, secret_key_serialized); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_secret_key_serialized[1152U]; memcpy(copy_of_secret_key_serialized, secret_key_serialized, (size_t)1152U * sizeof(uint8_t)); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_public_key_serialized[1184U]; memcpy(copy_of_public_key_serialized, public_key_serialized, (size_t)1184U * sizeof(uint8_t)); libcrux_ml_kem_utils_extraction_helper_Keypair768 lit; memcpy(lit.fst, copy_of_secret_key_serialized, (size_t)1152U * sizeof(uint8_t)); memcpy(lit.snd, copy_of_public_key_serialized, (size_t)1184U * sizeof(uint8_t)); return lit; } /** Serialize the secret key. */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.serialize_kem_secret_key with types libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - SERIALIZED_KEY_LEN= 2400 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_serialize_kem_secret_key_48( Eurydice_slice private_key, Eurydice_slice public_key, Eurydice_slice implicit_rejection_value, uint8_t ret[2400U]) { uint8_t out[2400U] = {0U}; size_t pointer = (size_t)0U; uint8_t *uu____0 = out; size_t uu____1 = pointer; size_t uu____2 = pointer; Eurydice_slice_copy( Eurydice_array_to_subslice2( uu____0, uu____1, uu____2 + Eurydice_slice_len(private_key, uint8_t), uint8_t), private_key, uint8_t); pointer = pointer + Eurydice_slice_len(private_key, uint8_t); uint8_t *uu____3 = out; size_t uu____4 = pointer; size_t uu____5 = pointer; Eurydice_slice_copy( Eurydice_array_to_subslice2( uu____3, uu____4, uu____5 + Eurydice_slice_len(public_key, uint8_t), uint8_t), public_key, uint8_t); pointer = pointer + Eurydice_slice_len(public_key, uint8_t); Eurydice_slice uu____6 = Eurydice_array_to_subslice2( out, pointer, pointer + LIBCRUX_ML_KEM_CONSTANTS_H_DIGEST_SIZE, uint8_t); uint8_t ret0[32U]; libcrux_ml_kem_hash_functions_portable_H_f1_1a(public_key, ret0); Eurydice_slice_copy( uu____6, Eurydice_array_to_slice((size_t)32U, ret0, uint8_t), uint8_t); pointer = pointer + LIBCRUX_ML_KEM_CONSTANTS_H_DIGEST_SIZE; uint8_t *uu____7 = out; size_t uu____8 = pointer; size_t uu____9 = pointer; Eurydice_slice_copy( Eurydice_array_to_subslice2( uu____7, uu____8, uu____9 + Eurydice_slice_len(implicit_rejection_value, uint8_t), uint8_t), implicit_rejection_value, uint8_t); memcpy(ret, out, (size_t)2400U * sizeof(uint8_t)); } /** Packed API Generate a key pair. Depending on the `Vector` and `Hasher` used, this requires different hardware features */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.generate_keypair with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]], libcrux_ml_kem_variant_MlKem with const generics - K= 3 - CPA_PRIVATE_KEY_SIZE= 1152 - PRIVATE_KEY_SIZE= 2400 - PUBLIC_KEY_SIZE= 1184 - BYTES_PER_RING_ELEMENT= 1152 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 */ static inline libcrux_ml_kem_mlkem768_MlKem768KeyPair libcrux_ml_kem_ind_cca_generate_keypair_8c(uint8_t randomness[64U]) { Eurydice_slice ind_cpa_keypair_randomness = Eurydice_array_to_subslice2( randomness, (size_t)0U, LIBCRUX_ML_KEM_CONSTANTS_CPA_PKE_KEY_GENERATION_SEED_SIZE, uint8_t); Eurydice_slice implicit_rejection_value = Eurydice_array_to_subslice_from( (size_t)64U, randomness, LIBCRUX_ML_KEM_CONSTANTS_CPA_PKE_KEY_GENERATION_SEED_SIZE, uint8_t, size_t); libcrux_ml_kem_utils_extraction_helper_Keypair768 uu____0 = libcrux_ml_kem_ind_cpa_generate_keypair_fc(ind_cpa_keypair_randomness); uint8_t ind_cpa_private_key[1152U]; memcpy(ind_cpa_private_key, uu____0.fst, (size_t)1152U * sizeof(uint8_t)); uint8_t public_key[1184U]; memcpy(public_key, uu____0.snd, (size_t)1184U * sizeof(uint8_t)); uint8_t secret_key_serialized[2400U]; libcrux_ml_kem_ind_cca_serialize_kem_secret_key_48( Eurydice_array_to_slice((size_t)1152U, ind_cpa_private_key, uint8_t), Eurydice_array_to_slice((size_t)1184U, public_key, uint8_t), implicit_rejection_value, secret_key_serialized); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_secret_key_serialized[2400U]; memcpy(copy_of_secret_key_serialized, secret_key_serialized, (size_t)2400U * sizeof(uint8_t)); libcrux_ml_kem_types_MlKemPrivateKey_55 private_key = libcrux_ml_kem_types_from_05_f2(copy_of_secret_key_serialized); libcrux_ml_kem_types_MlKemPrivateKey_55 uu____2 = private_key; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_public_key[1184U]; memcpy(copy_of_public_key, public_key, (size_t)1184U * sizeof(uint8_t)); return libcrux_ml_kem_types_from_17_35( uu____2, libcrux_ml_kem_types_from_b6_da(copy_of_public_key)); } /** Portable generate key pair. */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.instantiations.portable.generate_keypair with const generics - K= 3 - CPA_PRIVATE_KEY_SIZE= 1152 - PRIVATE_KEY_SIZE= 2400 - PUBLIC_KEY_SIZE= 1184 - BYTES_PER_RING_ELEMENT= 1152 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 */ static inline libcrux_ml_kem_mlkem768_MlKem768KeyPair libcrux_ml_kem_ind_cca_instantiations_portable_generate_keypair_d5( uint8_t randomness[64U]) { /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_randomness[64U]; memcpy(copy_of_randomness, randomness, (size_t)64U * sizeof(uint8_t)); return libcrux_ml_kem_ind_cca_generate_keypair_8c(copy_of_randomness); } /** Generate ML-KEM 768 Key Pair */ static inline libcrux_ml_kem_mlkem768_MlKem768KeyPair libcrux_ml_kem_mlkem768_portable_generate_key_pair(uint8_t randomness[64U]) { /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_randomness[64U]; memcpy(copy_of_randomness, randomness, (size_t)64U * sizeof(uint8_t)); return libcrux_ml_kem_ind_cca_instantiations_portable_generate_keypair_d5( copy_of_randomness); } /** This function found in impl {(libcrux_ml_kem::variant::Variant for libcrux_ml_kem::variant::Kyber)} */ /** A monomorphic instance of libcrux_ml_kem.variant.kdf_33 with types libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - CIPHERTEXT_SIZE= 1088 */ static KRML_MUSTINLINE void libcrux_ml_kem_variant_kdf_33_f0( Eurydice_slice shared_secret, libcrux_ml_kem_mlkem768_MlKem768Ciphertext *ciphertext, uint8_t ret[32U]) { uint8_t kdf_input[64U]; libcrux_ml_kem_utils_into_padded_array_ea(shared_secret, kdf_input); Eurydice_slice uu____0 = Eurydice_array_to_subslice_from( (size_t)64U, kdf_input, LIBCRUX_ML_KEM_CONSTANTS_H_DIGEST_SIZE, uint8_t, size_t); uint8_t ret0[32U]; libcrux_ml_kem_hash_functions_portable_H_f1_1a( Eurydice_array_to_slice((size_t)1088U, libcrux_ml_kem_types_as_slice_d4_1d(ciphertext), uint8_t), ret0); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)32U, ret0, uint8_t), uint8_t); uint8_t ret1[32U]; libcrux_ml_kem_hash_functions_portable_PRF_f1_ee( Eurydice_array_to_slice((size_t)64U, kdf_input, uint8_t), ret1); memcpy(ret, ret1, (size_t)32U * sizeof(uint8_t)); } /** A monomorphic instance of libcrux_ml_kem.ind_cca.decapsulate with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]], libcrux_ml_kem_variant_Kyber with const generics - K= 3 - SECRET_KEY_SIZE= 2400 - CPA_SECRET_KEY_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 - CIPHERTEXT_SIZE= 1088 - T_AS_NTT_ENCODED_SIZE= 1152 - C1_SIZE= 960 - C2_SIZE= 128 - VECTOR_U_COMPRESSION_FACTOR= 10 - VECTOR_V_COMPRESSION_FACTOR= 4 - C1_BLOCK_SIZE= 320 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 - ETA2= 2 - ETA2_RANDOMNESS_SIZE= 128 - IMPLICIT_REJECTION_HASH_INPUT_SIZE= 1120 */ static inline void libcrux_ml_kem_ind_cca_decapsulate_700( libcrux_ml_kem_types_MlKemPrivateKey_55 *private_key, libcrux_ml_kem_mlkem768_MlKem768Ciphertext *ciphertext, uint8_t ret[32U]) { Eurydice_slice_uint8_t_x2 uu____0 = Eurydice_slice_split_at( Eurydice_array_to_slice((size_t)2400U, private_key->value, uint8_t), (size_t)1152U, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice ind_cpa_secret_key = uu____0.fst; Eurydice_slice secret_key0 = uu____0.snd; Eurydice_slice_uint8_t_x2 uu____1 = Eurydice_slice_split_at( secret_key0, (size_t)1184U, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice ind_cpa_public_key = uu____1.fst; Eurydice_slice secret_key = uu____1.snd; Eurydice_slice_uint8_t_x2 uu____2 = Eurydice_slice_split_at( secret_key, LIBCRUX_ML_KEM_CONSTANTS_H_DIGEST_SIZE, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice ind_cpa_public_key_hash = uu____2.fst; Eurydice_slice implicit_rejection_value = uu____2.snd; uint8_t decrypted[32U]; libcrux_ml_kem_ind_cpa_decrypt_43(ind_cpa_secret_key, ciphertext->value, decrypted); uint8_t to_hash0[64U]; libcrux_ml_kem_utils_into_padded_array_ea( Eurydice_array_to_slice((size_t)32U, decrypted, uint8_t), to_hash0); Eurydice_slice_copy( Eurydice_array_to_subslice_from( (size_t)64U, to_hash0, LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE, uint8_t, size_t), ind_cpa_public_key_hash, uint8_t); uint8_t hashed[64U]; libcrux_ml_kem_hash_functions_portable_G_f1_e4( Eurydice_array_to_slice((size_t)64U, to_hash0, uint8_t), hashed); Eurydice_slice_uint8_t_x2 uu____3 = Eurydice_slice_split_at( Eurydice_array_to_slice((size_t)64U, hashed, uint8_t), LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice shared_secret0 = uu____3.fst; Eurydice_slice pseudorandomness = uu____3.snd; uint8_t to_hash[1120U]; libcrux_ml_kem_utils_into_padded_array_ea0(implicit_rejection_value, to_hash); Eurydice_slice uu____4 = Eurydice_array_to_subslice_from( (size_t)1120U, to_hash, LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE, uint8_t, size_t); Eurydice_slice_copy(uu____4, libcrux_ml_kem_types_as_ref_00_24(ciphertext), uint8_t); uint8_t implicit_rejection_shared_secret0[32U]; libcrux_ml_kem_hash_functions_portable_PRF_f1_ee( Eurydice_array_to_slice((size_t)1120U, to_hash, uint8_t), implicit_rejection_shared_secret0); Eurydice_slice uu____5 = ind_cpa_public_key; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_decrypted[32U]; memcpy(copy_of_decrypted, decrypted, (size_t)32U * sizeof(uint8_t)); uint8_t expected_ciphertext[1088U]; libcrux_ml_kem_ind_cpa_encrypt_60(uu____5, copy_of_decrypted, pseudorandomness, expected_ciphertext); uint8_t implicit_rejection_shared_secret[32U]; libcrux_ml_kem_variant_kdf_33_f0( Eurydice_array_to_slice((size_t)32U, implicit_rejection_shared_secret0, uint8_t), ciphertext, implicit_rejection_shared_secret); uint8_t shared_secret[32U]; libcrux_ml_kem_variant_kdf_33_f0(shared_secret0, ciphertext, shared_secret); uint8_t ret0[32U]; libcrux_ml_kem_constant_time_ops_compare_ciphertexts_select_shared_secret_in_constant_time( libcrux_ml_kem_types_as_ref_00_24(ciphertext), Eurydice_array_to_slice((size_t)1088U, expected_ciphertext, uint8_t), Eurydice_array_to_slice((size_t)32U, shared_secret, uint8_t), Eurydice_array_to_slice((size_t)32U, implicit_rejection_shared_secret, uint8_t), ret0); memcpy(ret, ret0, (size_t)32U * sizeof(uint8_t)); } /** Portable decapsulate */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.instantiations.portable.kyber_decapsulate with const generics - K= 3 - SECRET_KEY_SIZE= 2400 - CPA_SECRET_KEY_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 - CIPHERTEXT_SIZE= 1088 - T_AS_NTT_ENCODED_SIZE= 1152 - C1_SIZE= 960 - C2_SIZE= 128 - VECTOR_U_COMPRESSION_FACTOR= 10 - VECTOR_V_COMPRESSION_FACTOR= 4 - C1_BLOCK_SIZE= 320 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 - ETA2= 2 - ETA2_RANDOMNESS_SIZE= 128 - IMPLICIT_REJECTION_HASH_INPUT_SIZE= 1120 */ static inline void libcrux_ml_kem_ind_cca_instantiations_portable_kyber_decapsulate_fc( libcrux_ml_kem_types_MlKemPrivateKey_55 *private_key, libcrux_ml_kem_mlkem768_MlKem768Ciphertext *ciphertext, uint8_t ret[32U]) { libcrux_ml_kem_ind_cca_decapsulate_700(private_key, ciphertext, ret); } /** Decapsulate Kyber 768 Generates an [`MlKemSharedSecret`]. The input is a reference to an [`MlKem768PrivateKey`] and an [`MlKem768Ciphertext`]. */ static inline void libcrux_ml_kem_mlkem768_portable_kyber_decapsulate( libcrux_ml_kem_types_MlKemPrivateKey_55 *private_key, libcrux_ml_kem_mlkem768_MlKem768Ciphertext *ciphertext, uint8_t ret[32U]) { libcrux_ml_kem_ind_cca_instantiations_portable_kyber_decapsulate_fc( private_key, ciphertext, ret); } /** This function found in impl {(libcrux_ml_kem::variant::Variant for libcrux_ml_kem::variant::Kyber)} */ /** A monomorphic instance of libcrux_ml_kem.variant.entropy_preprocess_33 with types libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_variant_entropy_preprocess_33_8a( Eurydice_slice randomness, uint8_t ret[32U]) { libcrux_ml_kem_hash_functions_portable_H_f1_1a(randomness, ret); } /** A monomorphic instance of libcrux_ml_kem.ind_cca.encapsulate with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]], libcrux_ml_kem_variant_Kyber with const generics - K= 3 - CIPHERTEXT_SIZE= 1088 - PUBLIC_KEY_SIZE= 1184 - T_AS_NTT_ENCODED_SIZE= 1152 - C1_SIZE= 960 - C2_SIZE= 128 - VECTOR_U_COMPRESSION_FACTOR= 10 - VECTOR_V_COMPRESSION_FACTOR= 4 - VECTOR_U_BLOCK_LEN= 320 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 - ETA2= 2 - ETA2_RANDOMNESS_SIZE= 128 */ static inline tuple_3c libcrux_ml_kem_ind_cca_encapsulate_cd0( libcrux_ml_kem_types_MlKemPublicKey_15 *public_key, uint8_t randomness[32U]) { uint8_t randomness0[32U]; libcrux_ml_kem_variant_entropy_preprocess_33_8a( Eurydice_array_to_slice((size_t)32U, randomness, uint8_t), randomness0); uint8_t to_hash[64U]; libcrux_ml_kem_utils_into_padded_array_ea( Eurydice_array_to_slice((size_t)32U, randomness0, uint8_t), to_hash); Eurydice_slice uu____0 = Eurydice_array_to_subslice_from( (size_t)64U, to_hash, LIBCRUX_ML_KEM_CONSTANTS_H_DIGEST_SIZE, uint8_t, size_t); uint8_t ret[32U]; libcrux_ml_kem_hash_functions_portable_H_f1_1a( Eurydice_array_to_slice((size_t)1184U, libcrux_ml_kem_types_as_slice_cb_50(public_key), uint8_t), ret); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)32U, ret, uint8_t), uint8_t); uint8_t hashed[64U]; libcrux_ml_kem_hash_functions_portable_G_f1_e4( Eurydice_array_to_slice((size_t)64U, to_hash, uint8_t), hashed); Eurydice_slice_uint8_t_x2 uu____1 = Eurydice_slice_split_at( Eurydice_array_to_slice((size_t)64U, hashed, uint8_t), LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice shared_secret = uu____1.fst; Eurydice_slice pseudorandomness = uu____1.snd; Eurydice_slice uu____2 = Eurydice_array_to_slice( (size_t)1184U, libcrux_ml_kem_types_as_slice_cb_50(public_key), uint8_t); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_randomness[32U]; memcpy(copy_of_randomness, randomness0, (size_t)32U * sizeof(uint8_t)); uint8_t ciphertext[1088U]; libcrux_ml_kem_ind_cpa_encrypt_60(uu____2, copy_of_randomness, pseudorandomness, ciphertext); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_ciphertext[1088U]; memcpy(copy_of_ciphertext, ciphertext, (size_t)1088U * sizeof(uint8_t)); libcrux_ml_kem_mlkem768_MlKem768Ciphertext ciphertext0 = libcrux_ml_kem_types_from_01_9f(copy_of_ciphertext); uint8_t shared_secret_array[32U]; libcrux_ml_kem_variant_kdf_33_f0(shared_secret, &ciphertext0, shared_secret_array); libcrux_ml_kem_mlkem768_MlKem768Ciphertext uu____5 = ciphertext0; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_shared_secret_array[32U]; memcpy(copy_of_shared_secret_array, shared_secret_array, (size_t)32U * sizeof(uint8_t)); tuple_3c lit; lit.fst = uu____5; memcpy(lit.snd, copy_of_shared_secret_array, (size_t)32U * sizeof(uint8_t)); return lit; } /** Portable encapsulate */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.instantiations.portable.kyber_encapsulate with const generics - K= 3 - CIPHERTEXT_SIZE= 1088 - PUBLIC_KEY_SIZE= 1184 - T_AS_NTT_ENCODED_SIZE= 1152 - C1_SIZE= 960 - C2_SIZE= 128 - VECTOR_U_COMPRESSION_FACTOR= 10 - VECTOR_V_COMPRESSION_FACTOR= 4 - VECTOR_U_BLOCK_LEN= 320 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 - ETA2= 2 - ETA2_RANDOMNESS_SIZE= 128 */ static inline tuple_3c libcrux_ml_kem_ind_cca_instantiations_portable_kyber_encapsulate_7a( libcrux_ml_kem_types_MlKemPublicKey_15 *public_key, uint8_t randomness[32U]) { libcrux_ml_kem_types_MlKemPublicKey_15 *uu____0 = public_key; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_randomness[32U]; memcpy(copy_of_randomness, randomness, (size_t)32U * sizeof(uint8_t)); return libcrux_ml_kem_ind_cca_encapsulate_cd0(uu____0, copy_of_randomness); } /** Encapsulate Kyber 768 Generates an ([`MlKem768Ciphertext`], [`MlKemSharedSecret`]) tuple. The input is a reference to an [`MlKem768PublicKey`] and [`SHARED_SECRET_SIZE`] bytes of `randomness`. */ static inline tuple_3c libcrux_ml_kem_mlkem768_portable_kyber_encapsulate( libcrux_ml_kem_types_MlKemPublicKey_15 *public_key, uint8_t randomness[32U]) { libcrux_ml_kem_types_MlKemPublicKey_15 *uu____0 = public_key; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_randomness[32U]; memcpy(copy_of_randomness, randomness, (size_t)32U * sizeof(uint8_t)); return libcrux_ml_kem_ind_cca_instantiations_portable_kyber_encapsulate_7a( uu____0, copy_of_randomness); } /** This function found in impl {(libcrux_ml_kem::variant::Variant for libcrux_ml_kem::variant::Kyber)} */ /** A monomorphic instance of libcrux_ml_kem.variant.cpa_keygen_seed_33 with types libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_variant_cpa_keygen_seed_33_b6( Eurydice_slice key_generation_seed, uint8_t ret[64U]) { libcrux_ml_kem_hash_functions_portable_G_f1_e4(key_generation_seed, ret); } /** A monomorphic instance of libcrux_ml_kem.ind_cpa.generate_keypair with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]], libcrux_ml_kem_variant_Kyber with const generics - K= 3 - PRIVATE_KEY_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 - RANKED_BYTES_PER_RING_ELEMENT= 1152 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 */ static inline libcrux_ml_kem_utils_extraction_helper_Keypair768 libcrux_ml_kem_ind_cpa_generate_keypair_fc0( Eurydice_slice key_generation_seed) { uint8_t hashed[64U]; libcrux_ml_kem_variant_cpa_keygen_seed_33_b6(key_generation_seed, hashed); Eurydice_slice_uint8_t_x2 uu____0 = Eurydice_slice_split_at( Eurydice_array_to_slice((size_t)64U, hashed, uint8_t), (size_t)32U, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice seed_for_A0 = uu____0.fst; Eurydice_slice seed_for_secret_and_error = uu____0.snd; libcrux_ml_kem_polynomial_PolynomialRingElement_f0 A_transpose[3U][3U]; uint8_t ret[34U]; libcrux_ml_kem_utils_into_padded_array_ea1(seed_for_A0, ret); libcrux_ml_kem_matrix_sample_matrix_A_38(ret, true, A_transpose); uint8_t prf_input[33U]; libcrux_ml_kem_utils_into_padded_array_ea2(seed_for_secret_and_error, prf_input); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_prf_input0[33U]; memcpy(copy_of_prf_input0, prf_input, (size_t)33U * sizeof(uint8_t)); tuple_b0 uu____2 = libcrux_ml_kem_ind_cpa_sample_vector_cbd_then_ntt_fc( copy_of_prf_input0, 0U); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 secret_as_ntt[3U]; memcpy( secret_as_ntt, uu____2.fst, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); uint8_t domain_separator = uu____2.snd; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_prf_input[33U]; memcpy(copy_of_prf_input, prf_input, (size_t)33U * sizeof(uint8_t)); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 error_as_ntt[3U]; memcpy( error_as_ntt, libcrux_ml_kem_ind_cpa_sample_vector_cbd_then_ntt_fc(copy_of_prf_input, domain_separator) .fst, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 t_as_ntt[3U]; libcrux_ml_kem_matrix_compute_As_plus_e_60(A_transpose, secret_as_ntt, error_as_ntt, t_as_ntt); uint8_t seed_for_A[32U]; Result_00 dst; Eurydice_slice_to_array2(&dst, seed_for_A0, Eurydice_slice, uint8_t[32U]); unwrap_41_83(dst, seed_for_A); uint8_t public_key_serialized[1184U]; libcrux_ml_kem_ind_cpa_serialize_public_key_79( t_as_ntt, Eurydice_array_to_slice((size_t)32U, seed_for_A, uint8_t), public_key_serialized); uint8_t secret_key_serialized[1152U]; libcrux_ml_kem_ind_cpa_serialize_secret_key_b5(secret_as_ntt, secret_key_serialized); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_secret_key_serialized[1152U]; memcpy(copy_of_secret_key_serialized, secret_key_serialized, (size_t)1152U * sizeof(uint8_t)); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_public_key_serialized[1184U]; memcpy(copy_of_public_key_serialized, public_key_serialized, (size_t)1184U * sizeof(uint8_t)); libcrux_ml_kem_utils_extraction_helper_Keypair768 lit; memcpy(lit.fst, copy_of_secret_key_serialized, (size_t)1152U * sizeof(uint8_t)); memcpy(lit.snd, copy_of_public_key_serialized, (size_t)1184U * sizeof(uint8_t)); return lit; } /** Packed API Generate a key pair. Depending on the `Vector` and `Hasher` used, this requires different hardware features */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.generate_keypair with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]], libcrux_ml_kem_variant_Kyber with const generics - K= 3 - CPA_PRIVATE_KEY_SIZE= 1152 - PRIVATE_KEY_SIZE= 2400 - PUBLIC_KEY_SIZE= 1184 - BYTES_PER_RING_ELEMENT= 1152 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 */ static inline libcrux_ml_kem_mlkem768_MlKem768KeyPair libcrux_ml_kem_ind_cca_generate_keypair_8c0(uint8_t randomness[64U]) { Eurydice_slice ind_cpa_keypair_randomness = Eurydice_array_to_subslice2( randomness, (size_t)0U, LIBCRUX_ML_KEM_CONSTANTS_CPA_PKE_KEY_GENERATION_SEED_SIZE, uint8_t); Eurydice_slice implicit_rejection_value = Eurydice_array_to_subslice_from( (size_t)64U, randomness, LIBCRUX_ML_KEM_CONSTANTS_CPA_PKE_KEY_GENERATION_SEED_SIZE, uint8_t, size_t); libcrux_ml_kem_utils_extraction_helper_Keypair768 uu____0 = libcrux_ml_kem_ind_cpa_generate_keypair_fc0(ind_cpa_keypair_randomness); uint8_t ind_cpa_private_key[1152U]; memcpy(ind_cpa_private_key, uu____0.fst, (size_t)1152U * sizeof(uint8_t)); uint8_t public_key[1184U]; memcpy(public_key, uu____0.snd, (size_t)1184U * sizeof(uint8_t)); uint8_t secret_key_serialized[2400U]; libcrux_ml_kem_ind_cca_serialize_kem_secret_key_48( Eurydice_array_to_slice((size_t)1152U, ind_cpa_private_key, uint8_t), Eurydice_array_to_slice((size_t)1184U, public_key, uint8_t), implicit_rejection_value, secret_key_serialized); /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_secret_key_serialized[2400U]; memcpy(copy_of_secret_key_serialized, secret_key_serialized, (size_t)2400U * sizeof(uint8_t)); libcrux_ml_kem_types_MlKemPrivateKey_55 private_key = libcrux_ml_kem_types_from_05_f2(copy_of_secret_key_serialized); libcrux_ml_kem_types_MlKemPrivateKey_55 uu____2 = private_key; /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_public_key[1184U]; memcpy(copy_of_public_key, public_key, (size_t)1184U * sizeof(uint8_t)); return libcrux_ml_kem_types_from_17_35( uu____2, libcrux_ml_kem_types_from_b6_da(copy_of_public_key)); } /** A monomorphic instance of libcrux_ml_kem.ind_cca.instantiations.portable.kyber_generate_keypair with const generics - K= 3 - CPA_PRIVATE_KEY_SIZE= 1152 - PRIVATE_KEY_SIZE= 2400 - PUBLIC_KEY_SIZE= 1184 - BYTES_PER_RING_ELEMENT= 1152 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 */ static inline libcrux_ml_kem_mlkem768_MlKem768KeyPair libcrux_ml_kem_ind_cca_instantiations_portable_kyber_generate_keypair_9b( uint8_t randomness[64U]) { /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_randomness[64U]; memcpy(copy_of_randomness, randomness, (size_t)64U * sizeof(uint8_t)); return libcrux_ml_kem_ind_cca_generate_keypair_8c0(copy_of_randomness); } /** Generate Kyber 768 Key Pair */ static inline libcrux_ml_kem_mlkem768_MlKem768KeyPair libcrux_ml_kem_mlkem768_portable_kyber_generate_key_pair( uint8_t randomness[64U]) { /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_randomness[64U]; memcpy(copy_of_randomness, randomness, (size_t)64U * sizeof(uint8_t)); return libcrux_ml_kem_ind_cca_instantiations_portable_kyber_generate_keypair_9b( copy_of_randomness); } /** Validate an ML-KEM private key. This implements the Hash check in 7.3 3. Note that the size checks in 7.2 1 and 2 are covered by the `SECRET_KEY_SIZE` and `CIPHERTEXT_SIZE` in the `private_key` and `ciphertext` types. */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.validate_private_key with types libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - SECRET_KEY_SIZE= 2400 - CIPHERTEXT_SIZE= 1088 */ static KRML_MUSTINLINE bool libcrux_ml_kem_ind_cca_validate_private_key_e7( libcrux_ml_kem_types_MlKemPrivateKey_55 *private_key, libcrux_ml_kem_mlkem768_MlKem768Ciphertext *_ciphertext) { uint8_t t[32U]; libcrux_ml_kem_hash_functions_portable_H_f1_1a( Eurydice_array_to_subslice2(private_key->value, (size_t)384U * (size_t)3U, (size_t)768U * (size_t)3U + (size_t)32U, uint8_t), t); Eurydice_slice expected = Eurydice_array_to_subslice2( private_key->value, (size_t)768U * (size_t)3U + (size_t)32U, (size_t)768U * (size_t)3U + (size_t)64U, uint8_t); return core_array_equality___core__cmp__PartialEq__0___Slice_U____for__Array_T__N___3__eq( (size_t)32U, t, &expected, uint8_t, uint8_t, bool); } /** Portable private key validation */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.instantiations.portable.validate_private_key with const generics - K= 3 - SECRET_KEY_SIZE= 2400 - CIPHERTEXT_SIZE= 1088 */ static KRML_MUSTINLINE bool libcrux_ml_kem_ind_cca_instantiations_portable_validate_private_key_9c( libcrux_ml_kem_types_MlKemPrivateKey_55 *private_key, libcrux_ml_kem_mlkem768_MlKem768Ciphertext *ciphertext) { return libcrux_ml_kem_ind_cca_validate_private_key_e7(private_key, ciphertext); } /** Validate a private key. Returns `true` if valid, and `false` otherwise. */ static inline bool libcrux_ml_kem_mlkem768_portable_validate_private_key( libcrux_ml_kem_types_MlKemPrivateKey_55 *private_key, libcrux_ml_kem_mlkem768_MlKem768Ciphertext *ciphertext) { return libcrux_ml_kem_ind_cca_instantiations_portable_validate_private_key_9c( private_key, ciphertext); } /** A monomorphic instance of libcrux_ml_kem.serialize.deserialize_ring_elements_reduced.closure with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - PUBLIC_KEY_SIZE= 1184 - K= 3 */ static inline libcrux_ml_kem_polynomial_PolynomialRingElement_f0 libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_closure_cd0( size_t _i) { return libcrux_ml_kem_polynomial_ZERO_89_ea(); } /** This function deserializes ring elements and reduces the result by the field modulus. This function MUST NOT be used on secret inputs. */ /** A monomorphic instance of libcrux_ml_kem.serialize.deserialize_ring_elements_reduced with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - PUBLIC_KEY_SIZE= 1184 - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_330( Eurydice_slice public_key, libcrux_ml_kem_polynomial_PolynomialRingElement_f0 ret[3U]) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 deserialized_pk[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { deserialized_pk[i] = libcrux_ml_kem_polynomial_ZERO_89_ea(); } for (size_t i = (size_t)0U; i < Eurydice_slice_len(public_key, uint8_t) / LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT; i++) { size_t i0 = i; Eurydice_slice ring_element = Eurydice_slice_subslice2( public_key, i0 * LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT, i0 * LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT + LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT, uint8_t); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 uu____0 = libcrux_ml_kem_serialize_deserialize_to_reduced_ring_element_4c( ring_element); deserialized_pk[i0] = uu____0; } memcpy( ret, deserialized_pk, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_f0)); } /** Validate an ML-KEM public key. This implements the Modulus check in 7.2 2. Note that the size check in 7.2 1 is covered by the `PUBLIC_KEY_SIZE` in the `public_key` type. */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.validate_public_key with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - RANKED_BYTES_PER_RING_ELEMENT= 1152 - PUBLIC_KEY_SIZE= 1184 */ static KRML_MUSTINLINE bool libcrux_ml_kem_ind_cca_validate_public_key_19( uint8_t *public_key) { libcrux_ml_kem_polynomial_PolynomialRingElement_f0 deserialized_pk[3U]; libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_330( Eurydice_array_to_subslice_to((size_t)1184U, public_key, (size_t)1152U, uint8_t, size_t), deserialized_pk); libcrux_ml_kem_polynomial_PolynomialRingElement_f0 *uu____0 = deserialized_pk; uint8_t public_key_serialized[1184U]; libcrux_ml_kem_ind_cpa_serialize_public_key_79( uu____0, Eurydice_array_to_subslice_from((size_t)1184U, public_key, (size_t)1152U, uint8_t, size_t), public_key_serialized); return core_array_equality___core__cmp__PartialEq__Array_U__N___for__Array_T__N____eq( (size_t)1184U, public_key, public_key_serialized, uint8_t, uint8_t, bool); } /** Portable public key validation */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.instantiations.portable.validate_public_key with const generics - K= 3 - RANKED_BYTES_PER_RING_ELEMENT= 1152 - PUBLIC_KEY_SIZE= 1184 */ static KRML_MUSTINLINE bool libcrux_ml_kem_ind_cca_instantiations_portable_validate_public_key_4b( uint8_t *public_key) { return libcrux_ml_kem_ind_cca_validate_public_key_19(public_key); } /** Validate a public key. Returns `true` if valid, and `false` otherwise. */ static inline bool libcrux_ml_kem_mlkem768_portable_validate_public_key( libcrux_ml_kem_types_MlKemPublicKey_15 *public_key) { return libcrux_ml_kem_ind_cca_instantiations_portable_validate_public_key_4b( public_key->value); } /** This function found in impl {(core::clone::Clone for libcrux_ml_kem::vector::portable::vector_type::PortableVector)} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_vector_type_clone_3b( libcrux_ml_kem_vector_portable_vector_type_PortableVector *self) { return self[0U]; } typedef int16_t libcrux_ml_kem_vector_portable_vector_type_FieldElement; typedef int16_t libcrux_ml_kem_vector_portable_arithmetic_MontgomeryFieldElement; typedef int16_t libcrux_ml_kem_vector_portable_arithmetic_FieldElementTimesMontgomeryR; #if defined(__cplusplus) } #endif #define __libcrux_mlkem768_portable_H_DEFINED #endif /* rename some types to be a bit more ergonomic */ #define libcrux_mlkem768_keypair libcrux_ml_kem_mlkem768_MlKem768KeyPair_s #define libcrux_mlkem768_pk_valid_result Option_92_s #define libcrux_mlkem768_pk libcrux_ml_kem_types_MlKemPublicKey_15_s #define libcrux_mlkem768_sk libcrux_ml_kem_types_MlKemPrivateKey_55_s #define libcrux_mlkem768_ciphertext libcrux_ml_kem_mlkem768_MlKem768Ciphertext_s #define libcrux_mlkem768_enc_result tuple_3c_s /* defines for PRNG inputs */ #define LIBCRUX_ML_KEM_KEY_PAIR_PRNG_LEN 64 #define LIBCRUX_ML_KEM_ENC_PRNG_LEN 32 @ 1.1 log @Initial revision @ text @d1 2 a2 1 /* $OpenBSD: libcrux_mlkem768_sha3.h,v 1.1 2024/09/02 12:13:56 djm Exp $ */ d164 1 d170 1 a170 1 return v; d176 1 a176 1 return v; @ 1.1.1.1 log @Import OpenSSH-9.9 (previous was 9.8) Changes: Future deprecation notice ========================= OpenSSH plans to remove support for the DSA signature algorithm in early 2025. This release disables DSA by default at compile time. DSA, as specified in the SSHv2 protocol, is inherently weak - being limited to a 160 bit private key and use of the SHA1 digest. Its estimated security level is only 80 bits symmetric equivalent. OpenSSH has disabled DSA keys by default since 2015 but has retained run-time optional support for them. DSA was the only mandatory-to- implement algorithm in the SSHv2 RFCs, mostly because alternative algorithms were encumbered by patents when the SSHv2 protocol was specified. This has not been the case for decades at this point and better algorithms are well supported by all actively-maintained SSH implementations. We do not consider the costs of maintaining DSA in OpenSSH to be justified and hope that removing it from OpenSSH can accelerate its wider deprecation in supporting cryptography libraries. Currently DSA is disabled at compile time. The final step of removing DSA support entirely is planned for the first OpenSSH release of 2025. DSA support may be re-enabled on OpenBSD by setting "DSAKEY=yes" in Makefile.inc. To enable DSA support in portable OpenSSH, pass the "--enable-dsa-keys" option to configure. Potentially-incompatible changes -------------------------------- * ssh(1): remove support for pre-authentication compression. OpenSSH has only supported post-authentication compression in the server for some years. Compression before authentication significantly increases the attack surface of SSH servers and risks creating oracles that reveal information about information sent during authentication. * ssh(1), sshd(8): processing of the arguments to the "Match" configuration directive now follows more shell-like rules for quoted strings, including allowing nested quotes and \-escaped characters. If configurations contained workarounds for the previous simplistic quote handling then they may need to be adjusted. If this is the case, it's most likely to be in the arguments to a "Match exec" confition. In this case, moving the command to be evaluated from the Match line to an external shell script is easiest way to preserve compatibility with both the old and new versions. Changes since OpenSSH 9.8 ========================= This release contains a number of new features and bugfixes. New features ------------ * ssh(1), sshd(8): add support for a new hybrid post-quantum key exchange based on the FIPS 203 Module-Lattice Key Enapsulation mechanism (ML-KEM) combined with X25519 ECDH as described by https://datatracker.ietf.org/doc/html/draft-kampanakis-curdle-ssh-pq-ke-03 This algorithm "mlkem768x25519-sha256" is available by default. * ssh(1): the ssh_config "Include" directive can now expand environment as well as the same set of %-tokens "Match Exec" supports. * sshd(8): add a sshd_config "RefuseConnection" option that, if set will terminate the connection at the first authentication request. * sshd(8): add a "refuseconnection" penalty class to sshd_config PerSourcePenalties that is applied when a connection is dropped by the new RefuseConnection keyword. * sshd(8): add a "Match invalid-user" predicate to sshd_config Match options that matches when the target username is not valid on the server. * ssh(1), sshd(8): update the Streamlined NTRUPrime code to a substantially faster implementation. * ssh(1), sshd(8): the hybrid Streamlined NTRUPrime/X25519 key exchange algorithm now has an IANA-assigned name in addition to the "@@openssh.com" vendor extension name. This algorithm is now also available under this name "sntrup761x25519-sha512" * ssh(1), sshd(8), ssh-agent(1): prevent private keys from being included in core dump files for most of their lifespans. This is in addition to pre-existing controls in ssh-agent(1) and sshd(8) that prevented coredumps. This feature is supported on OpenBSD, Linux and FreeBSD. * All: convert key handling to use the libcrypto EVP_PKEY API, with the exception of DSA. * sshd(8): add a random amount of jitter (up to 4 seconds) to the grace login time to make its expiry unpredictable. Bugfixes -------- * sshd(8): relax absolute path requirement back to what it was prior to OpenSSH 9.8, which incorrectly required that sshd was started with an absolute path in inetd mode. bz3717 * sshd(8): fix regression introduced in openssh-9.8 that swapped the order of source and destination addresses in some sshd log messages. * sshd(8): do not apply authorized_keys options when signature verification fails. Prevents more restrictive key options being incorrectly applied to subsequent keys in authorized_keys. bz3733 * ssh-keygen(1): include pathname in some of ssh-keygen's passphrase prompts. Helps the user know what's going on when ssh-keygen is invoked via other tools. Requested in GHPR503 * ssh(1), ssh-add(1): make parsing user@@host consistently look for the last '@@' in the string rather than the first. This makes it possible to more consistently use usernames that contain '@@' characters. * ssh(1), sshd(8): be more strict in parsing key type names. Only allow short names (e.g "rsa") in user-interface code and require full SSH protocol names (e.g. "ssh-rsa") everywhere else. bz3725 * regress: many performance and correctness improvements to the re-keying regression test. * ssh-keygen(1): clarify that ed25519 is the default key type generated and clarify that rsa-sha2-512 is the default signature scheme when RSA is in use. GHPR505 * sshd(8): fix minor memory leak in Subsystem option parsing; GHPR515 * All: additional hardening and consistency checks for the sshbuf code. * sshd(8): reduce default logingrace penalty to ensure that a single forgotton login that times out will be below the penalty threshold. * ssh(1): fix proxy multiplexing (-O proxy) bug. If a mux started with ControlPersist then later has a forwarding added using mux proxy connection and the forwarding was used, then when the mux proxy session terminated, the mux master process would issue a bad message that terminated the connection. Portability ----------- * sync contrib/ssh-copy-id to the latest upstream version. * regress: improve portablility for some awk(1) usage (e.g. Solaris) * In the contrib/redhat RPM spec file, without_openssl was previously incorrectly enabled unconditionally. * sshd(8) restore audit call before exit that regressed in openssh-9.8 Fixes an issue where the SSH_CONNECTION_ABANDON event was not recorded. * sshd(8): add support for class-imposed loging restrictions on FreeBSD. Allowing auth_hostok(3) and auth_timeok(3) to control logins. * Build fixes for Musl libc. * Fix detection of setres*id on GNU/Hurd @ text @@ 1.1.1.2 log @Import OpenSSH-10.0 (Previous one was 9.9) Potentially-incompatible changes -------------------------------- * This release removes support for the weak DSA signature algorithm, completing the deprecation process that began in 2015 (when DSA was disabled by default) and repeatedly warned over the last 12 months. * scp(1), sftp(1): pass "ControlMaster no" to ssh when invoked by scp & sftp. This disables implicit session creation by these tools when ControlMaster was set to yes/auto by configuration, which some users found surprising. This change will not prevent scp/sftp from using an existing multiplexing session if one had already been created. GHPR557 * This release has the version number 10.0 and announces itself as "SSH-2.0-OpenSSH_10.0". Software that naively matches versions using patterns like "OpenSSH_1*" may be confused by this. * sshd(8): this release removes the code responsible for the user authentication phase of the protocol from the per- connection sshd-session binary to a new sshd-auth binary. Splitting this code into a separate binary ensures that the crucial pre-authentication attack surface has an entirely disjoint address space from the code used for the rest of the connection. It also yields a small runtime memory saving as the authentication code will be unloaded after the authentication phase completes. This change should be largely invisible to users, though some log messages may now come from "sshd-auth" instead of "sshd-session". Downstream distributors of OpenSSH will need to package the sshd-auth binary. * sshd(8): this release disables finite field (a.k.a modp) Diffie-Hellman key exchange in sshd by default. Specifically, this removes the "diffie-hellman-group*" and "diffie-hellman-group-exchange-*" methods from the default KEXAlgorithms list. The client is unchanged and continues to support these methods by default. Finite field Diffie Hellman is slow and computationally expensive for the same security level as Elliptic Curve DH or PQ key agreement while offering no redeeming advantages. ECDH has been specified for the SSH protocol for 15 years and some form of ECDH has been the default key exchange in OpenSSH for the last 14 years. * sshd(8): this release removes the implicit fallback to compiled- in groups for Diffie-Hellman Group Exchange KEX when the moduli file exists but does not contain moduli within the client- requested range. The fallback behaviour remains for the case where the moduli file does not exist at all. This allows administrators more explicit control over which DH groups will be selected, but can lead to connection failures if the moduli file is edited incorrectly. bz#2793 Changes since OpenSSH 9.9 ========================= This release contains a minor security fix as well as a number of feature improvements and bugfixes. Security ======== * sshd(8): fix the DisableForwarding directive, which was failing to disable X11 forwarding and agent forwarding as documented. X11 forwarding is disabled by default in the server and agent forwarding is off by default in the client. New features ------------ * ssh(1): the hybrid post-quantum algorithm mlkem768x25519-sha256 is now used by default for key agreement. This algorithm is considered to be safe against attack by quantum computers, is guaranteed to be no less strong than the popular curve25519-sha256 algorithm, has been standardised by NIST and is considerably faster than the previous default. * ssh(1): prefer AES-GCM to AES-CTR mode when selecting a cipher for the connection. The default cipher preference list is now Chacha20/Poly1305, AES-GCM (128/256) followed by AES-CTR (128/192/256). * ssh(1): add %-token and environment variable expansion to the ssh_config SetEnv directive. * ssh(1): allow %-token and environment variable expansion in the ssh_config User directive, with the exception of %r and %C which would be self-referential. bz#3477 * ssh(1), sshd(8): add "Match version" support to ssh_config and sshd_config. Allows matching on the local version of OpenSSH, e.g. "Match version OpenSSH_10.*". * ssh(1): add support for "Match sessiontype" to ssh_config. Allows matching on the type of session initially requested, either "shell" for interactive sessions, "exec" for command execution sessions, "subsystem" for subsystem requests, such as sftp, or "none" for transport/forwarding-only sessions. * ssh(1): add support for "Match command ..." support to ssh_config, allowing matching on the remote command as specified on the command-line. * ssh(1): allow 'Match tagged ""' and 'Match command ""' to match empty tag and command values respectively. * sshd(8): allow glob(3) patterns to be used in sshd_config AuthorizedKeysFile and AuthorizedPrincipalsFile directives. bz2755 * sshd(1): support the VersionAddendum in the client, mirroring the option of the same name in the server; bz2745 * ssh-agent(1): the agent will now delete all loaded keys when signaled with SIGUSR1. This allows deletion of keys without having access to $SSH_AUTH_SOCK. * Portable OpenSSH, ssh-agent(1): support systemd-style socket activation in ssh-agent using the LISTEN_PID/LISTEN_FDS mechanism. Activated when these environment variables are set, the agent is started with the -d or -D option and no socket path is set. GHPR502 * ssh-keygen(1): support FIDO tokens that return no attestation data, e.g. recent WinHello. GHPR542 * ssh-agent(1): add a "-Owebsafe-allow=..." option to allow the default FIDO application ID allow-list to be overridden. * Add a work-in-progress tool to verify FIDO attestation blobs that ssh-keygen can optionally write when enrolling FIDO keys. This tool is available under regress/misc/ssh-verify-attestation for experimentation but is not installed by "make install". * ssh-keygen(1): allow "-" as output file for moduli screening. GHPR393 Bugfixes -------- * sshd(8): remove assumption that the sshd_config and any configs it includes can fit in a (possibly enlarged) socket buffer. Previously it was possible to create a sufficiently large configuration that could cause sshd to fail to accept any connection. sshd(8) will now actively manage sending its config to the sshd-session sub-process. * ssh(1): don't start the ObscureKeystrokeTiming mitigations if there has been traffic on a X11 forwarding channel recently. Should fix X11 forwarding performance problems when this setting is enabled. bz3655 * ssh(1): prohibit the comma character in hostnames accepted, but allow an underscore as the first character in a hostname. * sftp(1): set high-water when resuming a "put". Prevents bogus "server reordered acks" debug message. * ssh(1), sshd(8): fix regression in openssh-9.8, which would fail to accept "Match criteria=argument" as well as the documented "Match criteria argument" syntax in ssh_config and sshd_config. bz3739 * sftp(1), ssh(1): fix a number possible NULL dereference bugs, including Coverity CIDs 405019 and 477813. * sshd(8): fix PerSourcePenalty incorrectly using "crash" penalty when LoginGraceTime was exceeded. bz3797 * sshd(8): fix "Match invalid-user" from incorrectly being activated in initial configuration pass when no other predicates were present on the match line * sshd(8): fix debug logging of user specific delay. GHPR#552 * sshd(8): improve debug logging across sub-process boundaries. Previously some log messages were lost early in the sshd-auth and sshd-session processes' life. * ssh(1): require control-escape character sequences passed via the '-e ^x' command-line to be exactly two characters long. Avoids one byte out-of-bounds read if ssh is invoked as "ssh -e^ ..." GHPR368 * ssh(1), sshd(8): prevent integer overflow in x11 port handling. These are theoretically possible if the admin misconfigured X11DisplayOffset or the user misconfigures their own $DISPLAY, but don't happen in normal operation. bz#3730 * ssh-keygen(1): don't mess up ssh-keygen -l output when the file contains CR characters; GHPR236 bz3385. * sshd(8): add rate limits to logging of connections dropped by PerSourcePenalties. Previously these could be noisy in logs. * ssh(1): fix argument of "Compression" directive in ssh -G config dump, which regressed in openssh-9.8. * sshd(8): fix a corner-case triggered by UpdateHostKeys when sshd refuses to accept the signature returned by an agent holding host keys during the hostkey rotation sub-protocol. This situation could occur in situations where a PKCS#11 smartcard that lacked support for particular signature algorithms was used to store host keys. * ssh-keygen(1): when using RSA keys to sign messages with "ssh-keygen -Y", select the signature algorithm based on the requested hash algorithm ("-Ohashalg=xxx"). This allows using something other than the default of rsa-sha2-512, which may not be supported on all signing backends, e.g. some smartcards only support SHA256. * ssh(1), sshd(8), ssh-keyscan(1): fix ML-KEM768x25519 KEX on big-endian systems. * Many regression and interop test improvements. Portability ----------- * All: add support for AWS-LC (AWS libcrypto). bz3784 * sshd(8): add wtmpdb support as a Y2038 safe wtmp replacement. * sshd(8): add support for locking sshd into memory, enabled with the --with-linux-memlock-onfault configure flag. * Add support for building a standalone sk-libfido2 library, enabled by --with-security-key-standalone * ssh(1), sshd(8), ssh-keyscan(1): include __builtin_popcount replacement function. for compilers that lack it. * All: Check for and replace le32toh, le64toh, htole64 separately. It appears that at least some versions of endian.h in glibc do not have the latter two. bz#3794 * Remove ancient RHL 6.x config in RPM spec. @ text @d1 1 a1 2 /* $OpenBSD: libcrux_mlkem768_sha3.h,v 1.2 2024/10/27 02:06:01 djm Exp $ */ a162 1 v = htole64(v); d168 1 a168 1 return le64toh(v); d174 1 a174 1 return le32toh(v); @ 1.1.1.3 log @Import OpenSSH-10.3 (previous was 10.2) OpenSSH 10.3 was released on 2026-04-02. It is available from the mirrors listed at https://www.openssh.com/. OpenSSH is a 100% complete SSH protocol 2.0 implementation and includes sftp client and server support. Once again, we would like to thank the OpenSSH community for their continued support of the project, especially those who contributed code or patches, reported bugs, tested snapshots or donated to the project. More information on donations may be found at: https://www.openssh.com/donations.html Potentially-incompatible changes -------------------------------- * ssh(1), sshd(8): remove bug compatibility for implementations that don't support rekeying. If such an implementation tries to interoperate with OpenSSH, it will now eventually fail when the transport needs rekeying. * sshd(8): prior to this release, a certificate that had an empty principals section would be treated as matching any principal (i.e. as a wildcard) when used via authorized_keys principals="" option. This was intentional, but created a surprising and potentially risky situation if a CA accidentally issued a certificate with an empty principals section: instead of being useless as one might expect, it could be used to authenticate as any user who trusted the CA via authorized_keys. [Note that this condition did not apply to CAs trusted via the sshd_config(5) TrustedUserCAKeys option.] This release treats an empty principals section as never matching any principal, and also fixes interpretation of wildcard characters in certificate principals. Now they are consistently implemented for host certificates and not supported for user certificates. * ssh(1): the -J and equivalent -oProxyJump="..." options now validate user and host names for ProxyJump/-J options passed via the command-line (no such validation is performed for this option in configuration files). This prevents shell injection in situations where these were directly exposed to adversarial input, which would have been a terrible idea to begin with. Reported by rabbit. Changes since OpenSSH 10.2 ========================== This release contains some relatively minor security fixes as well as a number of feature improvements and general bugfixes. Security ======== * ssh(1): validation of shell metacharacters in user names supplied on the command-line was performed too late to prevent some situations where they could be expanded from %-tokens in ssh_config. For certain configurations, such as those that use a "%u" token in a "Match exec" block, an attacker who can control the user name passed to ssh(1) could potentially execute arbitrary shell commands. Reported by Florian Kohnhäuser. We continue to recommend against directly exposing ssh(1) and other tools' command-lines to untrusted input. Mitigations such as this can not be absolute given the variety of shells and user configurations in use. * sshd(8): when matching an authorized_keys principals="" option against a list of principals in a certificate, an incorrect algorithm was used that could allow inappropriate matching in cases where a principal name in the certificate contains a comma character. Exploitation of the condition requires an authorized_keys principals="" option that lists more than one principal *and* a CA that will issue a certificate that encodes more than one of these principal names separated by a comma (typical CAs stronly constrain which principal names they will place in a certificate). This condition only applies to user- trusted CA keys in authorized_keys, the main certificate authentication path (TrustedUserCAKeys/AuthorizedPrincipalsFile) is not affected. Reported by Vladimir Tokarev. * scp(1): when downloading files as root in legacy (-O) mode and without the -p (preserve modes) flag set, scp did not clear setuid/setgid bits from downloaded files as one might typically expect. This bug dates back to the original Berkeley rcp program. Reported by Christos Papakonstantinou of Cantina and Spearbit. * sshd(8): fix incomplete application of PubkeyAcceptedAlgorithms and HostbasedAcceptedAlgorithms with regard to ECDSA keys. Previously if one of these directives contains any ECDSA algorithm name (say "ecdsa-sha2-nistp384"), then any other ECDSA algorithm would be accepted in its place regardless of whether it was listed or not. Reported by Christos Papakonstantinou of Cantina and Spearbit. * ssh(1): connection multiplexing confirmation (requested using "ControlMaster ask/autoask") was not being tested for proxy mode multiplexing sessions (i.e. "ssh -O proxy ..."). Reported by Michalis Vasileiadis. New features ------------ * ssh(1), sshd(8): support IANA-assigned codepoints for SSH agent forwarding, as per draft-ietf-sshm-ssh-agent. Support for the new names is advertised via the EXT_INFO message. If a server offers support for the new names, then they are used preferentially. Support for the pre-standardisation "@@openssh.com" extensions for agent forwarding remains supported. * ssh-agent(1): implement support for draft-ietf-sshm-ssh-agent "query" extension. * ssh-add(1): support querying the protocol extensions via the agent "query" extension with a new -Q flag. * ssh(1): support multiple files in a ssh_config RevokedHostKeys directive. bz3918 * sshd(8): support multiple files in a sshd_config RevokedKeys directive bz3918 * ssh(1): add a ~I escape option that shows information about the current SSH connection. * ssh(1): add an "ssh -Oconninfo user@@host" multiplexing command that shows connection information, similar to the ~I escapechar. * ssh(1): add an "ssh -O channels user@@host" multiplexing command to get a running mux process to show information about what channels are currently open. * sshd(8): add 'invaliduser' penalty to PerSourcePenalties, which is applied to login attempts for usernames that do not match real accounts. Defaults to 5s to match 'authfail' but allows administrators to block such attempts for longer if desired. * sshd(8): add a GSSAPIDelegateCredentials option for the server, controlling whether it accepts delegated credentials offered by the client. This option mirrors the same option in ssh_config. GHPR614 * ssh(1), sshd(8): support the VA DSCP codepoint in the IPQoS directive. * sshd(8): convert PerSourcePenalties to using floating point time, allowing penalties to be less than a second. This is useful if you need to penalise things you expect to occur at >=1 QPS. * ssh-keygen(1): support writing ED25519 keys in PKCS8 format. GHPR570 * Support the ed25519 signature scheme via libcrypto. Bugfixes -------- * sshd(8): make IPQoS first-match-wins in sshd_config, like other configuration directives. bz3924 * sshd(8): fix potential crash when MaxStartups is using a single argument (i.e. not using the MaxStartps x:y:z form) to a value below 10. bz3941 * sshd(8): fix a potential hang during key exchange if needed DH group values were missing from /etc/moduli. * ssh-agent(1): fix return values from extensions to be correct wrt draft-ietf-sshm-ssh-agent: extension requests should indicate failure using SSH_AGENT_EXTENSION_FAILURE rather than the generic SSH_AGENT_FAILURE error code. This allows the client to discern between "the request failed" and "the agent doesn't support this extension". * ssh(1): use fmprintf for showing challenge-response name and info to preserve UTF-8 characters where appropriate. Prompted by GitHub PR#452. * scp(1): when uploading a directory using sftp/sftp (e.g. during a recursive transfer), don't clobber the remote directory permissions unless either we created the directory during the transfer or the -p flag was set. bz3925 * All: implement missing pieces of FIDO/webauthn signature support, mostly related to certificate handling and enable acceptance of this signature format by default. bz3748 GHPR624 GHPR625 * sshd_config(5): make it clear that DenyUsers/DenyGroups overrides AllowUsers/AllowGroups. Previously we specified the order in which the directives are processed but it was ambiguous as to what happened if both matched. * ssh(1): don't try to match certificates held in an agent to private keys. This matching is done to support certificates that were loaded without their private key material, but is unnecessary for agent-hosted certificate which always have private key material available in the agent. Worse, this matching would mess up the request sent to the agent in such a way as to break usage of these keys when the key usage was restricted in the agent. bz3752 * sftp(1): if editline has been switched to vi mode (i.e. via "bind -v" in .editrc), setup a keybinding so that command mode can be entered. * ssh(1), sshd(8): improve performance of keying the sntrup761 key agreement algorithm. * ssh(1), sshd(8): enforce maximum packet/block limit during pre-authentication phase. * sftp(1): don't misuse the sftp limits extension's open-handles field. This value is supposed to be the number of handles a server will allow to be opened and not a number of outstanding read/write requests that can be sent during an upload/download. * sshd(8): don't crash at connection time if the main sshd_config lacks any subsystem directive but one is defined in a Match block. bz3906 * sshd_config(5): add a warning next to the ForceCommand directive that forcing a command doesn't automatically disable forwarding. * sshd_config(5): add a warning that TOKENS are replaced without filtering or escaping and that it's the administrator's responsibility to ensure they are used safely in context. * scp(1): correctly quote filenames in verbose output for local-> local copies. bz3900 * sshd(8): don't mess up the PerSourceNetBlockSize IPv6 mask if sscanf didn't decode it. GHPR598 * ssh-add(1): when loading FIDO2 resident keys, set the comment to the FIDO application string. This matches the behaviour of ssh-keygen -K. GHPR608 * sshd(8): don't strnvis() log messages that are going to be logged by sshd-auth via its parent sshd-session process, as the parent will also run them though strnvis(). Prevents double-escaping of non-printing characters in some log messages. bz3896 * ssh-agent(1): escape SSH_AUTH_SOCK paths that are sent to the shell as setenv commands. Unbreaks ssh-agent for home directory paths that contain whitespace. bz3884 * All: Remove unnecessary checks for ECDSA public key validity. * sshd(8): activate UnusedConnectionTimeout only after the last channel has closed. Previously UnusedConnectionTimeout could fire early after a ChannelTimeout. This was not a problem for the OpenSSH client because it terminates once all channels have closed but could cause problems for other clients (e.g. API clients) that do things differently. bz3827 * All: fix PKCS#11 key PIN entry problems introduced in openssh-10.1/10.2. bz3879 * scp(1): when using the SFTP protocol for transfers, fix implicit destination path selection when source path ends with "..". bz3871 * sftp(1): when tab-completing a filename, ensure that the completed string does not end up mid-way through a multibyte character, as this will cause a fatal() later on. GHPR#587 * ssh-keygen(1): fix crash at exit (visible via ssh-keygen -D) when multiple keys loaded. * scp(1)/sftp(1): correctly display bandwidths >2GBps in the progress meter. Portability ----------- * sshd(8): fix condition intoduced in openssh 10.2p1 stable branch here a PAM module that changed the requested username between SSH_MSG_USERAUTH_REQUEST messages during authentication could confuse the PAM stack and let it proceed with a different understanding of the active username than the rest of sshd. Reported by Mike Damm. * sshd(8): immediately report interactive instructions to clients when using keyboard-interactive authentication with PAM. bz2876 * sshd(8): fix duplicate PAM messages under some situations. * sshd(8): don't leak PAM handle on repeat invocations. bz3882 * All: support linking libcrypto implementations (e.g. BoringSSL) that require libstdc++. * sshd(8): fix ut_type for btmp records, correctly using LOGIN_PROCESS and USER_PROCESS. * sshd(8): allow uname(3) in the seccomp sandbox. This is needed by zlib-ng on RISC-V platforms. * All: remove remaining OpenSSL_add_all_algorithms() calls. We already have OPENSSL_init_crypto() in the compat layer. Prompted by github PR#606 * All: fix builds on older Mac OS wrt nfds_t. * mdoc2man: several improvements including better support for Dl and Ns inside Ic. @ text @d1 1 a1 1 /* $OpenBSD: libcrux_mlkem768_sha3.h,v 1.4 2025/11/13 05:13:06 djm Exp $ */ d3 1 a3 1 /* Extracted from libcrux revision 026a87ab6d88ad3626b9fbbf3710d1e0483c1849 */ d37 7 a43 12 static inline void store64_le(uint8_t dst[8], uint64_t src) { dst[0] = src & 0xff; dst[1] = (src >> 8) & 0xff; dst[2] = (src >> 16) & 0xff; dst[3] = (src >> 24) & 0xff; dst[4] = (src >> 32) & 0xff; dst[5] = (src >> 40) & 0xff; dst[6] = (src >> 48) & 0xff; dst[7] = (src >> 56) & 0xff; } d45 1 a45 8 static inline void store32_le(uint8_t dst[4], uint32_t src) { dst[0] = src & 0xff; dst[1] = (src >> 8) & 0xff; dst[2] = (src >> 16) & 0xff; dst[3] = (src >> 24) & 0xff; } d47 2 a48 38 static inline void store32_be(uint8_t dst[4], uint32_t src) { dst[0] = (src >> 24) & 0xff; dst[1] = (src >> 16) & 0xff; dst[2] = (src >> 8) & 0xff; dst[3] = src & 0xff; } static inline uint64_t load64_le(uint8_t src[8]) { return (uint64_t)(src[0]) | ((uint64_t)(src[1]) << 8) | ((uint64_t)(src[2]) << 16) | ((uint64_t)(src[3]) << 24) | ((uint64_t)(src[4]) << 32) | ((uint64_t)(src[5]) << 40) | ((uint64_t)(src[6]) << 48) | ((uint64_t)(src[7]) << 56); } static inline uint32_t load32_le(uint8_t src[4]) { return (uint32_t)(src[0]) | ((uint32_t)(src[1]) << 8) | ((uint32_t)(src[2]) << 16) | ((uint32_t)(src[3]) << 24); } #ifdef MISSING_BUILTIN_POPCOUNT static inline unsigned int __builtin_popcount(unsigned int num) { const int v[16] = { 0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4 }; return v[num & 0xf] + v[(num >> 4) & 0xf]; } a50 2 /* from libcrux/libcrux-ml-kem/extracts/c_header_only/generated/eurydice_glue.h */ #pragma once d53 1 a53 6 #ifdef _MSC_VER // For __popcnt #endif // C++ HELPERS d55 3 d59 1 a59 14 #ifndef KRML_HOST_EPRINTF #define KRML_HOST_EPRINTF(...) fprintf(stderr, __VA_ARGS__) #endif #ifndef __cpp_lib_type_identity template struct type_identity { using type = T; }; template using type_identity_t = typename type_identity::type; d61 1 a61 1 using std::type_identity_t; a63 24 #define KRML_UNION_CONSTRUCTOR(T) \ template \ constexpr T(int t, V U::*m, type_identity_t v) : tag(t) { \ val.*m = std::move(v); \ } \ T() = default; #endif // GENERAL-PURPOSE STUFF #define LowStar_Ignore_ignore(e, t, _ret_t) ((void)e) #define EURYDICE_ASSERT(test, msg) \ do { \ if (!(test)) { \ fprintf(stderr, "assertion \"%s\" failed: file \"%s\", line %d\n", msg, \ __FILE__, __LINE__); \ exit(255); \ } \ } while (0) // SLICES, ARRAYS, ETC. d68 3 a70 2 // performing pointer arithmetic on it (remember that C desugars pointer // arithmetic based on the type of the address) d72 2 a73 1 // need to multiply it by sizeof t, where t is the type of the elements. d75 3 a77 3 // Empty slices have `len == 0` and `ptr` always needs to be a valid pointer // that is not NULL (otherwise the construction in EURYDICE_SLICE computes `NULL // + start`). a82 13 #if defined(__cplusplus) #define KRML_CLITERAL(type) type #else #define KRML_CLITERAL(type) (type) #endif #if defined(__cplusplus) && defined(__cpp_designated_initializers) || \ !(defined(__cplusplus)) #define EURYDICE_CFIELD(X) X #else #define EURYDICE_CFIELD(X) #endif d88 2 a89 6 (KRML_CLITERAL(Eurydice_slice){(void *)(x + start), end - start}) // Slice length #define EURYDICE_SLICE_LEN(s, _) (s).len #define Eurydice_slice_len(s, _) (s).len d96 1 a96 4 // The following functions get sub slices from a slice. #define Eurydice_slice_subslice(s, r, t, _0, _1) \ a97 1 d101 2 a102 8 EURYDICE_SLICE((t *)s.ptr, (start), (end)) // Previous version above does not work when t is an array type (as usual). Will // be deprecated soon. #define Eurydice_slice_subslice3(s, start, end, t_ptr) \ EURYDICE_SLICE((t_ptr)s.ptr, (start), (end)) #define Eurydice_slice_subslice_to(s, subslice_end_pos, t, _0, _1) \ d104 1 a104 2 #define Eurydice_slice_subslice_from(s, subslice_start_pos, t, _0, _1) \ a105 1 d109 1 a109 1 #define Eurydice_array_to_subslice(_arraylen, x, r, t, _0, _1) \ a110 1 d113 2 a114 12 EURYDICE_SLICE((t *)x, (start), (end)) // Same as above, variant for when start and end are statically known #define Eurydice_array_to_subslice3(x, start, end, t_ptr) \ EURYDICE_SLICE((t_ptr)x, (start), (end)) #define Eurydice_array_repeat(dst, len, init, t) \ ERROR "should've been desugared" // The following functions convert an array into a slice. #define Eurydice_array_to_subslice_to(_size, x, r, t, _range_t, _0) \ d116 1 a116 1 #define Eurydice_array_to_subslice_from(size, x, r, t, _range_t, _0) \ d118 1 a118 2 // Copy a slice with memcopy d121 2 d124 2 a125 5 #define core_array___Array_T__N___as_slice(len_, ptr_, t, _ret_t) \ KRML_CLITERAL(Eurydice_slice) { ptr_, len_ } #define core_array__core__clone__Clone_for__Array_T__N___clone( \ len, src, dst, elem_type, _ret_t) \ a127 7 #define core_array_TryFromSliceError uint8_t #define Eurydice_array_eq(sz, a1, a2, t) (memcmp(a1, a2, sz * sizeof(t)) == 0) // core::cmp::PartialEq<&0 (@@Slice)> for @@Array #define Eurydice_array_eq_slice(sz, a1, s2, t, _) \ (memcmp(a1, (s2)->ptr, sz * sizeof(t)) == 0) d129 2 d138 9 a146 19 #define Eurydice_slice_split_at(slice, mid, element_type, ret_t) \ KRML_CLITERAL(ret_t) { \ EURYDICE_CFIELD(.fst =) \ EURYDICE_SLICE((element_type *)(slice).ptr, 0, mid), \ EURYDICE_CFIELD(.snd =) \ EURYDICE_SLICE((element_type *)(slice).ptr, mid, (slice).len) \ } #define Eurydice_slice_split_at_mut(slice, mid, element_type, ret_t) \ KRML_CLITERAL(ret_t) { \ EURYDICE_CFIELD(.fst =) \ KRML_CLITERAL(Eurydice_slice){EURYDICE_CFIELD(.ptr =)(slice.ptr), \ EURYDICE_CFIELD(.len =) mid}, \ EURYDICE_CFIELD(.snd =) KRML_CLITERAL(Eurydice_slice) { \ EURYDICE_CFIELD(.ptr =) \ ((char *)slice.ptr + mid * sizeof(element_type)), \ EURYDICE_CFIELD(.len =)(slice.len - mid) \ } \ } d151 1 a151 1 #define Eurydice_slice_to_array2(dst, src, _0, t_arr, _1) \ a160 31 // SUPPORT FOR DSTs (Dynamically-Sized Types) // A DST is a fat pointer that keeps tracks of the size of it flexible array // member. Slices are a specific case of DSTs, where [T; N] implements // Unsize<[T]>, meaning an array of statically known size can be converted to a // fat pointer, i.e. a slice. // // Unlike slices, DSTs have a built-in definition that gets monomorphized, of // the form: // // typedef struct { // T *ptr; // size_t len; // number of elements // } Eurydice_dst; // // Furthermore, T = T0<[U0]> where `struct T0`, where the `U` is the // last field. This means that there are two monomorphizations of T0 in the // program. One is `T0<[V; N]>` // -- this is directly converted to a Eurydice_dst via suitable codegen (no // macro). The other is `T = T0<[U]>`, where `[U]` gets emitted to // `Eurydice_derefed_slice`, a type that only appears in that precise situation // and is thus defined to give rise to a flexible array member. typedef char Eurydice_derefed_slice[]; #define Eurydice_slice_of_dst(fam_ptr, len_, t, _) \ ((Eurydice_slice){.ptr = (void *)(fam_ptr), .len = len_}) #define Eurydice_slice_of_boxed_array(ptr_, len_, t, _) \ ((Eurydice_slice){.ptr = (void *)(ptr_), .len = len_}) d163 3 a165 31 // We slap extern "C" on declarations that intend to implement a prototype // generated by Eurydice, because Eurydice prototypes are always emitted within // an extern "C" block, UNLESS you use -fcxx17-compat, in which case, you must // pass -DKRML_CXX17_COMPAT="" to your C++ compiler. #if defined(__cplusplus) && !defined(KRML_CXX17_COMPAT) extern "C" { #endif static inline void core_num__u32__to_be_bytes(uint32_t src, uint8_t dst[4]) { store32_be(dst, src); } static inline void core_num__u32__to_le_bytes(uint32_t src, uint8_t dst[4]) { store32_le(dst, src); } static inline uint32_t core_num__u32__from_le_bytes(uint8_t buf[4]) { return load32_le(buf); } static inline void core_num__u64__to_le_bytes(uint64_t v, uint8_t buf[8]) { store64_le(buf, v); } static inline uint64_t core_num__u64__from_le_bytes(uint8_t buf[8]) { return load64_le(buf); } static inline int64_t core_convert_num___core__convert__From_i32__for_i64__from( int32_t x) { return x; d167 4 a170 14 static inline uint64_t core_convert_num___core__convert__From_u8__for_u64__from( uint8_t x) { return x; } static inline uint64_t core_convert_num___core__convert__From_u16__for_u64__from(uint16_t x) { return x; } static inline size_t core_convert_num___core__convert__From_u16__for_usize__from(uint16_t x) { return x; d173 4 a176 6 static inline uint32_t core_num__u8__count_ones(uint8_t x0) { #ifdef _MSC_VER return __popcnt(x0); #else return __builtin_popcount(x0); #endif d179 1 a179 1 static inline uint32_t core_num__i32__count_ones(int32_t x0) { a186 8 static inline size_t core_cmp_impls___core__cmp__Ord_for_usize__min(size_t a, size_t b) { if (a <= b) return a; else return b; } d188 1 a188 1 static inline uint16_t core_num__u16__wrapping_add(uint16_t x, uint16_t y) { d191 1 a191 1 static inline uint8_t core_num__u8__wrapping_sub(uint8_t x, uint8_t y) { a193 40 static inline uint64_t core_num__u64__rotate_left(uint64_t x0, uint32_t x1) { return (x0 << x1 | x0 >> (64 - x1)); } static inline void core_ops_arith__i32__add_assign(int32_t *x0, int32_t *x1) { *x0 = *x0 + *x1; } static inline uint8_t Eurydice_bitand_pv_u8(uint8_t *p, uint8_t v) { return (*p) & v; } static inline uint8_t Eurydice_shr_pv_u8(uint8_t *p, int32_t v) { return (*p) >> v; } static inline uint32_t Eurydice_min_u32(uint32_t x, uint32_t y) { return x < y ? x : y; } static inline uint8_t core_ops_bit___core__ops__bit__BitAnd_u8__u8__for___a__u8___46__bitand( uint8_t *x0, uint8_t x1) { return Eurydice_bitand_pv_u8(x0, x1); } static inline uint8_t core_ops_bit___core__ops__bit__Shr_i32__u8__for___a__u8___792__shr(uint8_t *x0, int32_t x1) { return Eurydice_shr_pv_u8(x0, x1); } #define core_num_nonzero_private_NonZeroUsizeInner size_t static inline core_num_nonzero_private_NonZeroUsizeInner core_num_nonzero_private___core__clone__Clone_for_core__num__nonzero__private__NonZeroUsizeInner__26__clone( core_num_nonzero_private_NonZeroUsizeInner *x0) { return *x0; } #if defined(__cplusplus) && !defined(KRML_CXX17_COMPAT) } #endif d197 4 a200 6 #define Eurydice_range_iter_next(iter_ptr, t, ret_t) \ (((iter_ptr)->start >= (iter_ptr)->end) \ ? (KRML_CLITERAL(ret_t){EURYDICE_CFIELD(.tag =) 0, \ EURYDICE_CFIELD(.f0 =) 0}) \ : (KRML_CLITERAL(ret_t){EURYDICE_CFIELD(.tag =) 1, \ EURYDICE_CFIELD(.f0 =)(iter_ptr)->start++})) d202 1 a202 1 #define core_iter_range___core__iter__traits__iterator__Iterator_A__for_core__ops__range__Range_A__TraitClause_0___6__next \ d206 2 a207 2 #define Eurydice_into_iter(x, t, _ret_t, _) (x) #define core_iter_traits_collect___core__iter__traits__collect__IntoIterator_Clause1_Item__I__for_I__1__into_iter \ d210 1 a210 82 typedef struct { Eurydice_slice slice; size_t chunk_size; } Eurydice_chunks; // Can't use macros Eurydice_slice_subslice_{to,from} because they require a // type, and this static inline function cannot receive a type as an argument. // Instead, we receive the element size and use it to peform manual offset // computations rather than going through the macros. static inline Eurydice_slice chunk_next(Eurydice_chunks *chunks, size_t element_size) { size_t chunk_size = chunks->slice.len >= chunks->chunk_size ? chunks->chunk_size : chunks->slice.len; Eurydice_slice curr_chunk; curr_chunk.ptr = chunks->slice.ptr; curr_chunk.len = chunk_size; chunks->slice.ptr = (char *)(chunks->slice.ptr) + chunk_size * element_size; chunks->slice.len = chunks->slice.len - chunk_size; return curr_chunk; } #define core_slice___Slice_T___chunks(slice_, sz_, t, _ret_t) \ ((Eurydice_chunks){.slice = slice_, .chunk_size = sz_}) #define core_slice___Slice_T___chunks_exact(slice_, sz_, t, _ret_t) \ ((Eurydice_chunks){ \ .slice = {.ptr = slice_.ptr, .len = slice_.len - (slice_.len % sz_)}, \ .chunk_size = sz_}) #define core_slice_iter_Chunks Eurydice_chunks #define core_slice_iter_ChunksExact Eurydice_chunks #define Eurydice_chunks_next(iter, t, ret_t) \ (((iter)->slice.len == 0) ? ((ret_t){.tag = core_option_None}) \ : ((ret_t){.tag = core_option_Some, \ .f0 = chunk_next(iter, sizeof(t))})) #define core_slice_iter___core__iter__traits__iterator__Iterator_for_core__slice__iter__Chunks__a__T___70__next \ Eurydice_chunks_next // This name changed on 20240627 #define core_slice_iter___core__iter__traits__iterator__Iterator_for_core__slice__iter__Chunks__a__T___71__next \ Eurydice_chunks_next #define core_slice_iter__core__slice__iter__ChunksExact__a__T__89__next( \ iter, t, _ret_t) \ core_slice_iter__core__slice__iter__Chunks__a__T__70__next(iter, t) typedef struct { Eurydice_slice s; size_t index; } Eurydice_slice_iterator; #define core_slice___Slice_T___iter(x, t, _ret_t) \ ((Eurydice_slice_iterator){.s = x, .index = 0}) #define core_slice_iter_Iter Eurydice_slice_iterator #define core_slice_iter__core__slice__iter__Iter__a__T__181__next(iter, t, \ ret_t) \ (((iter)->index == (iter)->s.len) \ ? (KRML_CLITERAL(ret_t){.tag = core_option_None}) \ : (KRML_CLITERAL(ret_t){ \ .tag = core_option_Some, \ .f0 = ((iter)->index++, \ &((t *)((iter)->s.ptr))[(iter)->index - 1])})) #define core_option__core__option__Option_T__TraitClause_0___is_some(X, _0, \ _1) \ ((X)->tag == 1) // STRINGS typedef const char *Prims_string; // MISC (UNTESTED) typedef void *core_fmt_Formatter; typedef void *core_fmt_Arguments; typedef void *core_fmt_rt_Argument; #define core_fmt_rt__core__fmt__rt__Argument__a__1__new_display(x1, x2, x3, \ x4) \ NULL // BOXES // Crimes. static inline char *malloc_and_init(size_t sz, char *init) { char *ptr = (char *)malloc(sz); memcpy(ptr, init, sz); return ptr; d212 1 d214 1 a214 7 #define Eurydice_box_new(init, t, t_dst) \ ((t_dst)(malloc_and_init(sizeof(t), (char *)(&init)))) #define Eurydice_box_new_array(len, ptr, t, t_dst) \ ((t_dst)(malloc_and_init(len * sizeof(t), (char *)(ptr)))) /* from libcrux/libcrux-ml-kem/extracts/c_header_only/generated/libcrux_mlkem_core.h */ d216 1 a216 1 * SPDX-FileCopyrightText: 2025 Cryspen Sarl d221 5 a225 5 * Charon: 667d2fc98984ff7f3df989c2367e6c1fa4a000e7 * Eurydice: 2381cbc416ef2ad0b561c362c500bc84f36b6785 * Karamel: 80f5435f2fc505973c469a4afcc8d875cddd0d8b * F*: 71d8221589d4d438af3706d89cb653cf53e18aab * Libcrux: 68dfed5a4a9e40277f62828471c029afed1ecdcc d228 2 a229 3 #ifndef libcrux_mlkem_core_H #define libcrux_mlkem_core_H d235 1 d241 1 a241 1 typedef struct core_ops_range_Range_08_s { d244 15 a258 1 } core_ops_range_Range_08; d260 7 a266 1 static inline uint16_t core_num__u16__wrapping_add(uint16_t x0, uint16_t x1); d268 1 a268 1 static inline uint64_t core_num__u64__from_le_bytes(uint8_t x0[8U]); d270 1 a270 1 static inline uint64_t core_num__u64__rotate_left(uint64_t x0, uint32_t x1); d272 1 a272 1 static inline void core_num__u64__to_le_bytes(uint64_t x0, uint8_t x1[8U]); d274 1 a274 1 static inline uint32_t core_num__u8__count_ones(uint8_t x0); d276 1 a276 1 static inline uint8_t core_num__u8__wrapping_sub(uint8_t x0, uint8_t x1); d292 1 a292 1 #define LIBCRUX_ML_KEM_CONSTANTS_G_DIGEST_SIZE ((size_t)64U) d294 4 a297 1 #define LIBCRUX_ML_KEM_CONSTANTS_H_DIGEST_SIZE ((size_t)32U) d300 2 a301 1 K * BITS_PER_RING_ELEMENT / 8 a302 2 [eurydice] Note that we can't use const generics here because that breaks C extraction with eurydice. d304 7 a310 4 static inline size_t libcrux_ml_kem_constants_ranked_bytes_per_ring_element( size_t rank) { return rank * LIBCRUX_ML_KEM_CONSTANTS_BITS_PER_RING_ELEMENT / (size_t)8U; } d313 1 a313 1 This function found in impl {libcrux_secrets::traits::Classify for T} d316 2 a317 2 A monomorphic instance of libcrux_secrets.int.public_integers.classify_27 with types uint8_t d320 10 a329 3 static KRML_MUSTINLINE uint8_t libcrux_secrets_int_public_integers_classify_27_90(uint8_t self) { return self; d333 14 a346 1 This function found in impl {libcrux_secrets::traits::Declassify for T} d349 2 a350 2 A monomorphic instance of libcrux_secrets.int.public_integers.declassify_d8 with types int16_t d353 10 a362 3 static KRML_MUSTINLINE int16_t libcrux_secrets_int_public_integers_declassify_d8_39(int16_t self) { return self; d366 3 a368 1 This function found in impl {libcrux_secrets::int::CastOps for i16} d370 7 a376 4 static KRML_MUSTINLINE uint8_t libcrux_secrets_int_as_u8_f5(int16_t self) { return libcrux_secrets_int_public_integers_classify_27_90( (uint8_t)libcrux_secrets_int_public_integers_declassify_d8_39(self)); } d379 1 a379 1 This function found in impl {libcrux_secrets::traits::Classify for T} d382 2 a383 2 A monomorphic instance of libcrux_secrets.int.public_integers.classify_27 with types int16_t d386 10 a395 3 static KRML_MUSTINLINE int16_t libcrux_secrets_int_public_integers_classify_27_39(int16_t self) { return self; d398 12 d411 1 a411 1 This function found in impl {libcrux_secrets::traits::Declassify for T} d414 3 a416 3 A monomorphic instance of libcrux_secrets.int.public_integers.declassify_d8 with types uint8_t d418 3 a420 3 static KRML_MUSTINLINE uint8_t libcrux_secrets_int_public_integers_declassify_d8_90(uint8_t self) { return self; d424 3 a426 1 This function found in impl {libcrux_secrets::int::CastOps for u8} d428 3 a430 4 static KRML_MUSTINLINE int16_t libcrux_secrets_int_as_i16_59(uint8_t self) { return libcrux_secrets_int_public_integers_classify_27_39( (int16_t)libcrux_secrets_int_public_integers_declassify_d8_90(self)); } d433 2 a434 1 This function found in impl {libcrux_secrets::traits::Classify for T} d437 3 a439 3 A monomorphic instance of libcrux_secrets.int.public_integers.classify_27 with types int32_t d441 8 a448 3 static KRML_MUSTINLINE int32_t libcrux_secrets_int_public_integers_classify_27_a8(int32_t self) { return self; d452 3 a454 1 This function found in impl {libcrux_secrets::int::CastOps for i16} d456 8 a463 4 static KRML_MUSTINLINE int32_t libcrux_secrets_int_as_i32_f5(int16_t self) { return libcrux_secrets_int_public_integers_classify_27_a8( (int32_t)libcrux_secrets_int_public_integers_declassify_d8_39(self)); } d466 1 a466 1 This function found in impl {libcrux_secrets::traits::Declassify for T} d469 2 a470 3 A monomorphic instance of libcrux_secrets.int.public_integers.declassify_d8 with types int32_t a471 5 static KRML_MUSTINLINE int32_t libcrux_secrets_int_public_integers_declassify_d8_a8(int32_t self) { return self; } d473 4 a476 1 This function found in impl {libcrux_secrets::int::CastOps for i32} d478 5 a482 3 static KRML_MUSTINLINE int16_t libcrux_secrets_int_as_i16_36(int32_t self) { return libcrux_secrets_int_public_integers_classify_27_39( (int16_t)libcrux_secrets_int_public_integers_declassify_d8_a8(self)); d486 2 a487 1 This function found in impl {libcrux_secrets::traits::Declassify for T} d490 3 a492 3 A monomorphic instance of libcrux_secrets.int.public_integers.declassify_d8 with types uint32_t d494 8 a501 3 static KRML_MUSTINLINE uint32_t libcrux_secrets_int_public_integers_declassify_d8_df(uint32_t self) { return self; d505 3 a507 1 This function found in impl {libcrux_secrets::int::CastOps for u32} d509 7 a515 4 static KRML_MUSTINLINE int32_t libcrux_secrets_int_as_i32_b8(uint32_t self) { return libcrux_secrets_int_public_integers_classify_27_a8( (int32_t)libcrux_secrets_int_public_integers_declassify_d8_df(self)); } d518 1 a518 1 This function found in impl {libcrux_secrets::traits::Classify for T} d521 2 a522 2 A monomorphic instance of libcrux_secrets.int.public_integers.classify_27 with types uint16_t d525 1 a525 318 static KRML_MUSTINLINE uint16_t libcrux_secrets_int_public_integers_classify_27_de(uint16_t self) { return self; } /** This function found in impl {libcrux_secrets::int::CastOps for i16} */ static KRML_MUSTINLINE uint16_t libcrux_secrets_int_as_u16_f5(int16_t self) { return libcrux_secrets_int_public_integers_classify_27_de( (uint16_t)libcrux_secrets_int_public_integers_declassify_d8_39(self)); } /** This function found in impl {libcrux_secrets::traits::Declassify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.declassify_d8 with types uint16_t */ static KRML_MUSTINLINE uint16_t libcrux_secrets_int_public_integers_declassify_d8_de(uint16_t self) { return self; } /** This function found in impl {libcrux_secrets::int::CastOps for u16} */ static KRML_MUSTINLINE int16_t libcrux_secrets_int_as_i16_ca(uint16_t self) { return libcrux_secrets_int_public_integers_classify_27_39( (int16_t)libcrux_secrets_int_public_integers_declassify_d8_de(self)); } /** This function found in impl {libcrux_secrets::traits::Classify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.classify_27 with types uint64_t */ static KRML_MUSTINLINE uint64_t libcrux_secrets_int_public_integers_classify_27_49(uint64_t self) { return self; } /** This function found in impl {libcrux_secrets::int::CastOps for u16} */ static KRML_MUSTINLINE uint64_t libcrux_secrets_int_as_u64_ca(uint16_t self) { return libcrux_secrets_int_public_integers_classify_27_49( (uint64_t)libcrux_secrets_int_public_integers_declassify_d8_de(self)); } /** This function found in impl {libcrux_secrets::traits::Classify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.classify_27 with types uint32_t */ static KRML_MUSTINLINE uint32_t libcrux_secrets_int_public_integers_classify_27_df(uint32_t self) { return self; } /** This function found in impl {libcrux_secrets::traits::Declassify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.declassify_d8 with types uint64_t */ static KRML_MUSTINLINE uint64_t libcrux_secrets_int_public_integers_declassify_d8_49(uint64_t self) { return self; } /** This function found in impl {libcrux_secrets::int::CastOps for u64} */ static KRML_MUSTINLINE uint32_t libcrux_secrets_int_as_u32_a3(uint64_t self) { return libcrux_secrets_int_public_integers_classify_27_df( (uint32_t)libcrux_secrets_int_public_integers_declassify_d8_49(self)); } /** This function found in impl {libcrux_secrets::int::CastOps for u32} */ static KRML_MUSTINLINE int16_t libcrux_secrets_int_as_i16_b8(uint32_t self) { return libcrux_secrets_int_public_integers_classify_27_39( (int16_t)libcrux_secrets_int_public_integers_declassify_d8_df(self)); } /** This function found in impl {libcrux_secrets::int::CastOps for i16} */ static KRML_MUSTINLINE int16_t libcrux_secrets_int_as_i16_f5(int16_t self) { return libcrux_secrets_int_public_integers_classify_27_39( libcrux_secrets_int_public_integers_declassify_d8_39(self)); } typedef struct libcrux_ml_kem_utils_extraction_helper_Keypair768_s { uint8_t fst[1152U]; uint8_t snd[1184U]; } libcrux_ml_kem_utils_extraction_helper_Keypair768; #define Ok 0 #define Err 1 typedef uint8_t Result_b2_tags; /** A monomorphic instance of core.result.Result with types uint8_t[24size_t], core_array_TryFromSliceError */ typedef struct Result_b2_s { Result_b2_tags tag; union { uint8_t case_Ok[24U]; TryFromSliceError case_Err; } val; } Result_b2; /** This function found in impl {core::result::Result[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of core.result.unwrap_26 with types uint8_t[24size_t], core_array_TryFromSliceError */ static inline void unwrap_26_70(Result_b2 self, uint8_t ret[24U]) { if (self.tag == Ok) { uint8_t f0[24U]; memcpy(f0, self.val.case_Ok, (size_t)24U * sizeof(uint8_t)); memcpy(ret, f0, (size_t)24U * sizeof(uint8_t)); } else { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "unwrap not Ok"); KRML_HOST_EXIT(255U); } } /** A monomorphic instance of core.result.Result with types uint8_t[20size_t], core_array_TryFromSliceError */ typedef struct Result_e1_s { Result_b2_tags tag; union { uint8_t case_Ok[20U]; TryFromSliceError case_Err; } val; } Result_e1; /** This function found in impl {core::result::Result[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of core.result.unwrap_26 with types uint8_t[20size_t], core_array_TryFromSliceError */ static inline void unwrap_26_20(Result_e1 self, uint8_t ret[20U]) { if (self.tag == Ok) { uint8_t f0[20U]; memcpy(f0, self.val.case_Ok, (size_t)20U * sizeof(uint8_t)); memcpy(ret, f0, (size_t)20U * sizeof(uint8_t)); } else { KRML_HOST_EPRINTF("KaRaMeL abort at %s:%d\n%s\n", __FILE__, __LINE__, "unwrap not Ok"); KRML_HOST_EXIT(255U); } } /** Pad the `slice` with `0`s at the end. */ /** A monomorphic instance of libcrux_ml_kem.utils.into_padded_array with const generics - LEN= 32 */ static KRML_MUSTINLINE void libcrux_ml_kem_utils_into_padded_array_9e( Eurydice_slice slice, uint8_t ret[32U]) { uint8_t out[32U] = {0U}; uint8_t *uu____0 = out; Eurydice_slice_copy( Eurydice_array_to_subslice3( uu____0, (size_t)0U, Eurydice_slice_len(slice, uint8_t), uint8_t *), slice, uint8_t); memcpy(ret, out, (size_t)32U * sizeof(uint8_t)); } /** A monomorphic instance of libcrux_ml_kem.types.MlKemPrivateKey with const generics - $2400size_t */ typedef struct libcrux_ml_kem_types_MlKemPrivateKey_d9_s { uint8_t value[2400U]; } libcrux_ml_kem_types_MlKemPrivateKey_d9; /** This function found in impl {core::default::Default for libcrux_ml_kem::types::MlKemPrivateKey} */ /** A monomorphic instance of libcrux_ml_kem.types.default_d3 with const generics - SIZE= 2400 */ static inline libcrux_ml_kem_types_MlKemPrivateKey_d9 libcrux_ml_kem_types_default_d3_28(void) { return ( KRML_CLITERAL(libcrux_ml_kem_types_MlKemPrivateKey_d9){.value = {0U}}); } /** A monomorphic instance of libcrux_ml_kem.types.MlKemPublicKey with const generics - $1184size_t */ typedef struct libcrux_ml_kem_types_MlKemPublicKey_30_s { uint8_t value[1184U]; } libcrux_ml_kem_types_MlKemPublicKey_30; /** This function found in impl {core::convert::From<@@Array> for libcrux_ml_kem::types::MlKemPublicKey} */ /** A monomorphic instance of libcrux_ml_kem.types.from_fd with const generics - SIZE= 1184 */ static inline libcrux_ml_kem_types_MlKemPublicKey_30 libcrux_ml_kem_types_from_fd_d0(uint8_t value[1184U]) { /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_value[1184U]; memcpy(copy_of_value, value, (size_t)1184U * sizeof(uint8_t)); libcrux_ml_kem_types_MlKemPublicKey_30 lit; memcpy(lit.value, copy_of_value, (size_t)1184U * sizeof(uint8_t)); return lit; } typedef struct libcrux_ml_kem_mlkem768_MlKem768KeyPair_s { libcrux_ml_kem_types_MlKemPrivateKey_d9 sk; libcrux_ml_kem_types_MlKemPublicKey_30 pk; } libcrux_ml_kem_mlkem768_MlKem768KeyPair; /** This function found in impl {libcrux_ml_kem::types::MlKemKeyPair} */ /** A monomorphic instance of libcrux_ml_kem.types.from_17 with const generics - PRIVATE_KEY_SIZE= 2400 - PUBLIC_KEY_SIZE= 1184 */ static inline libcrux_ml_kem_mlkem768_MlKem768KeyPair libcrux_ml_kem_types_from_17_74(libcrux_ml_kem_types_MlKemPrivateKey_d9 sk, libcrux_ml_kem_types_MlKemPublicKey_30 pk) { return (KRML_CLITERAL(libcrux_ml_kem_mlkem768_MlKem768KeyPair){.sk = sk, .pk = pk}); } /** This function found in impl {core::convert::From<@@Array> for libcrux_ml_kem::types::MlKemPrivateKey} */ /** A monomorphic instance of libcrux_ml_kem.types.from_77 with const generics - SIZE= 2400 */ static inline libcrux_ml_kem_types_MlKemPrivateKey_d9 libcrux_ml_kem_types_from_77_28(uint8_t value[2400U]) { /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_value[2400U]; memcpy(copy_of_value, value, (size_t)2400U * sizeof(uint8_t)); libcrux_ml_kem_types_MlKemPrivateKey_d9 lit; memcpy(lit.value, copy_of_value, (size_t)2400U * sizeof(uint8_t)); return lit; } /** A monomorphic instance of core.result.Result with types uint8_t[32size_t], core_array_TryFromSliceError */ typedef struct Result_fb_s { Result_b2_tags tag; union { uint8_t case_Ok[32U]; TryFromSliceError case_Err; } val; } Result_fb; /** This function found in impl {core::result::Result[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of core.result.unwrap_26 with types uint8_t[32size_t], core_array_TryFromSliceError */ static inline void unwrap_26_b3(Result_fb self, uint8_t ret[32U]) { a536 4 typedef struct libcrux_ml_kem_mlkem768_MlKem768Ciphertext_s { uint8_t value[1088U]; } libcrux_ml_kem_mlkem768_MlKem768Ciphertext; d543 1 a543 1 typedef struct tuple_c2_s { d546 1 a546 1 } tuple_c2; d549 2 a550 2 This function found in impl {core::convert::From<@@Array> for libcrux_ml_kem::types::MlKemCiphertext} d553 1 a553 1 A monomorphic instance of libcrux_ml_kem.types.from_e0 d558 1 a558 1 libcrux_ml_kem_types_from_e0_80(uint8_t value[1088U]) { d568 1 a568 6 This function found in impl {libcrux_ml_kem::types::MlKemPublicKey} */ /** A monomorphic instance of libcrux_ml_kem.types.as_slice_e6 with const generics - SIZE= 1184 a569 5 static inline uint8_t *libcrux_ml_kem_types_as_slice_e6_d0( libcrux_ml_kem_types_MlKemPublicKey_30 *self) { return self->value; } d571 1 a571 1 This function found in impl {libcrux_ml_kem::types::MlKemCiphertext} d574 1 a574 1 A monomorphic instance of libcrux_ml_kem.types.as_slice_a9 d576 1 a576 1 - SIZE= 1088 d578 2 a579 2 static inline uint8_t *libcrux_ml_kem_types_as_slice_a9_80( libcrux_ml_kem_mlkem768_MlKem768Ciphertext *self) { a583 15 A monomorphic instance of libcrux_ml_kem.utils.prf_input_inc with const generics - K= 3 */ static KRML_MUSTINLINE uint8_t libcrux_ml_kem_utils_prf_input_inc_e0( uint8_t (*prf_inputs)[33U], uint8_t domain_separator) { for (size_t i = (size_t)0U; i < (size_t)3U; i++) { size_t i0 = i; prf_inputs[i0][32U] = domain_separator; domain_separator = (uint32_t)domain_separator + 1U; } return domain_separator; } /** d591 1 a591 1 static KRML_MUSTINLINE void libcrux_ml_kem_utils_into_padded_array_c8( d596 2 a597 2 Eurydice_array_to_subslice3( uu____0, (size_t)0U, Eurydice_slice_len(slice, uint8_t), uint8_t *), d610 1 a610 1 static KRML_MUSTINLINE void libcrux_ml_kem_utils_into_padded_array_b6( d615 2 a616 2 Eurydice_array_to_subslice3( uu____0, (size_t)0U, Eurydice_slice_len(slice, uint8_t), uint8_t *), d622 2 a623 2 This function found in impl {core::convert::AsRef<@@Slice> for libcrux_ml_kem::types::MlKemCiphertext} d626 1 a626 1 A monomorphic instance of libcrux_ml_kem.types.as_ref_d3 d630 1 a630 1 static inline Eurydice_slice libcrux_ml_kem_types_as_ref_d3_80( d643 1 a643 1 static KRML_MUSTINLINE void libcrux_ml_kem_utils_into_padded_array_15( d648 2 a649 2 Eurydice_array_to_subslice3( uu____0, (size_t)0U, Eurydice_slice_len(slice, uint8_t), uint8_t *), d662 1 a662 1 static KRML_MUSTINLINE void libcrux_ml_kem_utils_into_padded_array_24( d667 2 a668 2 Eurydice_array_to_subslice3( uu____0, (size_t)0U, Eurydice_slice_len(slice, uint8_t), uint8_t *), d673 3 a675 6 typedef struct Eurydice_slice_uint8_t_x4_s { Eurydice_slice fst; Eurydice_slice snd; Eurydice_slice thd; Eurydice_slice f3; } Eurydice_slice_uint8_t_x4; d677 5 a681 144 typedef struct Eurydice_slice_uint8_t_x2_s { Eurydice_slice fst; Eurydice_slice snd; } Eurydice_slice_uint8_t_x2; /** Unpack an incoming private key into it's different parts. We have this here in types to extract into a common core for C. */ /** A monomorphic instance of libcrux_ml_kem.types.unpack_private_key with const generics - CPA_SECRET_KEY_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 */ static inline Eurydice_slice_uint8_t_x4 libcrux_ml_kem_types_unpack_private_key_b4(Eurydice_slice private_key) { Eurydice_slice_uint8_t_x2 uu____0 = Eurydice_slice_split_at( private_key, (size_t)1152U, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice ind_cpa_secret_key = uu____0.fst; Eurydice_slice secret_key0 = uu____0.snd; Eurydice_slice_uint8_t_x2 uu____1 = Eurydice_slice_split_at( secret_key0, (size_t)1184U, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice ind_cpa_public_key = uu____1.fst; Eurydice_slice secret_key = uu____1.snd; Eurydice_slice_uint8_t_x2 uu____2 = Eurydice_slice_split_at( secret_key, LIBCRUX_ML_KEM_CONSTANTS_H_DIGEST_SIZE, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice ind_cpa_public_key_hash = uu____2.fst; Eurydice_slice implicit_rejection_value = uu____2.snd; return ( KRML_CLITERAL(Eurydice_slice_uint8_t_x4){.fst = ind_cpa_secret_key, .snd = ind_cpa_public_key, .thd = ind_cpa_public_key_hash, .f3 = implicit_rejection_value}); } /** This function found in impl {libcrux_secrets::traits::Declassify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.declassify_d8 with types uint8_t[24size_t] */ static KRML_MUSTINLINE void libcrux_secrets_int_public_integers_declassify_d8_d2(uint8_t self[24U], uint8_t ret[24U]) { memcpy(ret, self, (size_t)24U * sizeof(uint8_t)); } /** This function found in impl {libcrux_secrets::traits::Declassify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.declassify_d8 with types uint8_t[20size_t] */ static KRML_MUSTINLINE void libcrux_secrets_int_public_integers_declassify_d8_57(uint8_t self[20U], uint8_t ret[20U]) { memcpy(ret, self, (size_t)20U * sizeof(uint8_t)); } /** This function found in impl {libcrux_secrets::traits::Declassify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.declassify_d8 with types uint8_t[8size_t] */ static KRML_MUSTINLINE void libcrux_secrets_int_public_integers_declassify_d8_76(uint8_t self[8U], uint8_t ret[8U]) { memcpy(ret, self, (size_t)8U * sizeof(uint8_t)); } /** This function found in impl {libcrux_secrets::traits::Declassify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.declassify_d8 with types uint8_t[2size_t] */ static KRML_MUSTINLINE void libcrux_secrets_int_public_integers_declassify_d8_d4(uint8_t self[2U], uint8_t ret[2U]) { memcpy(ret, self, (size_t)2U * sizeof(uint8_t)); } /** This function found in impl {libcrux_secrets::traits::Classify for T} */ /** A monomorphic instance of libcrux_secrets.int.public_integers.classify_27 with types int16_t[16size_t] */ static KRML_MUSTINLINE void libcrux_secrets_int_public_integers_classify_27_46( int16_t self[16U], int16_t ret[16U]) { memcpy(ret, self, (size_t)16U * sizeof(int16_t)); } /** This function found in impl {libcrux_secrets::traits::ClassifyRef<&'a (@@Slice)> for &'a (@@Slice)} */ /** A monomorphic instance of libcrux_secrets.int.classify_public.classify_ref_9b with types uint8_t */ static KRML_MUSTINLINE Eurydice_slice libcrux_secrets_int_classify_public_classify_ref_9b_90(Eurydice_slice self) { return self; } /** This function found in impl {libcrux_secrets::traits::ClassifyRef<&'a (@@Slice)> for &'a (@@Slice)} */ /** A monomorphic instance of libcrux_secrets.int.classify_public.classify_ref_9b with types int16_t */ static KRML_MUSTINLINE Eurydice_slice libcrux_secrets_int_classify_public_classify_ref_9b_39(Eurydice_slice self) { return self; } /** A monomorphic instance of core.result.Result with types int16_t[16size_t], core_array_TryFromSliceError */ typedef struct Result_0a_s { Result_b2_tags tag; union { int16_t case_Ok[16U]; d684 1 a684 1 } Result_0a; d687 1 a687 2 This function found in impl {core::result::Result[TraitClause@@0, TraitClause@@1]} d690 1 a690 1 A monomorphic instance of core.result.unwrap_26 d694 1 a694 1 static inline void unwrap_26_00(Result_0a self, int16_t ret[16U]) { d711 2 a712 2 typedef struct Result_15_s { Result_b2_tags tag; d717 1 a717 1 } Result_15; d720 1 a720 2 This function found in impl {core::result::Result[TraitClause@@0, TraitClause@@1]} d723 1 a723 1 A monomorphic instance of core.result.unwrap_26 d727 1 a727 1 static inline void unwrap_26_68(Result_15 self, uint8_t ret[8U]) { d739 10 d753 2 a754 2 #define libcrux_mlkem_core_H_DEFINED #endif /* libcrux_mlkem_core_H */ d756 1 a756 1 /* from libcrux/libcrux-ml-kem/extracts/c_header_only/generated/libcrux_ct_ops.h */ d758 1 a758 1 * SPDX-FileCopyrightText: 2025 Cryspen Sarl d763 5 a767 5 * Charon: 667d2fc98984ff7f3df989c2367e6c1fa4a000e7 * Eurydice: 2381cbc416ef2ad0b561c362c500bc84f36b6785 * Karamel: 80f5435f2fc505973c469a4afcc8d875cddd0d8b * F*: 71d8221589d4d438af3706d89cb653cf53e18aab * Libcrux: 68dfed5a4a9e40277f62828471c029afed1ecdcc d770 2 a771 3 #ifndef libcrux_ct_ops_H #define libcrux_ct_ops_H d781 1 a781 2 static KRML_NOINLINE uint8_t libcrux_ml_kem_constant_time_ops_inz(uint8_t value) { d783 6 a788 3 uint8_t result = (uint8_t)((uint32_t)core_num__u16__wrapping_add(~value0, 1U) >> 8U); return (uint32_t)result & 1U; d800 1 a800 1 static KRML_NOINLINE uint8_t libcrux_ml_kem_constant_time_ops_compare( d805 3 a807 4 uint8_t nr = (uint32_t)r | ((uint32_t)Eurydice_slice_index(lhs, i0, uint8_t, uint8_t *) ^ (uint32_t)Eurydice_slice_index(rhs, i0, uint8_t, uint8_t *)); r = nr; d822 1 a822 1 static KRML_NOINLINE void libcrux_ml_kem_constant_time_ops_select_ct( d825 1 a825 1 uint8_t mask = core_num__u8__wrapping_sub( d831 4 a834 6 uint8_t outi = ((uint32_t)Eurydice_slice_index(lhs, i0, uint8_t, uint8_t *) & (uint32_t)mask) | ((uint32_t)Eurydice_slice_index(rhs, i0, uint8_t, uint8_t *) & (uint32_t)~mask); out[i0] = outi; d846 1 a846 1 static KRML_NOINLINE void d863 2 a864 2 #define libcrux_ct_ops_H_DEFINED #endif /* libcrux_ct_ops_H */ d866 1 a866 1 /* from libcrux/libcrux-ml-kem/extracts/c_header_only/generated/libcrux_sha3_portable.h */ d868 1 a868 1 * SPDX-FileCopyrightText: 2025 Cryspen Sarl d873 5 a877 5 * Charon: 667d2fc98984ff7f3df989c2367e6c1fa4a000e7 * Eurydice: 2381cbc416ef2ad0b561c362c500bc84f36b6785 * Karamel: 80f5435f2fc505973c469a4afcc8d875cddd0d8b * F*: 71d8221589d4d438af3706d89cb653cf53e18aab * Libcrux: 68dfed5a4a9e40277f62828471c029afed1ecdcc d880 2 a881 3 #ifndef libcrux_sha3_portable_H #define libcrux_sha3_portable_H d888 26 d915 2 a916 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d918 1 a918 1 static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_zero_d2(void) { d922 1 a922 1 static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable__veor5q_u64( d924 4 a927 1 return (((a ^ b) ^ c) ^ d) ^ e; d931 2 a932 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d934 1 a934 1 static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_xor5_d2( d936 1 a936 1 return libcrux_sha3_simd_portable__veor5q_u64(a, b, c, d, e); d940 1 a940 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d946 2 a947 2 libcrux_sha3_simd_portable_rotate_left_76(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)1); d951 1 a951 1 libcrux_sha3_simd_portable__vrax1q_u64(uint64_t a, uint64_t b) { d953 1 a953 1 return uu____0 ^ libcrux_sha3_simd_portable_rotate_left_76(b); d957 2 a958 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d961 2 a962 2 libcrux_sha3_simd_portable_rotate_left1_and_xor_d2(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vrax1q_u64(a, b); d966 1 a966 1 libcrux_sha3_simd_portable__vbcaxq_u64(uint64_t a, uint64_t b, uint64_t c) { d971 2 a972 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d974 3 a976 3 static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_and_not_xor_d2(uint64_t a, uint64_t b, uint64_t c) { return libcrux_sha3_simd_portable__vbcaxq_u64(a, b, c); d980 1 a980 1 libcrux_sha3_simd_portable__veorq_n_u64(uint64_t a, uint64_t c) { d985 2 a986 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d989 2 a990 2 libcrux_sha3_simd_portable_xor_constant_d2(uint64_t a, uint64_t c) { return libcrux_sha3_simd_portable__veorq_n_u64(a, c); d994 2 a995 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d997 2 a998 2 static KRML_MUSTINLINE uint64_t libcrux_sha3_simd_portable_xor_d2(uint64_t a, uint64_t b) { d1002 4 a1005 31 static const uint64_t libcrux_sha3_generic_keccak_constants_ROUNDCONSTANTS[24U] = { 1ULL, 32898ULL, 9223372036854808714ULL, 9223372039002292224ULL, 32907ULL, 2147483649ULL, 9223372039002292353ULL, 9223372036854808585ULL, 138ULL, 136ULL, 2147516425ULL, 2147483658ULL, 2147516555ULL, 9223372036854775947ULL, 9223372036854808713ULL, 9223372036854808579ULL, 9223372036854808578ULL, 9223372036854775936ULL, 32778ULL, 9223372039002259466ULL, 9223372039002292353ULL, 9223372036854808704ULL, 2147483649ULL, 9223372039002292232ULL}; typedef struct size_t_x2_s { size_t fst; size_t snd; } size_t_x2; d1008 2 a1009 4 A monomorphic instance of libcrux_sha3.generic_keccak.KeccakState with types uint64_t with const generics - $1size_t d1011 22 a1032 3 typedef struct libcrux_sha3_generic_keccak_KeccakState_17_s { uint64_t st[25U]; } libcrux_sha3_generic_keccak_KeccakState_17; d1035 2 a1036 2 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} d1038 6 d1045 1 a1045 1 A monomorphic instance of libcrux_sha3.generic_keccak.new_80 d1048 1 a1048 1 - N= 1 d1050 3 a1052 10 static KRML_MUSTINLINE libcrux_sha3_generic_keccak_KeccakState_17 libcrux_sha3_generic_keccak_new_80_04(void) { libcrux_sha3_generic_keccak_KeccakState_17 lit; uint64_t repeat_expression[25U]; for (size_t i = (size_t)0U; i < (size_t)25U; i++) { repeat_expression[i] = libcrux_sha3_simd_portable_zero_d2(); } memcpy(lit.st, repeat_expression, (size_t)25U * sizeof(uint64_t)); return lit; } d1055 5 a1059 4 A monomorphic instance of libcrux_sha3.traits.get_ij with types uint64_t with const generics - N= 1 a1060 6 static KRML_MUSTINLINE uint64_t *libcrux_sha3_traits_get_ij_04(uint64_t *arr, size_t i, size_t j) { return &arr[(size_t)5U * j + i]; } d1062 1 a1062 1 A monomorphic instance of libcrux_sha3.traits.set_ij d1067 29 a1095 4 static KRML_MUSTINLINE void libcrux_sha3_traits_set_ij_04(uint64_t *arr, size_t i, size_t j, uint64_t value) { arr[(size_t)5U * j + i] = value; d1099 1 a1099 1 A monomorphic instance of libcrux_sha3.simd.portable.load_block d1103 2 a1104 3 static KRML_MUSTINLINE void libcrux_sha3_simd_portable_load_block_f8( uint64_t *state, Eurydice_slice blocks, size_t start) { uint64_t state_flat[25U] = {0U}; a1106 1 size_t offset = start + (size_t)8U * i0; d1108 1 a1108 1 Result_15 dst; d1111 8 a1118 13 Eurydice_slice_subslice3(blocks, offset, offset + (size_t)8U, uint8_t *), Eurydice_slice, uint8_t[8U], TryFromSliceError); unwrap_26_68(dst, uu____0); state_flat[i0] = core_num__u64__from_le_bytes(uu____0); } for (size_t i = (size_t)0U; i < (size_t)72U / (size_t)8U; i++) { size_t i0 = i; libcrux_sha3_traits_set_ij_04( state, i0 / (size_t)5U, i0 % (size_t)5U, libcrux_sha3_traits_get_ij_04(state, i0 / (size_t)5U, i0 % (size_t)5U)[0U] ^ state_flat[i0]); d1123 2 a1124 4 This function found in impl {libcrux_sha3::traits::Absorb<1usize> for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d1127 1 a1127 1 A monomorphic instance of libcrux_sha3.simd.portable.load_block_a1 d1131 7 a1137 149 static inline void libcrux_sha3_simd_portable_load_block_a1_f8( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *input, size_t start) { libcrux_sha3_simd_portable_load_block_f8(self->st, input[0U], start); } /** This function found in impl {core::ops::index::Index<(usize, usize), T> for libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.index_c2 with types uint64_t with const generics - N= 1 */ static inline uint64_t *libcrux_sha3_generic_keccak_index_c2_04( libcrux_sha3_generic_keccak_KeccakState_17 *self, size_t_x2 index) { return libcrux_sha3_traits_get_ij_04(self->st, index.fst, index.snd); } /** This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.theta_80 with types uint64_t with const generics - N= 1 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_theta_80_04( libcrux_sha3_generic_keccak_KeccakState_17 *self, uint64_t ret[5U]) { uint64_t c[5U] = { libcrux_sha3_simd_portable_xor5_d2( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)0U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)0U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)0U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)0U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)0U}))[0U]), libcrux_sha3_simd_portable_xor5_d2( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)1U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)1U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)1U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)1U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)1U}))[0U]), libcrux_sha3_simd_portable_xor5_d2( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)2U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)2U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)2U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)2U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)2U}))[0U]), libcrux_sha3_simd_portable_xor5_d2( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)3U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)3U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)3U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)3U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)3U}))[0U]), libcrux_sha3_simd_portable_xor5_d2( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)4U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)4U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)4U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)4U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)4U}))[0U])}; uint64_t uu____0 = libcrux_sha3_simd_portable_rotate_left1_and_xor_d2( c[((size_t)0U + (size_t)4U) % (size_t)5U], c[((size_t)0U + (size_t)1U) % (size_t)5U]); uint64_t uu____1 = libcrux_sha3_simd_portable_rotate_left1_and_xor_d2( c[((size_t)1U + (size_t)4U) % (size_t)5U], c[((size_t)1U + (size_t)1U) % (size_t)5U]); uint64_t uu____2 = libcrux_sha3_simd_portable_rotate_left1_and_xor_d2( c[((size_t)2U + (size_t)4U) % (size_t)5U], c[((size_t)2U + (size_t)1U) % (size_t)5U]); uint64_t uu____3 = libcrux_sha3_simd_portable_rotate_left1_and_xor_d2( c[((size_t)3U + (size_t)4U) % (size_t)5U], c[((size_t)3U + (size_t)1U) % (size_t)5U]); ret[0U] = uu____0; ret[1U] = uu____1; ret[2U] = uu____2; ret[3U] = uu____3; ret[4U] = libcrux_sha3_simd_portable_rotate_left1_and_xor_d2( c[((size_t)4U + (size_t)4U) % (size_t)5U], c[((size_t)4U + (size_t)1U) % (size_t)5U]); } /** This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.set_80 with types uint64_t with const generics - N= 1 */ static inline void libcrux_sha3_generic_keccak_set_80_04( libcrux_sha3_generic_keccak_KeccakState_17 *self, size_t i, size_t j, uint64_t v) { libcrux_sha3_traits_set_ij_04(self->st, i, j, v); d1141 1 a1141 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1147 2 a1148 2 libcrux_sha3_simd_portable_rotate_left_02(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)36); d1152 1 a1152 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1158 3 a1160 2 libcrux_sha3_simd_portable__vxarq_u64_02(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_02(a ^ b); d1164 2 a1165 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1168 1 a1168 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1174 2 a1175 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_02(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_02(a, b); d1179 1 a1179 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1185 2 a1186 2 libcrux_sha3_simd_portable_rotate_left_ac(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)3); d1190 1 a1190 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1196 3 a1198 2 libcrux_sha3_simd_portable__vxarq_u64_ac(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_ac(a ^ b); d1202 2 a1203 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1206 1 a1206 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1212 2 a1213 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_ac(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_ac(a, b); d1217 1 a1217 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1223 2 a1224 2 libcrux_sha3_simd_portable_rotate_left_020(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)41); d1228 1 a1228 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1234 3 a1236 2 libcrux_sha3_simd_portable__vxarq_u64_020(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_020(a ^ b); d1240 2 a1241 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1244 1 a1244 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1250 2 a1251 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_020(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_020(a, b); d1255 1 a1255 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1261 2 a1262 2 libcrux_sha3_simd_portable_rotate_left_a9(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)18); d1266 1 a1266 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1272 3 a1274 2 libcrux_sha3_simd_portable__vxarq_u64_a9(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_a9(a ^ b); d1278 2 a1279 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1282 1 a1282 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1288 2 a1289 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_a9(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_a9(a, b); d1293 1 a1293 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1299 3 a1301 2 libcrux_sha3_simd_portable__vxarq_u64_76(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_76(a ^ b); d1305 2 a1306 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1309 1 a1309 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1315 2 a1316 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_76(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_76(a, b); d1320 1 a1320 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1326 2 a1327 2 libcrux_sha3_simd_portable_rotate_left_58(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)44); d1331 1 a1331 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1337 3 a1339 2 libcrux_sha3_simd_portable__vxarq_u64_58(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_58(a ^ b); d1343 2 a1344 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1347 1 a1347 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1353 2 a1354 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_58(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_58(a, b); d1358 1 a1358 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1364 2 a1365 2 libcrux_sha3_simd_portable_rotate_left_e0(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)10); d1369 1 a1369 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1375 3 a1377 2 libcrux_sha3_simd_portable__vxarq_u64_e0(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_e0(a ^ b); d1381 2 a1382 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1385 1 a1385 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1391 2 a1392 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_e0(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_e0(a, b); d1396 1 a1396 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1402 2 a1403 2 libcrux_sha3_simd_portable_rotate_left_63(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)45); d1407 1 a1407 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1413 3 a1415 2 libcrux_sha3_simd_portable__vxarq_u64_63(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_63(a ^ b); d1419 2 a1420 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1423 1 a1423 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1429 2 a1430 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_63(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_63(a, b); d1434 1 a1434 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1440 2 a1441 2 libcrux_sha3_simd_portable_rotate_left_6a(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)2); d1445 1 a1445 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1451 3 a1453 2 libcrux_sha3_simd_portable__vxarq_u64_6a(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_6a(a ^ b); d1457 2 a1458 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1461 1 a1461 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1467 2 a1468 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_6a(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_6a(a, b); d1472 1 a1472 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1478 2 a1479 2 libcrux_sha3_simd_portable_rotate_left_ab(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)62); d1483 1 a1483 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1489 3 a1491 2 libcrux_sha3_simd_portable__vxarq_u64_ab(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_ab(a ^ b); d1495 2 a1496 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1499 1 a1499 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1505 2 a1506 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_ab(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_ab(a, b); d1510 1 a1510 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1516 2 a1517 2 libcrux_sha3_simd_portable_rotate_left_5b(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)6); d1521 1 a1521 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1527 3 a1529 2 libcrux_sha3_simd_portable__vxarq_u64_5b(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_5b(a ^ b); d1533 2 a1534 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1537 1 a1537 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1543 2 a1544 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_5b(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_5b(a, b); d1548 1 a1548 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1554 2 a1555 2 libcrux_sha3_simd_portable_rotate_left_6f(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)43); d1559 1 a1559 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1565 3 a1567 2 libcrux_sha3_simd_portable__vxarq_u64_6f(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_6f(a ^ b); d1571 2 a1572 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1575 1 a1575 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1581 2 a1582 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_6f(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_6f(a, b); d1586 1 a1586 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1592 2 a1593 2 libcrux_sha3_simd_portable_rotate_left_62(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)15); d1597 1 a1597 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1603 3 a1605 2 libcrux_sha3_simd_portable__vxarq_u64_62(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_62(a ^ b); d1609 2 a1610 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1613 1 a1613 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1619 2 a1620 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_62(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_62(a, b); d1624 1 a1624 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1630 2 a1631 2 libcrux_sha3_simd_portable_rotate_left_23(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)61); d1635 1 a1635 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1641 3 a1643 2 libcrux_sha3_simd_portable__vxarq_u64_23(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_23(a ^ b); d1647 2 a1648 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1651 1 a1651 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1657 2 a1658 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_23(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_23(a, b); d1662 1 a1662 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1668 2 a1669 2 libcrux_sha3_simd_portable_rotate_left_37(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)28); d1673 1 a1673 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1679 3 a1681 2 libcrux_sha3_simd_portable__vxarq_u64_37(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_37(a ^ b); d1685 2 a1686 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1689 1 a1689 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1695 2 a1696 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_37(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_37(a, b); d1700 1 a1700 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1706 2 a1707 2 libcrux_sha3_simd_portable_rotate_left_bb(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)55); d1711 1 a1711 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1717 3 a1719 2 libcrux_sha3_simd_portable__vxarq_u64_bb(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_bb(a ^ b); d1723 2 a1724 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1727 1 a1727 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1733 2 a1734 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_bb(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_bb(a, b); d1738 1 a1738 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1744 2 a1745 2 libcrux_sha3_simd_portable_rotate_left_b9(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)25); d1749 1 a1749 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1755 3 a1757 2 libcrux_sha3_simd_portable__vxarq_u64_b9(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_b9(a ^ b); d1761 2 a1762 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1765 1 a1765 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1771 2 a1772 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_b9(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_b9(a, b); d1776 1 a1776 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1782 2 a1783 2 libcrux_sha3_simd_portable_rotate_left_54(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)21); d1787 1 a1787 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1793 3 a1795 2 libcrux_sha3_simd_portable__vxarq_u64_54(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_54(a ^ b); d1799 2 a1800 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1803 1 a1803 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1809 2 a1810 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_54(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_54(a, b); d1814 1 a1814 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1820 2 a1821 2 libcrux_sha3_simd_portable_rotate_left_4c(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)56); d1825 1 a1825 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1831 3 a1833 2 libcrux_sha3_simd_portable__vxarq_u64_4c(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_4c(a ^ b); d1837 2 a1838 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1841 1 a1841 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1847 2 a1848 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_4c(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_4c(a, b); d1852 1 a1852 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1858 2 a1859 2 libcrux_sha3_simd_portable_rotate_left_ce(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)27); d1863 1 a1863 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1869 3 a1871 2 libcrux_sha3_simd_portable__vxarq_u64_ce(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_ce(a ^ b); d1875 2 a1876 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1879 1 a1879 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1885 2 a1886 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_ce(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_ce(a, b); d1890 1 a1890 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1896 2 a1897 2 libcrux_sha3_simd_portable_rotate_left_77(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)20); d1901 1 a1901 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1907 3 a1909 2 libcrux_sha3_simd_portable__vxarq_u64_77(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_77(a ^ b); d1913 2 a1914 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1917 1 a1917 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1923 2 a1924 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_77(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_77(a, b); d1928 1 a1928 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1934 2 a1935 2 libcrux_sha3_simd_portable_rotate_left_25(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)39); d1939 1 a1939 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1945 3 a1947 2 libcrux_sha3_simd_portable__vxarq_u64_25(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_25(a ^ b); d1951 2 a1952 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1955 1 a1955 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1961 2 a1962 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_25(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_25(a, b); d1966 1 a1966 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d1972 2 a1973 2 libcrux_sha3_simd_portable_rotate_left_af(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)8); d1977 1 a1977 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d1983 3 a1985 2 libcrux_sha3_simd_portable__vxarq_u64_af(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_af(a ^ b); d1989 2 a1990 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d1993 1 a1993 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d1999 2 a2000 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_af(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_af(a, b); d2004 1 a2004 1 A monomorphic instance of libcrux_sha3.simd.portable.rotate_left d2010 2 a2011 2 libcrux_sha3_simd_portable_rotate_left_fd(uint64_t x) { return core_num__u64__rotate_left(x, (uint32_t)(int32_t)14); d2015 1 a2015 1 A monomorphic instance of libcrux_sha3.simd.portable._vxarq_u64 d2021 3 a2023 2 libcrux_sha3_simd_portable__vxarq_u64_fd(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable_rotate_left_fd(a ^ b); d2027 2 a2028 1 This function found in impl {libcrux_sha3::traits::KeccakItem<1usize> for u64} d2031 1 a2031 1 A monomorphic instance of libcrux_sha3.simd.portable.xor_and_rotate_d2 d2037 2 a2038 2 libcrux_sha3_simd_portable_xor_and_rotate_d2_fd(uint64_t a, uint64_t b) { return libcrux_sha3_simd_portable__vxarq_u64_fd(a, b); d2042 1 a2042 5 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.rho_80 d2047 84 a2130 201 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_rho_80_04( libcrux_sha3_generic_keccak_KeccakState_17 *self, uint64_t t[5U]) { libcrux_sha3_generic_keccak_set_80_04( self, (size_t)0U, (size_t)0U, libcrux_sha3_simd_portable_xor_d2( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)0U}))[0U], t[0U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____0 = self; libcrux_sha3_generic_keccak_set_80_04( uu____0, (size_t)1U, (size_t)0U, libcrux_sha3_simd_portable_xor_and_rotate_d2_02( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)0U}))[0U], t[0U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____1 = self; libcrux_sha3_generic_keccak_set_80_04( uu____1, (size_t)2U, (size_t)0U, libcrux_sha3_simd_portable_xor_and_rotate_d2_ac( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)0U}))[0U], t[0U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____2 = self; libcrux_sha3_generic_keccak_set_80_04( uu____2, (size_t)3U, (size_t)0U, libcrux_sha3_simd_portable_xor_and_rotate_d2_020( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)0U}))[0U], t[0U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____3 = self; libcrux_sha3_generic_keccak_set_80_04( uu____3, (size_t)4U, (size_t)0U, libcrux_sha3_simd_portable_xor_and_rotate_d2_a9( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)0U}))[0U], t[0U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____4 = self; libcrux_sha3_generic_keccak_set_80_04( uu____4, (size_t)0U, (size_t)1U, libcrux_sha3_simd_portable_xor_and_rotate_d2_76( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)1U}))[0U], t[1U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____5 = self; libcrux_sha3_generic_keccak_set_80_04( uu____5, (size_t)1U, (size_t)1U, libcrux_sha3_simd_portable_xor_and_rotate_d2_58( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)1U}))[0U], t[1U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____6 = self; libcrux_sha3_generic_keccak_set_80_04( uu____6, (size_t)2U, (size_t)1U, libcrux_sha3_simd_portable_xor_and_rotate_d2_e0( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)1U}))[0U], t[1U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____7 = self; libcrux_sha3_generic_keccak_set_80_04( uu____7, (size_t)3U, (size_t)1U, libcrux_sha3_simd_portable_xor_and_rotate_d2_63( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)1U}))[0U], t[1U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____8 = self; libcrux_sha3_generic_keccak_set_80_04( uu____8, (size_t)4U, (size_t)1U, libcrux_sha3_simd_portable_xor_and_rotate_d2_6a( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)1U}))[0U], t[1U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____9 = self; libcrux_sha3_generic_keccak_set_80_04( uu____9, (size_t)0U, (size_t)2U, libcrux_sha3_simd_portable_xor_and_rotate_d2_ab( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)2U}))[0U], t[2U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____10 = self; libcrux_sha3_generic_keccak_set_80_04( uu____10, (size_t)1U, (size_t)2U, libcrux_sha3_simd_portable_xor_and_rotate_d2_5b( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)2U}))[0U], t[2U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____11 = self; libcrux_sha3_generic_keccak_set_80_04( uu____11, (size_t)2U, (size_t)2U, libcrux_sha3_simd_portable_xor_and_rotate_d2_6f( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)2U}))[0U], t[2U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____12 = self; libcrux_sha3_generic_keccak_set_80_04( uu____12, (size_t)3U, (size_t)2U, libcrux_sha3_simd_portable_xor_and_rotate_d2_62( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)2U}))[0U], t[2U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____13 = self; libcrux_sha3_generic_keccak_set_80_04( uu____13, (size_t)4U, (size_t)2U, libcrux_sha3_simd_portable_xor_and_rotate_d2_23( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)2U}))[0U], t[2U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____14 = self; libcrux_sha3_generic_keccak_set_80_04( uu____14, (size_t)0U, (size_t)3U, libcrux_sha3_simd_portable_xor_and_rotate_d2_37( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)3U}))[0U], t[3U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____15 = self; libcrux_sha3_generic_keccak_set_80_04( uu____15, (size_t)1U, (size_t)3U, libcrux_sha3_simd_portable_xor_and_rotate_d2_bb( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)3U}))[0U], t[3U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____16 = self; libcrux_sha3_generic_keccak_set_80_04( uu____16, (size_t)2U, (size_t)3U, libcrux_sha3_simd_portable_xor_and_rotate_d2_b9( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)3U}))[0U], t[3U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____17 = self; libcrux_sha3_generic_keccak_set_80_04( uu____17, (size_t)3U, (size_t)3U, libcrux_sha3_simd_portable_xor_and_rotate_d2_54( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)3U}))[0U], t[3U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____18 = self; libcrux_sha3_generic_keccak_set_80_04( uu____18, (size_t)4U, (size_t)3U, libcrux_sha3_simd_portable_xor_and_rotate_d2_4c( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)3U}))[0U], t[3U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____19 = self; libcrux_sha3_generic_keccak_set_80_04( uu____19, (size_t)0U, (size_t)4U, libcrux_sha3_simd_portable_xor_and_rotate_d2_ce( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)4U}))[0U], t[4U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____20 = self; libcrux_sha3_generic_keccak_set_80_04( uu____20, (size_t)1U, (size_t)4U, libcrux_sha3_simd_portable_xor_and_rotate_d2_77( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)4U}))[0U], t[4U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____21 = self; libcrux_sha3_generic_keccak_set_80_04( uu____21, (size_t)2U, (size_t)4U, libcrux_sha3_simd_portable_xor_and_rotate_d2_25( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)4U}))[0U], t[4U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____22 = self; libcrux_sha3_generic_keccak_set_80_04( uu____22, (size_t)3U, (size_t)4U, libcrux_sha3_simd_portable_xor_and_rotate_d2_af( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)4U}))[0U], t[4U])); libcrux_sha3_generic_keccak_KeccakState_17 *uu____23 = self; libcrux_sha3_generic_keccak_set_80_04( uu____23, (size_t)4U, (size_t)4U, libcrux_sha3_simd_portable_xor_and_rotate_d2_fd( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)4U}))[0U], t[4U])); d2134 1 a2134 5 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.pi_80 d2139 28 a2166 123 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_pi_80_04( libcrux_sha3_generic_keccak_KeccakState_17 *self) { libcrux_sha3_generic_keccak_KeccakState_17 old = self[0U]; libcrux_sha3_generic_keccak_set_80_04( self, (size_t)1U, (size_t)0U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)3U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)2U, (size_t)0U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)1U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)3U, (size_t)0U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)4U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)4U, (size_t)0U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)2U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)0U, (size_t)1U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)1U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)1U, (size_t)1U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)4U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)2U, (size_t)1U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)2U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)3U, (size_t)1U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)0U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)4U, (size_t)1U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)1U, .snd = (size_t)3U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)0U, (size_t)2U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)2U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)1U, (size_t)2U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)0U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)2U, (size_t)2U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)3U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)3U, (size_t)2U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)1U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)4U, (size_t)2U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)2U, .snd = (size_t)4U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)0U, (size_t)3U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)3U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)1U, (size_t)3U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)1U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)2U, (size_t)3U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)4U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)3U, (size_t)3U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)2U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)4U, (size_t)3U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)3U, .snd = (size_t)0U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)0U, (size_t)4U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)4U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)1U, (size_t)4U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)2U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)2U, (size_t)4U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)0U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)3U, (size_t)4U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)3U}))[0U]); libcrux_sha3_generic_keccak_set_80_04( self, (size_t)4U, (size_t)4U, libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){.fst = (size_t)4U, .snd = (size_t)1U}))[0U]); d2170 1 a2170 5 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.chi_80 d2175 4 a2178 3 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_chi_80_04( libcrux_sha3_generic_keccak_KeccakState_17 *self) { libcrux_sha3_generic_keccak_KeccakState_17 old = self[0U]; d2183 3 a2185 13 libcrux_sha3_generic_keccak_set_80_04( self, i1, j, libcrux_sha3_simd_portable_and_not_xor_d2( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = i1, .snd = j}))[0U], libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){ .fst = i1, .snd = (j + (size_t)2U) % (size_t)5U}))[0U], libcrux_sha3_generic_keccak_index_c2_04( &old, (KRML_CLITERAL(size_t_x2){ .fst = i1, .snd = (j + (size_t)1U) % (size_t)5U}))[0U])); d2191 1 a2191 5 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.iota_80 d2196 4 a2199 9 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_iota_80_04( libcrux_sha3_generic_keccak_KeccakState_17 *self, size_t i) { libcrux_sha3_generic_keccak_set_80_04( self, (size_t)0U, (size_t)0U, libcrux_sha3_simd_portable_xor_constant_d2( libcrux_sha3_generic_keccak_index_c2_04( self, (KRML_CLITERAL(size_t_x2){.fst = (size_t)0U, .snd = (size_t)0U}))[0U], libcrux_sha3_generic_keccak_constants_ROUNDCONSTANTS[i])); d2203 1 a2203 5 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.keccakf1600_80 d2208 2 a2209 2 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_keccakf1600_80_04( libcrux_sha3_generic_keccak_KeccakState_17 *self) { d2212 4 a2215 9 uint64_t t[5U]; libcrux_sha3_generic_keccak_theta_80_04(self, t); libcrux_sha3_generic_keccak_KeccakState_17 *uu____0 = self; uint64_t uu____1[5U]; memcpy(uu____1, t, (size_t)5U * sizeof(uint64_t)); libcrux_sha3_generic_keccak_rho_80_04(uu____0, uu____1); libcrux_sha3_generic_keccak_pi_80_04(self); libcrux_sha3_generic_keccak_chi_80_04(self); libcrux_sha3_generic_keccak_iota_80_04(self, i0); d2220 1 a2220 5 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_block_80 d2226 7 a2232 5 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_block_80_c6( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *blocks, size_t start) { libcrux_sha3_simd_portable_load_block_a1_f8(self, blocks, start); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); d2236 1 a2236 1 A monomorphic instance of libcrux_sha3.simd.portable.load_last a2238 1 - DELIMITER= 6 d2240 5 a2244 11 static KRML_MUSTINLINE void libcrux_sha3_simd_portable_load_last_96( uint64_t *state, Eurydice_slice blocks, size_t start, size_t len) { uint8_t buffer[72U] = {0U}; Eurydice_slice_copy( Eurydice_array_to_subslice3(buffer, (size_t)0U, len, uint8_t *), Eurydice_slice_subslice3(blocks, start, start + len, uint8_t *), uint8_t); buffer[len] = 6U; size_t uu____0 = (size_t)72U - (size_t)1U; buffer[uu____0] = (uint32_t)buffer[uu____0] | 128U; libcrux_sha3_simd_portable_load_block_f8( state, Eurydice_array_to_slice((size_t)72U, buffer, uint8_t), (size_t)0U); d2248 2 a2249 4 This function found in impl {libcrux_sha3::traits::Absorb<1usize> for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d2252 1 a2252 1 A monomorphic instance of libcrux_sha3.simd.portable.load_last_a1 a2254 1 - DELIMITER= 6 d2256 7 a2262 4 static inline void libcrux_sha3_simd_portable_load_last_a1_96( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *input, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_96(self->st, input[0U], start, len); d2266 1 a2266 5 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_final_80 d2273 21 a2293 5 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_final_80_9e( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *last, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_a1_96(self, last, start, len); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); d2297 1 a2297 1 A monomorphic instance of libcrux_sha3.simd.portable.store_block d2301 6 a2306 8 static KRML_MUSTINLINE void libcrux_sha3_simd_portable_store_block_f8( uint64_t *s, Eurydice_slice out, size_t start, size_t len) { size_t octets = len / (size_t)8U; for (size_t i = (size_t)0U; i < octets; i++) { size_t i0 = i; Eurydice_slice uu____0 = Eurydice_slice_subslice3( out, start + (size_t)8U * i0, start + (size_t)8U * i0 + (size_t)8U, uint8_t *); d2308 1 a2308 3 core_num__u64__to_le_bytes( libcrux_sha3_traits_get_ij_04(s, i0 / (size_t)5U, i0 % (size_t)5U)[0U], ret); a2311 14 size_t remaining = len % (size_t)8U; if (remaining > (size_t)0U) { Eurydice_slice uu____1 = Eurydice_slice_subslice3( out, start + len - remaining, start + len, uint8_t *); uint8_t ret[8U]; core_num__u64__to_le_bytes( libcrux_sha3_traits_get_ij_04(s, octets / (size_t)5U, octets % (size_t)5U)[0U], ret); Eurydice_slice_copy( uu____1, Eurydice_array_to_subslice3(ret, (size_t)0U, remaining, uint8_t *), uint8_t); } d2315 19 a2333 4 This function found in impl {libcrux_sha3::traits::Squeeze1 for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d2336 1 a2336 1 A monomorphic instance of libcrux_sha3.simd.portable.squeeze_13 d2340 3 a2342 4 static inline void libcrux_sha3_simd_portable_squeeze_13_f8( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice out, size_t start, size_t len) { libcrux_sha3_simd_portable_store_block_f8(self->st, out, start, len); d2346 2 a2347 1 A monomorphic instance of libcrux_sha3.generic_keccak.portable.keccak1 d2349 1 a2350 1 - DELIM= 6 d2352 6 a2357 6 static inline void libcrux_sha3_generic_keccak_portable_keccak1_96( Eurydice_slice data, Eurydice_slice out) { libcrux_sha3_generic_keccak_KeccakState_17 s = libcrux_sha3_generic_keccak_new_80_04(); size_t data_len = Eurydice_slice_len(data, uint8_t); for (size_t i = (size_t)0U; i < data_len / (size_t)72U; i++) { d2359 10 a2368 23 Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_block_80_c6(&s, buf, i0 * (size_t)72U); } size_t rem = data_len % (size_t)72U; Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_final_80_9e(&s, buf, data_len - rem, rem); size_t outlen = Eurydice_slice_len(out, uint8_t); size_t blocks = outlen / (size_t)72U; size_t last = outlen - outlen % (size_t)72U; if (blocks == (size_t)0U) { libcrux_sha3_simd_portable_squeeze_13_f8(&s, out, (size_t)0U, outlen); } else { libcrux_sha3_simd_portable_squeeze_13_f8(&s, out, (size_t)0U, (size_t)72U); for (size_t i = (size_t)1U; i < blocks; i++) { size_t i0 = i; libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_f8(&s, out, i0 * (size_t)72U, (size_t)72U); } if (last < outlen) { libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_f8(&s, out, last, outlen - last); } d2373 7 a2379 1 A portable SHA3 512 implementation. d2381 3 a2383 3 static KRML_MUSTINLINE void libcrux_sha3_portable_sha512(Eurydice_slice digest, Eurydice_slice data) { libcrux_sha3_generic_keccak_portable_keccak1_96(data, digest); d2387 2 a2388 1 A monomorphic instance of libcrux_sha3.simd.portable.load_block d2390 2 a2391 1 - RATE= 136 d2393 149 a2541 3 static KRML_MUSTINLINE void libcrux_sha3_simd_portable_load_block_5b( uint64_t *state, Eurydice_slice blocks, size_t start) { uint64_t state_flat[25U] = {0U}; a2543 1 size_t offset = start + (size_t)8U * i0; d2545 1 a2545 1 Result_15 dst; d2548 8 a2555 13 Eurydice_slice_subslice3(blocks, offset, offset + (size_t)8U, uint8_t *), Eurydice_slice, uint8_t[8U], TryFromSliceError); unwrap_26_68(dst, uu____0); state_flat[i0] = core_num__u64__from_le_bytes(uu____0); } for (size_t i = (size_t)0U; i < (size_t)136U / (size_t)8U; i++) { size_t i0 = i; libcrux_sha3_traits_set_ij_04( state, i0 / (size_t)5U, i0 % (size_t)5U, libcrux_sha3_traits_get_ij_04(state, i0 / (size_t)5U, i0 % (size_t)5U)[0U] ^ state_flat[i0]); d2560 2 a2561 4 This function found in impl {libcrux_sha3::traits::Absorb<1usize> for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d2564 1 a2564 1 A monomorphic instance of libcrux_sha3.simd.portable.load_block_a1 d2568 7 a2574 4 static inline void libcrux_sha3_simd_portable_load_block_a1_5b( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *input, size_t start) { libcrux_sha3_simd_portable_load_block_5b(self->st, input[0U], start); d2578 1 a2578 5 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_block_80 d2584 7 a2590 5 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_block_80_c60( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *blocks, size_t start) { libcrux_sha3_simd_portable_load_block_a1_5b(self, blocks, start); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); d2594 1 a2594 1 A monomorphic instance of libcrux_sha3.simd.portable.load_last a2596 1 - DELIMITER= 6 d2598 5 a2602 12 static KRML_MUSTINLINE void libcrux_sha3_simd_portable_load_last_ad( uint64_t *state, Eurydice_slice blocks, size_t start, size_t len) { uint8_t buffer[136U] = {0U}; Eurydice_slice_copy( Eurydice_array_to_subslice3(buffer, (size_t)0U, len, uint8_t *), Eurydice_slice_subslice3(blocks, start, start + len, uint8_t *), uint8_t); buffer[len] = 6U; size_t uu____0 = (size_t)136U - (size_t)1U; buffer[uu____0] = (uint32_t)buffer[uu____0] | 128U; libcrux_sha3_simd_portable_load_block_5b( state, Eurydice_array_to_slice((size_t)136U, buffer, uint8_t), (size_t)0U); d2606 2 a2607 4 This function found in impl {libcrux_sha3::traits::Absorb<1usize> for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d2610 1 a2610 1 A monomorphic instance of libcrux_sha3.simd.portable.load_last_a1 a2612 1 - DELIMITER= 6 d2614 7 a2620 4 static inline void libcrux_sha3_simd_portable_load_last_a1_ad( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *input, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_ad(self->st, input[0U], start, len); d2624 1 a2624 5 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_final_80 d2631 21 a2651 5 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_final_80_9e0( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *last, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_a1_ad(self, last, start, len); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); d2655 1 a2655 1 A monomorphic instance of libcrux_sha3.simd.portable.store_block d2659 6 a2664 8 static KRML_MUSTINLINE void libcrux_sha3_simd_portable_store_block_5b( uint64_t *s, Eurydice_slice out, size_t start, size_t len) { size_t octets = len / (size_t)8U; for (size_t i = (size_t)0U; i < octets; i++) { size_t i0 = i; Eurydice_slice uu____0 = Eurydice_slice_subslice3( out, start + (size_t)8U * i0, start + (size_t)8U * i0 + (size_t)8U, uint8_t *); d2666 1 a2666 3 core_num__u64__to_le_bytes( libcrux_sha3_traits_get_ij_04(s, i0 / (size_t)5U, i0 % (size_t)5U)[0U], ret); d2670 53 a2722 9 size_t remaining = len % (size_t)8U; if (remaining > (size_t)0U) { Eurydice_slice uu____1 = Eurydice_slice_subslice3( out, start + len - remaining, start + len, uint8_t *); uint8_t ret[8U]; core_num__u64__to_le_bytes( libcrux_sha3_traits_get_ij_04(s, octets / (size_t)5U, octets % (size_t)5U)[0U], ret); d2724 3 a2726 2 uu____1, Eurydice_array_to_subslice3(ret, (size_t)0U, remaining, uint8_t *), d2732 31 a2762 4 This function found in impl {libcrux_sha3::traits::Squeeze1 for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d2764 6 d2771 2 a2772 1 A monomorphic instance of libcrux_sha3.simd.portable.squeeze_13 d2774 1 d2777 18 a2794 4 static inline void libcrux_sha3_simd_portable_squeeze_13_5b( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice out, size_t start, size_t len) { libcrux_sha3_simd_portable_store_block_5b(self->st, out, start, len); d2798 2 a2799 1 A monomorphic instance of libcrux_sha3.generic_keccak.portable.keccak1 d2801 1 d2805 6 a2810 6 static inline void libcrux_sha3_generic_keccak_portable_keccak1_ad( Eurydice_slice data, Eurydice_slice out) { libcrux_sha3_generic_keccak_KeccakState_17 s = libcrux_sha3_generic_keccak_new_80_04(); size_t data_len = Eurydice_slice_len(data, uint8_t); for (size_t i = (size_t)0U; i < data_len / (size_t)136U; i++) { d2812 8 a2819 2 Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_block_80_c60(&s, buf, i0 * (size_t)136U); d2821 10 a2830 4 size_t rem = data_len % (size_t)136U; Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_final_80_9e0(&s, buf, data_len - rem, rem); size_t outlen = Eurydice_slice_len(out, uint8_t); d2834 1 a2834 1 libcrux_sha3_simd_portable_squeeze_13_5b(&s, out, (size_t)0U, outlen); d2836 27 a2862 6 libcrux_sha3_simd_portable_squeeze_13_5b(&s, out, (size_t)0U, (size_t)136U); for (size_t i = (size_t)1U; i < blocks; i++) { size_t i0 = i; libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_5b(&s, out, i0 * (size_t)136U, (size_t)136U); d2865 1 a2865 2 libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_5b(&s, out, last, outlen - last); d2871 1 a2871 9 A portable SHA3 256 implementation. */ static KRML_MUSTINLINE void libcrux_sha3_portable_sha256(Eurydice_slice digest, Eurydice_slice data) { libcrux_sha3_generic_keccak_portable_keccak1_ad(data, digest); } /** A monomorphic instance of libcrux_sha3.simd.portable.load_last d2874 1 a2874 1 - DELIMITER= 31 d2876 6 a2881 12 static KRML_MUSTINLINE void libcrux_sha3_simd_portable_load_last_ad0( uint64_t *state, Eurydice_slice blocks, size_t start, size_t len) { uint8_t buffer[136U] = {0U}; Eurydice_slice_copy( Eurydice_array_to_subslice3(buffer, (size_t)0U, len, uint8_t *), Eurydice_slice_subslice3(blocks, start, start + len, uint8_t *), uint8_t); buffer[len] = 31U; size_t uu____0 = (size_t)136U - (size_t)1U; buffer[uu____0] = (uint32_t)buffer[uu____0] | 128U; libcrux_sha3_simd_portable_load_block_5b( state, Eurydice_array_to_slice((size_t)136U, buffer, uint8_t), (size_t)0U); d2885 1 a2885 4 This function found in impl {libcrux_sha3::traits::Absorb<1usize> for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d2887 5 a2891 10 /** A monomorphic instance of libcrux_sha3.simd.portable.load_last_a1 with const generics - RATE= 136 - DELIMITER= 31 */ static inline void libcrux_sha3_simd_portable_load_last_a1_ad0( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *input, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_ad0(self->st, input[0U], start, len); d2895 1 a2895 5 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_final_80 d2902 21 a2922 5 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_final_80_9e1( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *last, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_a1_ad0(self, last, start, len); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); d2926 2 a2927 1 A monomorphic instance of libcrux_sha3.generic_keccak.portable.keccak1 d2929 1 d2933 6 a2938 6 static inline void libcrux_sha3_generic_keccak_portable_keccak1_ad0( Eurydice_slice data, Eurydice_slice out) { libcrux_sha3_generic_keccak_KeccakState_17 s = libcrux_sha3_generic_keccak_new_80_04(); size_t data_len = Eurydice_slice_len(data, uint8_t); for (size_t i = (size_t)0U; i < data_len / (size_t)136U; i++) { d2940 8 a2947 2 Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_block_80_c60(&s, buf, i0 * (size_t)136U); d2949 10 a2958 4 size_t rem = data_len % (size_t)136U; Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_final_80_9e1(&s, buf, data_len - rem, rem); size_t outlen = Eurydice_slice_len(out, uint8_t); d2962 1 a2962 1 libcrux_sha3_simd_portable_squeeze_13_5b(&s, out, (size_t)0U, outlen); d2964 27 a2990 6 libcrux_sha3_simd_portable_squeeze_13_5b(&s, out, (size_t)0U, (size_t)136U); for (size_t i = (size_t)1U; i < blocks; i++) { size_t i0 = i; libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_5b(&s, out, i0 * (size_t)136U, (size_t)136U); d2993 1 a2993 2 libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_5b(&s, out, last, outlen - last); d2999 14 d3017 3 a3019 1 libcrux_sha3_generic_keccak_portable_keccak1_ad0(data, digest); d3022 1 a3022 1 typedef libcrux_sha3_generic_keccak_KeccakState_17 d3028 1 a3028 1 static KRML_MUSTINLINE libcrux_sha3_generic_keccak_KeccakState_17 d3030 1 a3030 1 return libcrux_sha3_generic_keccak_new_80_04(); d3034 1 a3034 1 A monomorphic instance of libcrux_sha3.simd.portable.load_block d3038 2 a3039 3 static KRML_MUSTINLINE void libcrux_sha3_simd_portable_load_block_3a( uint64_t *state, Eurydice_slice blocks, size_t start) { uint64_t state_flat[25U] = {0U}; a3041 1 size_t offset = start + (size_t)8U * i0; d3043 1 a3043 1 Result_15 dst; d3046 8 a3053 13 Eurydice_slice_subslice3(blocks, offset, offset + (size_t)8U, uint8_t *), Eurydice_slice, uint8_t[8U], TryFromSliceError); unwrap_26_68(dst, uu____0); state_flat[i0] = core_num__u64__from_le_bytes(uu____0); } for (size_t i = (size_t)0U; i < (size_t)168U / (size_t)8U; i++) { size_t i0 = i; libcrux_sha3_traits_set_ij_04( state, i0 / (size_t)5U, i0 % (size_t)5U, libcrux_sha3_traits_get_ij_04(state, i0 / (size_t)5U, i0 % (size_t)5U)[0U] ^ state_flat[i0]); d3058 1 a3058 1 A monomorphic instance of libcrux_sha3.simd.portable.load_last a3060 1 - DELIMITER= 31 d3062 5 a3066 12 static KRML_MUSTINLINE void libcrux_sha3_simd_portable_load_last_c6( uint64_t *state, Eurydice_slice blocks, size_t start, size_t len) { uint8_t buffer[168U] = {0U}; Eurydice_slice_copy( Eurydice_array_to_subslice3(buffer, (size_t)0U, len, uint8_t *), Eurydice_slice_subslice3(blocks, start, start + len, uint8_t *), uint8_t); buffer[len] = 31U; size_t uu____0 = (size_t)168U - (size_t)1U; buffer[uu____0] = (uint32_t)buffer[uu____0] | 128U; libcrux_sha3_simd_portable_load_block_3a( state, Eurydice_array_to_slice((size_t)168U, buffer, uint8_t), (size_t)0U); d3070 2 a3071 4 This function found in impl {libcrux_sha3::traits::Absorb<1usize> for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d3074 1 a3074 1 A monomorphic instance of libcrux_sha3.simd.portable.load_last_a1 a3076 1 - DELIMITER= 31 d3078 7 a3084 4 static inline void libcrux_sha3_simd_portable_load_last_a1_c6( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *input, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_c6(self->st, input[0U], start, len); d3088 1 a3088 5 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_final_80 d3095 21 a3115 5 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_final_80_9e2( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *last, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_a1_c6(self, last, start, len); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); d3123 3 a3125 5 libcrux_sha3_generic_keccak_KeccakState_17 *s, Eurydice_slice data0) { libcrux_sha3_generic_keccak_KeccakState_17 *uu____0 = s; Eurydice_slice uu____1[1U] = {data0}; libcrux_sha3_generic_keccak_absorb_final_80_9e2( uu____0, uu____1, (size_t)0U, Eurydice_slice_len(data0, uint8_t)); d3129 1 a3129 1 A monomorphic instance of libcrux_sha3.simd.portable.store_block d3133 6 a3138 8 static KRML_MUSTINLINE void libcrux_sha3_simd_portable_store_block_3a( uint64_t *s, Eurydice_slice out, size_t start, size_t len) { size_t octets = len / (size_t)8U; for (size_t i = (size_t)0U; i < octets; i++) { size_t i0 = i; Eurydice_slice uu____0 = Eurydice_slice_subslice3( out, start + (size_t)8U * i0, start + (size_t)8U * i0 + (size_t)8U, uint8_t *); d3140 1 a3140 3 core_num__u64__to_le_bytes( libcrux_sha3_traits_get_ij_04(s, i0 / (size_t)5U, i0 % (size_t)5U)[0U], ret); a3143 14 size_t remaining = len % (size_t)8U; if (remaining > (size_t)0U) { Eurydice_slice uu____1 = Eurydice_slice_subslice3( out, start + len - remaining, start + len, uint8_t *); uint8_t ret[8U]; core_num__u64__to_le_bytes( libcrux_sha3_traits_get_ij_04(s, octets / (size_t)5U, octets % (size_t)5U)[0U], ret); Eurydice_slice_copy( uu____1, Eurydice_array_to_subslice3(ret, (size_t)0U, remaining, uint8_t *), uint8_t); } d3147 2 a3148 4 This function found in impl {libcrux_sha3::traits::Squeeze1 for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d3151 1 a3151 1 A monomorphic instance of libcrux_sha3.simd.portable.squeeze_13 d3155 3 a3157 4 static inline void libcrux_sha3_simd_portable_squeeze_13_3a( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice out, size_t start, size_t len) { libcrux_sha3_simd_portable_store_block_3a(self->st, out, start, len); d3161 4 a3164 9 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.portable.squeeze_first_three_blocks_b4 with const generics d3167 4 a3170 10 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_portable_squeeze_first_three_blocks_b4_3a( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice out) { libcrux_sha3_simd_portable_squeeze_13_3a(self, out, (size_t)0U, (size_t)168U); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); libcrux_sha3_simd_portable_squeeze_13_3a(self, out, (size_t)168U, (size_t)168U); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); libcrux_sha3_simd_portable_squeeze_13_3a(self, out, (size_t)2U * (size_t)168U, (size_t)168U); d3174 1 a3174 1 Squeeze three blocks d3177 4 a3180 4 libcrux_sha3_portable_incremental_shake128_squeeze_first_three_blocks( libcrux_sha3_generic_keccak_KeccakState_17 *s, Eurydice_slice out0) { libcrux_sha3_generic_keccak_portable_squeeze_first_three_blocks_b4_3a(s, out0); d3184 5 a3188 4 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d3190 5 d3196 4 a3199 2 A monomorphic instance of libcrux_sha3.generic_keccak.portable.squeeze_next_block_b4 with const generics d3203 17 a3219 5 libcrux_sha3_generic_keccak_portable_squeeze_next_block_b4_3a( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice out, size_t start) { libcrux_sha3_generic_keccak_keccakf1600_80_04(self); libcrux_sha3_simd_portable_squeeze_13_3a(self, out, start, (size_t)168U); d3223 1 a3223 1 Squeeze another block d3226 4 a3229 4 libcrux_sha3_portable_incremental_shake128_squeeze_next_block( libcrux_sha3_generic_keccak_KeccakState_17 *s, Eurydice_slice out0) { libcrux_sha3_generic_keccak_portable_squeeze_next_block_b4_3a(s, out0, (size_t)0U); d3232 4 a3235 4 #define libcrux_sha3_Algorithm_Sha224 1 #define libcrux_sha3_Algorithm_Sha256 2 #define libcrux_sha3_Algorithm_Sha384 3 #define libcrux_sha3_Algorithm_Sha512 4 a3238 8 typedef uint8_t libcrux_sha3_Sha3_224Digest[28U]; typedef uint8_t libcrux_sha3_Sha3_256Digest[32U]; typedef uint8_t libcrux_sha3_Sha3_384Digest[48U]; typedef uint8_t libcrux_sha3_Sha3_512Digest[64U]; d3243 1 d3245 2 a3246 1 case libcrux_sha3_Algorithm_Sha224: { d3249 3 a3251 2 case libcrux_sha3_Algorithm_Sha256: { return (size_t)32U; d3253 3 a3255 2 case libcrux_sha3_Algorithm_Sha384: { return (size_t)48U; d3257 3 a3259 2 case libcrux_sha3_Algorithm_Sha512: { return (size_t)64U; d3267 1 a3267 1 return (size_t)28U; d3271 1 a3271 1 A monomorphic instance of libcrux_sha3.simd.portable.load_block d3275 2 a3276 3 static KRML_MUSTINLINE void libcrux_sha3_simd_portable_load_block_2c( uint64_t *state, Eurydice_slice blocks, size_t start) { uint64_t state_flat[25U] = {0U}; a3278 1 size_t offset = start + (size_t)8U * i0; d3280 1 a3280 1 Result_15 dst; d3283 8 a3290 13 Eurydice_slice_subslice3(blocks, offset, offset + (size_t)8U, uint8_t *), Eurydice_slice, uint8_t[8U], TryFromSliceError); unwrap_26_68(dst, uu____0); state_flat[i0] = core_num__u64__from_le_bytes(uu____0); } for (size_t i = (size_t)0U; i < (size_t)144U / (size_t)8U; i++) { size_t i0 = i; libcrux_sha3_traits_set_ij_04( state, i0 / (size_t)5U, i0 % (size_t)5U, libcrux_sha3_traits_get_ij_04(state, i0 / (size_t)5U, i0 % (size_t)5U)[0U] ^ state_flat[i0]); d3295 2 a3296 4 This function found in impl {libcrux_sha3::traits::Absorb<1usize> for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d3299 1 a3299 1 A monomorphic instance of libcrux_sha3.simd.portable.load_block_a1 d3303 7 a3309 4 static inline void libcrux_sha3_simd_portable_load_block_a1_2c( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *input, size_t start) { libcrux_sha3_simd_portable_load_block_2c(self->st, input[0U], start); d3313 1 a3313 5 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_block_80 d3319 7 a3325 5 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_block_80_c61( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *blocks, size_t start) { libcrux_sha3_simd_portable_load_block_a1_2c(self, blocks, start); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); d3329 1 a3329 1 A monomorphic instance of libcrux_sha3.simd.portable.load_last a3331 1 - DELIMITER= 6 d3333 5 a3337 12 static KRML_MUSTINLINE void libcrux_sha3_simd_portable_load_last_1e( uint64_t *state, Eurydice_slice blocks, size_t start, size_t len) { uint8_t buffer[144U] = {0U}; Eurydice_slice_copy( Eurydice_array_to_subslice3(buffer, (size_t)0U, len, uint8_t *), Eurydice_slice_subslice3(blocks, start, start + len, uint8_t *), uint8_t); buffer[len] = 6U; size_t uu____0 = (size_t)144U - (size_t)1U; buffer[uu____0] = (uint32_t)buffer[uu____0] | 128U; libcrux_sha3_simd_portable_load_block_2c( state, Eurydice_array_to_slice((size_t)144U, buffer, uint8_t), (size_t)0U); d3341 2 a3342 4 This function found in impl {libcrux_sha3::traits::Absorb<1usize> for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d3345 1 a3345 1 A monomorphic instance of libcrux_sha3.simd.portable.load_last_a1 a3347 1 - DELIMITER= 6 d3349 7 a3355 4 static inline void libcrux_sha3_simd_portable_load_last_a1_1e( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *input, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_1e(self->st, input[0U], start, len); d3359 1 a3359 5 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_final_80 d3366 21 a3386 5 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_final_80_9e3( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *last, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_a1_1e(self, last, start, len); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); d3390 1 a3390 1 A monomorphic instance of libcrux_sha3.simd.portable.store_block d3394 6 a3399 8 static KRML_MUSTINLINE void libcrux_sha3_simd_portable_store_block_2c( uint64_t *s, Eurydice_slice out, size_t start, size_t len) { size_t octets = len / (size_t)8U; for (size_t i = (size_t)0U; i < octets; i++) { size_t i0 = i; Eurydice_slice uu____0 = Eurydice_slice_subslice3( out, start + (size_t)8U * i0, start + (size_t)8U * i0 + (size_t)8U, uint8_t *); d3401 1 a3401 3 core_num__u64__to_le_bytes( libcrux_sha3_traits_get_ij_04(s, i0 / (size_t)5U, i0 % (size_t)5U)[0U], ret); d3405 53 a3457 9 size_t remaining = len % (size_t)8U; if (remaining > (size_t)0U) { Eurydice_slice uu____1 = Eurydice_slice_subslice3( out, start + len - remaining, start + len, uint8_t *); uint8_t ret[8U]; core_num__u64__to_le_bytes( libcrux_sha3_traits_get_ij_04(s, octets / (size_t)5U, octets % (size_t)5U)[0U], ret); d3459 3 a3461 2 uu____1, Eurydice_array_to_subslice3(ret, (size_t)0U, remaining, uint8_t *), d3467 31 a3497 4 This function found in impl {libcrux_sha3::traits::Squeeze1 for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d3499 6 d3506 2 a3507 1 A monomorphic instance of libcrux_sha3.simd.portable.squeeze_13 d3509 1 d3512 18 a3529 4 static inline void libcrux_sha3_simd_portable_squeeze_13_2c( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice out, size_t start, size_t len) { libcrux_sha3_simd_portable_store_block_2c(self->st, out, start, len); d3533 2 a3534 1 A monomorphic instance of libcrux_sha3.generic_keccak.portable.keccak1 d3536 1 d3540 6 a3545 6 static inline void libcrux_sha3_generic_keccak_portable_keccak1_1e( Eurydice_slice data, Eurydice_slice out) { libcrux_sha3_generic_keccak_KeccakState_17 s = libcrux_sha3_generic_keccak_new_80_04(); size_t data_len = Eurydice_slice_len(data, uint8_t); for (size_t i = (size_t)0U; i < data_len / (size_t)144U; i++) { d3547 8 a3554 2 Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_block_80_c61(&s, buf, i0 * (size_t)144U); d3556 10 a3565 4 size_t rem = data_len % (size_t)144U; Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_final_80_9e3(&s, buf, data_len - rem, rem); size_t outlen = Eurydice_slice_len(out, uint8_t); d3569 1 a3569 1 libcrux_sha3_simd_portable_squeeze_13_2c(&s, out, (size_t)0U, outlen); d3571 27 a3597 6 libcrux_sha3_simd_portable_squeeze_13_2c(&s, out, (size_t)0U, (size_t)144U); for (size_t i = (size_t)1U; i < blocks; i++) { size_t i0 = i; libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_2c(&s, out, i0 * (size_t)144U, (size_t)144U); d3600 1 a3600 2 libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_2c(&s, out, last, outlen - last); d3606 14 d3624 3 a3626 1 libcrux_sha3_generic_keccak_portable_keccak1_1e(data, digest); d3630 1 a3630 1 A monomorphic instance of libcrux_sha3.simd.portable.load_block d3634 2 a3635 3 static KRML_MUSTINLINE void libcrux_sha3_simd_portable_load_block_7a( uint64_t *state, Eurydice_slice blocks, size_t start) { uint64_t state_flat[25U] = {0U}; a3637 1 size_t offset = start + (size_t)8U * i0; d3639 1 a3639 1 Result_15 dst; d3642 8 a3649 13 Eurydice_slice_subslice3(blocks, offset, offset + (size_t)8U, uint8_t *), Eurydice_slice, uint8_t[8U], TryFromSliceError); unwrap_26_68(dst, uu____0); state_flat[i0] = core_num__u64__from_le_bytes(uu____0); } for (size_t i = (size_t)0U; i < (size_t)104U / (size_t)8U; i++) { size_t i0 = i; libcrux_sha3_traits_set_ij_04( state, i0 / (size_t)5U, i0 % (size_t)5U, libcrux_sha3_traits_get_ij_04(state, i0 / (size_t)5U, i0 % (size_t)5U)[0U] ^ state_flat[i0]); d3654 2 a3655 4 This function found in impl {libcrux_sha3::traits::Absorb<1usize> for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d3658 1 a3658 1 A monomorphic instance of libcrux_sha3.simd.portable.load_block_a1 d3662 7 a3668 4 static inline void libcrux_sha3_simd_portable_load_block_a1_7a( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *input, size_t start) { libcrux_sha3_simd_portable_load_block_7a(self->st, input[0U], start); d3672 1 a3672 5 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_block_80 d3678 7 a3684 5 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_block_80_c62( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *blocks, size_t start) { libcrux_sha3_simd_portable_load_block_a1_7a(self, blocks, start); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); d3688 1 a3688 1 A monomorphic instance of libcrux_sha3.simd.portable.load_last a3690 1 - DELIMITER= 6 d3692 5 a3696 12 static KRML_MUSTINLINE void libcrux_sha3_simd_portable_load_last_7c( uint64_t *state, Eurydice_slice blocks, size_t start, size_t len) { uint8_t buffer[104U] = {0U}; Eurydice_slice_copy( Eurydice_array_to_subslice3(buffer, (size_t)0U, len, uint8_t *), Eurydice_slice_subslice3(blocks, start, start + len, uint8_t *), uint8_t); buffer[len] = 6U; size_t uu____0 = (size_t)104U - (size_t)1U; buffer[uu____0] = (uint32_t)buffer[uu____0] | 128U; libcrux_sha3_simd_portable_load_block_7a( state, Eurydice_array_to_slice((size_t)104U, buffer, uint8_t), (size_t)0U); d3700 2 a3701 4 This function found in impl {libcrux_sha3::traits::Absorb<1usize> for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d3704 1 a3704 1 A monomorphic instance of libcrux_sha3.simd.portable.load_last_a1 a3706 1 - DELIMITER= 6 d3708 7 a3714 4 static inline void libcrux_sha3_simd_portable_load_last_a1_7c( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *input, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_7c(self->st, input[0U], start, len); d3718 1 a3718 5 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.absorb_final_80 d3725 21 a3745 5 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_final_80_9e4( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *last, size_t start, size_t len) { libcrux_sha3_simd_portable_load_last_a1_7c(self, last, start, len); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); d3749 1 a3749 1 A monomorphic instance of libcrux_sha3.simd.portable.store_block d3753 6 a3758 8 static KRML_MUSTINLINE void libcrux_sha3_simd_portable_store_block_7a( uint64_t *s, Eurydice_slice out, size_t start, size_t len) { size_t octets = len / (size_t)8U; for (size_t i = (size_t)0U; i < octets; i++) { size_t i0 = i; Eurydice_slice uu____0 = Eurydice_slice_subslice3( out, start + (size_t)8U * i0, start + (size_t)8U * i0 + (size_t)8U, uint8_t *); d3760 1 a3760 3 core_num__u64__to_le_bytes( libcrux_sha3_traits_get_ij_04(s, i0 / (size_t)5U, i0 % (size_t)5U)[0U], ret); d3764 53 a3816 9 size_t remaining = len % (size_t)8U; if (remaining > (size_t)0U) { Eurydice_slice uu____1 = Eurydice_slice_subslice3( out, start + len - remaining, start + len, uint8_t *); uint8_t ret[8U]; core_num__u64__to_le_bytes( libcrux_sha3_traits_get_ij_04(s, octets / (size_t)5U, octets % (size_t)5U)[0U], ret); d3818 3 a3820 2 uu____1, Eurydice_array_to_subslice3(ret, (size_t)0U, remaining, uint8_t *), d3826 31 a3856 4 This function found in impl {libcrux_sha3::traits::Squeeze1 for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d3858 6 d3865 2 a3866 1 A monomorphic instance of libcrux_sha3.simd.portable.squeeze_13 d3868 1 d3871 18 a3888 4 static inline void libcrux_sha3_simd_portable_squeeze_13_7a( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice out, size_t start, size_t len) { libcrux_sha3_simd_portable_store_block_7a(self->st, out, start, len); d3892 2 a3893 1 A monomorphic instance of libcrux_sha3.generic_keccak.portable.keccak1 d3895 1 d3899 6 a3904 6 static inline void libcrux_sha3_generic_keccak_portable_keccak1_7c( Eurydice_slice data, Eurydice_slice out) { libcrux_sha3_generic_keccak_KeccakState_17 s = libcrux_sha3_generic_keccak_new_80_04(); size_t data_len = Eurydice_slice_len(data, uint8_t); for (size_t i = (size_t)0U; i < data_len / (size_t)104U; i++) { d3906 8 a3913 2 Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_block_80_c62(&s, buf, i0 * (size_t)104U); d3915 10 a3924 4 size_t rem = data_len % (size_t)104U; Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_final_80_9e4(&s, buf, data_len - rem, rem); size_t outlen = Eurydice_slice_len(out, uint8_t); d3928 1 a3928 1 libcrux_sha3_simd_portable_squeeze_13_7a(&s, out, (size_t)0U, outlen); d3930 27 a3956 6 libcrux_sha3_simd_portable_squeeze_13_7a(&s, out, (size_t)0U, (size_t)104U); for (size_t i = (size_t)1U; i < blocks; i++) { size_t i0 = i; libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_7a(&s, out, i0 * (size_t)104U, (size_t)104U); d3959 1 a3959 2 libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_7a(&s, out, last, outlen - last); d3965 14 d3983 3 a3985 1 libcrux_sha3_generic_keccak_portable_keccak1_7c(data, digest); d3994 2 a3995 2 static inline void libcrux_sha3_sha224_ema(Eurydice_slice digest, Eurydice_slice payload) { d4002 2 a4003 1 static inline void libcrux_sha3_sha224(Eurydice_slice data, uint8_t ret[28U]) { d4013 2 a4014 2 static inline void libcrux_sha3_sha256_ema(Eurydice_slice digest, Eurydice_slice payload) { d4021 2 a4022 1 static inline void libcrux_sha3_sha256(Eurydice_slice data, uint8_t ret[32U]) { d4032 2 a4033 2 static inline void libcrux_sha3_sha384_ema(Eurydice_slice digest, Eurydice_slice payload) { d4040 2 a4041 1 static inline void libcrux_sha3_sha384(Eurydice_slice data, uint8_t ret[48U]) { d4051 2 a4052 2 static inline void libcrux_sha3_sha512_ema(Eurydice_slice digest, Eurydice_slice payload) { d4059 2 a4060 1 static inline void libcrux_sha3_sha512(Eurydice_slice data, uint8_t ret[64U]) { d4068 53 a4120 4 This function found in impl {libcrux_sha3::traits::Absorb<1usize> for libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d4123 1 a4123 1 A monomorphic instance of libcrux_sha3.simd.portable.load_block_a1 d4127 4 a4130 4 static inline void libcrux_sha3_simd_portable_load_block_a1_3a( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *input, size_t start) { libcrux_sha3_simd_portable_load_block_3a(self->st, input[0U], start); d4134 5 a4138 2 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[TraitClause@@0, TraitClause@@1]} d4140 20 d4161 1 a4161 1 A monomorphic instance of libcrux_sha3.generic_keccak.absorb_block_80 d4167 18 a4184 5 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_absorb_block_80_c63( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice *blocks, size_t start) { libcrux_sha3_simd_portable_load_block_a1_3a(self, blocks, start); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); d4188 2 a4189 1 A monomorphic instance of libcrux_sha3.generic_keccak.portable.keccak1 d4191 1 d4195 6 a4200 6 static inline void libcrux_sha3_generic_keccak_portable_keccak1_c6( Eurydice_slice data, Eurydice_slice out) { libcrux_sha3_generic_keccak_KeccakState_17 s = libcrux_sha3_generic_keccak_new_80_04(); size_t data_len = Eurydice_slice_len(data, uint8_t); for (size_t i = (size_t)0U; i < data_len / (size_t)168U; i++) { d4202 8 a4209 2 Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_block_80_c63(&s, buf, i0 * (size_t)168U); d4211 10 a4220 4 size_t rem = data_len % (size_t)168U; Eurydice_slice buf[1U] = {data}; libcrux_sha3_generic_keccak_absorb_final_80_9e2(&s, buf, data_len - rem, rem); size_t outlen = Eurydice_slice_len(out, uint8_t); d4224 1 a4224 1 libcrux_sha3_simd_portable_squeeze_13_3a(&s, out, (size_t)0U, outlen); d4226 27 a4252 6 libcrux_sha3_simd_portable_squeeze_13_3a(&s, out, (size_t)0U, (size_t)168U); for (size_t i = (size_t)1U; i < blocks; i++) { size_t i0 = i; libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_3a(&s, out, i0 * (size_t)168U, (size_t)168U); d4255 1 a4255 2 libcrux_sha3_generic_keccak_keccakf1600_80_04(&s); libcrux_sha3_simd_portable_squeeze_13_3a(&s, out, last, outlen - last); d4261 14 d4279 3 a4281 1 libcrux_sha3_generic_keccak_portable_keccak1_c6(data, digest); d4289 2 a4290 2 static inline void libcrux_sha3_shake128_ema(Eurydice_slice out, Eurydice_slice data) { d4299 2 a4300 2 static inline void libcrux_sha3_shake256_ema(Eurydice_slice out, Eurydice_slice data) { d4304 14 d4319 1 a4319 4 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d4321 7 d4329 1 a4329 4 A monomorphic instance of libcrux_sha3.generic_keccak.portable.squeeze_first_five_blocks_b4 with const generics - RATE= 168 d4331 5 a4335 16 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_portable_squeeze_first_five_blocks_b4_3a( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice out) { libcrux_sha3_simd_portable_squeeze_13_3a(self, out, (size_t)0U, (size_t)168U); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); libcrux_sha3_simd_portable_squeeze_13_3a(self, out, (size_t)168U, (size_t)168U); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); libcrux_sha3_simd_portable_squeeze_13_3a(self, out, (size_t)2U * (size_t)168U, (size_t)168U); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); libcrux_sha3_simd_portable_squeeze_13_3a(self, out, (size_t)3U * (size_t)168U, (size_t)168U); libcrux_sha3_generic_keccak_keccakf1600_80_04(self); libcrux_sha3_simd_portable_squeeze_13_3a(self, out, (size_t)4U * (size_t)168U, (size_t)168U); d4339 1 a4339 1 Squeeze five blocks d4341 5 a4345 4 static KRML_MUSTINLINE void libcrux_sha3_portable_incremental_shake128_squeeze_first_five_blocks( libcrux_sha3_generic_keccak_KeccakState_17 *s, Eurydice_slice out0) { libcrux_sha3_generic_keccak_portable_squeeze_first_five_blocks_b4_3a(s, out0); d4349 1 a4349 1 Absorb some data for SHAKE-256 for the last time d4351 5 a4355 7 static KRML_MUSTINLINE void libcrux_sha3_portable_incremental_shake256_absorb_final( libcrux_sha3_generic_keccak_KeccakState_17 *s, Eurydice_slice data) { libcrux_sha3_generic_keccak_KeccakState_17 *uu____0 = s; Eurydice_slice uu____1[1U] = {data}; libcrux_sha3_generic_keccak_absorb_final_80_9e1( uu____0, uu____1, (size_t)0U, Eurydice_slice_len(data, uint8_t)); d4359 3 a4361 1 Create a new SHAKE-256 state object. d4363 7 a4369 3 static KRML_MUSTINLINE libcrux_sha3_generic_keccak_KeccakState_17 libcrux_sha3_portable_incremental_shake256_init(void) { return libcrux_sha3_generic_keccak_new_80_04(); d4372 4 d4377 1 a4377 4 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d4379 7 d4387 1 a4387 3 A monomorphic instance of libcrux_sha3.generic_keccak.portable.squeeze_first_block_b4 with const generics - RATE= 136 d4390 6 a4395 3 libcrux_sha3_generic_keccak_portable_squeeze_first_block_b4_5b( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice out) { libcrux_sha3_simd_portable_squeeze_13_5b(self, out, (size_t)0U, (size_t)136U); d4399 2 a4400 1 Squeeze the first SHAKE-256 block d4403 80 a4482 3 libcrux_sha3_portable_incremental_shake256_squeeze_first_block( libcrux_sha3_generic_keccak_KeccakState_17 *s, Eurydice_slice out) { libcrux_sha3_generic_keccak_portable_squeeze_first_block_b4_5b(s, out); d4486 1 a4486 4 This function found in impl {libcrux_sha3::generic_keccak::KeccakState[core::marker::Sized, libcrux_sha3::simd::portable::{libcrux_sha3::traits::KeccakItem<1usize> for u64}]} d4488 5 d4494 1 a4494 3 A monomorphic instance of libcrux_sha3.generic_keccak.portable.squeeze_next_block_b4 with const generics - RATE= 136 d4497 4 a4500 5 libcrux_sha3_generic_keccak_portable_squeeze_next_block_b4_5b( libcrux_sha3_generic_keccak_KeccakState_17 *self, Eurydice_slice out, size_t start) { libcrux_sha3_generic_keccak_keccakf1600_80_04(self); libcrux_sha3_simd_portable_squeeze_13_5b(self, out, start, (size_t)136U); d4508 3 a4510 3 libcrux_sha3_generic_keccak_KeccakState_17 *s, Eurydice_slice out) { libcrux_sha3_generic_keccak_portable_squeeze_next_block_b4_5b(s, out, (size_t)0U); d4514 1 a4514 1 A monomorphic instance of libcrux_sha3.generic_keccak.xof.KeccakXofState d4520 2 a4521 2 typedef struct libcrux_sha3_generic_keccak_xof_KeccakXofState_e2_s { libcrux_sha3_generic_keccak_KeccakState_17 inner; d4525 1 a4525 1 } libcrux_sha3_generic_keccak_xof_KeccakXofState_e2; d4527 6 a4532 2 typedef libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 libcrux_sha3_portable_incremental_Shake256Xof; d4534 5 d4540 2 a4541 3 This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} d4544 1 a4544 1 A monomorphic instance of libcrux_sha3.generic_keccak.xof.fill_buffer_35 d4550 3 a4552 3 static inline size_t libcrux_sha3_generic_keccak_xof_fill_buffer_35_c6( libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 *self, Eurydice_slice *inputs) { d4561 1 a4561 2 (size_t)136U, self->buf[i0], self->buf_len, uint8_t, size_t, uint8_t[]); d4564 1 a4564 2 Eurydice_slice_subslice_to(inputs[i0], consumed, uint8_t, size_t, uint8_t[]), d4574 2 a4575 3 This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} d4578 1 a4578 1 A monomorphic instance of libcrux_sha3.generic_keccak.xof.absorb_full_35 d4584 7 a4590 3 static inline size_t libcrux_sha3_generic_keccak_xof_absorb_full_35_c6( libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 *self, Eurydice_slice *inputs) { d4592 1 a4592 1 libcrux_sha3_generic_keccak_xof_fill_buffer_35_c6(self, inputs); d4597 2 a4598 2 borrowed[i] = core_array___Array_T__N___as_slice((size_t)136U, buf, uint8_t, Eurydice_slice); d4605 5 a4609 3 libcrux_sha3_simd_portable_load_block_a1_5b(&self->inner, borrowed, (size_t)0U); libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); d4618 9 a4626 3 libcrux_sha3_simd_portable_load_block_a1_5b( &self->inner, inputs, input_consumed + i0 * (size_t)136U); libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); d4632 14 a4645 3 This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} d4648 1 a4648 1 A monomorphic instance of libcrux_sha3.generic_keccak.xof.absorb_35 d4654 7 a4660 3 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_xof_absorb_35_c6( libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 *self, Eurydice_slice *inputs) { d4662 1 a4662 1 libcrux_sha3_generic_keccak_xof_absorb_full_35_c6(self, inputs); d4667 8 a4674 7 Eurydice_slice_copy(Eurydice_array_to_subslice3( self->buf[i0], self->buf_len, self->buf_len + input_remainder_len, uint8_t *), Eurydice_slice_subslice_from( inputs[i0], input_len - input_remainder_len, uint8_t, size_t, uint8_t[]), uint8_t); d4684 3 a4686 2 This function found in impl {libcrux_sha3::portable::incremental::Xof<136usize> for libcrux_sha3::portable::incremental::Shake256Xof} d4688 2 a4689 3 static inline void libcrux_sha3_portable_incremental_absorb_42( libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 *self, Eurydice_slice input) { d4691 1 a4691 1 libcrux_sha3_generic_keccak_xof_absorb_35_c6(self, buf); d4694 9 d4704 2 a4705 3 This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} d4708 1 a4708 1 A monomorphic instance of libcrux_sha3.generic_keccak.xof.absorb_final_35 d4715 11 a4725 10 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_xof_absorb_final_35_9e( libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 *self, Eurydice_slice *inputs) { libcrux_sha3_generic_keccak_xof_absorb_35_c6(self, inputs); Eurydice_slice borrowed[1U]; for (size_t i = (size_t)0U; i < (size_t)1U; i++) { uint8_t buf[136U] = {0U}; borrowed[i] = core_array___Array_T__N___as_slice((size_t)136U, buf, uint8_t, Eurydice_slice); } d4728 28 a4755 6 borrowed[i0] = Eurydice_array_to_slice((size_t)136U, self->buf[i0], uint8_t); } libcrux_sha3_simd_portable_load_last_a1_ad0(&self->inner, borrowed, (size_t)0U, self->buf_len); libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); d4762 3 a4764 2 This function found in impl {libcrux_sha3::portable::incremental::Xof<136usize> for libcrux_sha3::portable::incremental::Shake256Xof} d4766 3 a4768 3 static inline void libcrux_sha3_portable_incremental_absorb_final_42( libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 *self, Eurydice_slice input) { d4770 2 a4771 1 libcrux_sha3_generic_keccak_xof_absorb_final_35_9e(self, buf); d4775 5 a4779 3 This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} d4782 1 a4782 1 A monomorphic instance of libcrux_sha3.generic_keccak.xof.zero_block_35 d4788 1 a4788 1 static inline void libcrux_sha3_generic_keccak_xof_zero_block_35_c6( d4790 136 a4925 1 memset(ret, 0U, 136U * sizeof(uint8_t)); d4929 5 a4933 3 This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} d4936 1 a4936 1 A monomorphic instance of libcrux_sha3.generic_keccak.xof.new_35 d4942 7 a4948 9 static inline libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 libcrux_sha3_generic_keccak_xof_new_35_c6(void) { libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 lit; lit.inner = libcrux_sha3_generic_keccak_new_80_04(); uint8_t repeat_expression[1U][136U]; for (size_t i = (size_t)0U; i < (size_t)1U; i++) { libcrux_sha3_generic_keccak_xof_zero_block_35_c6(repeat_expression[i]); } memcpy(lit.buf, repeat_expression, (size_t)1U * sizeof(uint8_t[136U])); a4957 12 This function found in impl {libcrux_sha3::portable::incremental::Xof<136usize> for libcrux_sha3::portable::incremental::Shake256Xof} */ static inline libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 libcrux_sha3_portable_incremental_new_42(void) { return libcrux_sha3_generic_keccak_xof_new_35_c6(); } /** Squeeze `N` x `LEN` bytes. Only `N = 1` for now. */ /** d4959 2 a4960 45 {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_sha3.generic_keccak.xof.squeeze_85 with types uint64_t with const generics - RATE= 136 */ static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_xof_squeeze_85_c7( libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 *self, Eurydice_slice out) { if (self->sponge) { libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); } size_t out_len = Eurydice_slice_len(out, uint8_t); if (out_len > (size_t)0U) { if (out_len <= (size_t)136U) { libcrux_sha3_simd_portable_squeeze_13_5b(&self->inner, out, (size_t)0U, out_len); } else { size_t blocks = out_len / (size_t)136U; for (size_t i = (size_t)0U; i < blocks; i++) { size_t i0 = i; libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); libcrux_sha3_simd_portable_squeeze_13_5b( &self->inner, out, i0 * (size_t)136U, (size_t)136U); } size_t remaining = out_len % (size_t)136U; if (remaining > (size_t)0U) { libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); libcrux_sha3_simd_portable_squeeze_13_5b( &self->inner, out, blocks * (size_t)136U, remaining); } } self->sponge = true; } } /** Shake256 squeeze */ /** This function found in impl {libcrux_sha3::portable::incremental::Xof<136usize> for libcrux_sha3::portable::incremental::Shake256Xof} d4962 3 a4964 4 static inline void libcrux_sha3_portable_incremental_squeeze_42( libcrux_sha3_generic_keccak_xof_KeccakXofState_e2 *self, Eurydice_slice out) { libcrux_sha3_generic_keccak_xof_squeeze_85_c7(self, out); d4968 1 a4968 1 A monomorphic instance of libcrux_sha3.generic_keccak.xof.KeccakXofState d4974 2 a4975 2 typedef struct libcrux_sha3_generic_keccak_xof_KeccakXofState_97_s { libcrux_sha3_generic_keccak_KeccakState_17 inner; d4979 4 a4982 1 } libcrux_sha3_generic_keccak_xof_KeccakXofState_97; d4984 3 a4986 2 typedef libcrux_sha3_generic_keccak_xof_KeccakXofState_97 libcrux_sha3_portable_incremental_Shake128Xof; d4988 5 d4994 2 a4995 3 This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} d4998 1 a4998 1 A monomorphic instance of libcrux_sha3.generic_keccak.xof.fill_buffer_35 d5004 3 a5006 3 static inline size_t libcrux_sha3_generic_keccak_xof_fill_buffer_35_c60( libcrux_sha3_generic_keccak_xof_KeccakXofState_97 *self, Eurydice_slice *inputs) { d5015 1 a5015 2 (size_t)168U, self->buf[i0], self->buf_len, uint8_t, size_t, uint8_t[]); d5018 1 a5018 2 Eurydice_slice_subslice_to(inputs[i0], consumed, uint8_t, size_t, uint8_t[]), d5028 2 a5029 3 This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} d5032 1 a5032 1 A monomorphic instance of libcrux_sha3.generic_keccak.xof.absorb_full_35 d5038 7 a5044 3 static inline size_t libcrux_sha3_generic_keccak_xof_absorb_full_35_c60( libcrux_sha3_generic_keccak_xof_KeccakXofState_97 *self, Eurydice_slice *inputs) { d5046 1 a5046 1 libcrux_sha3_generic_keccak_xof_fill_buffer_35_c60(self, inputs); d5051 2 a5052 2 borrowed[i] = core_array___Array_T__N___as_slice((size_t)168U, buf, uint8_t, Eurydice_slice); d5059 5 a5063 3 libcrux_sha3_simd_portable_load_block_a1_3a(&self->inner, borrowed, (size_t)0U); libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); d5072 9 a5080 3 libcrux_sha3_simd_portable_load_block_a1_3a( &self->inner, inputs, input_consumed + i0 * (size_t)168U); libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); d5086 14 a5099 3 This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} d5102 1 a5102 1 A monomorphic instance of libcrux_sha3.generic_keccak.xof.absorb_35 d5108 7 a5114 3 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_xof_absorb_35_c60( libcrux_sha3_generic_keccak_xof_KeccakXofState_97 *self, Eurydice_slice *inputs) { d5116 1 a5116 1 libcrux_sha3_generic_keccak_xof_absorb_full_35_c60(self, inputs); d5121 8 a5128 7 Eurydice_slice_copy(Eurydice_array_to_subslice3( self->buf[i0], self->buf_len, self->buf_len + input_remainder_len, uint8_t *), Eurydice_slice_subslice_from( inputs[i0], input_len - input_remainder_len, uint8_t, size_t, uint8_t[]), uint8_t); d5135 3 a5137 2 This function found in impl {libcrux_sha3::portable::incremental::Xof<168usize> for libcrux_sha3::portable::incremental::Shake128Xof} d5139 2 a5140 3 static inline void libcrux_sha3_portable_incremental_absorb_26( libcrux_sha3_generic_keccak_xof_KeccakXofState_97 *self, Eurydice_slice input) { d5142 1 a5142 1 libcrux_sha3_generic_keccak_xof_absorb_35_c60(self, buf); d5145 9 d5155 2 a5156 3 This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} d5159 1 a5159 1 A monomorphic instance of libcrux_sha3.generic_keccak.xof.absorb_final_35 d5166 11 a5176 10 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_xof_absorb_final_35_9e0( libcrux_sha3_generic_keccak_xof_KeccakXofState_97 *self, Eurydice_slice *inputs) { libcrux_sha3_generic_keccak_xof_absorb_35_c60(self, inputs); Eurydice_slice borrowed[1U]; for (size_t i = (size_t)0U; i < (size_t)1U; i++) { uint8_t buf[168U] = {0U}; borrowed[i] = core_array___Array_T__N___as_slice((size_t)168U, buf, uint8_t, Eurydice_slice); } d5179 28 a5206 6 borrowed[i0] = Eurydice_array_to_slice((size_t)168U, self->buf[i0], uint8_t); } libcrux_sha3_simd_portable_load_last_a1_c6(&self->inner, borrowed, (size_t)0U, self->buf_len); libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); d5210 3 a5212 2 This function found in impl {libcrux_sha3::portable::incremental::Xof<168usize> for libcrux_sha3::portable::incremental::Shake128Xof} d5214 3 a5216 3 static inline void libcrux_sha3_portable_incremental_absorb_final_26( libcrux_sha3_generic_keccak_xof_KeccakXofState_97 *self, Eurydice_slice input) { d5218 2 a5219 1 libcrux_sha3_generic_keccak_xof_absorb_final_35_9e0(self, buf); d5223 5 a5227 3 This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} d5230 1 a5230 1 A monomorphic instance of libcrux_sha3.generic_keccak.xof.zero_block_35 d5236 1 a5236 1 static inline void libcrux_sha3_generic_keccak_xof_zero_block_35_c60( d5238 168 a5405 1 memset(ret, 0U, 168U * sizeof(uint8_t)); d5409 5 a5413 3 This function found in impl {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} d5416 1 a5416 1 A monomorphic instance of libcrux_sha3.generic_keccak.xof.new_35 d5422 7 a5428 9 static inline libcrux_sha3_generic_keccak_xof_KeccakXofState_97 libcrux_sha3_generic_keccak_xof_new_35_c60(void) { libcrux_sha3_generic_keccak_xof_KeccakXofState_97 lit; lit.inner = libcrux_sha3_generic_keccak_new_80_04(); uint8_t repeat_expression[1U][168U]; for (size_t i = (size_t)0U; i < (size_t)1U; i++) { libcrux_sha3_generic_keccak_xof_zero_block_35_c60(repeat_expression[i]); } memcpy(lit.buf, repeat_expression, (size_t)1U * sizeof(uint8_t[168U])); d5435 61 a5495 2 This function found in impl {libcrux_sha3::portable::incremental::Xof<168usize> for libcrux_sha3::portable::incremental::Shake128Xof} d5497 50 a5546 3 static inline libcrux_sha3_generic_keccak_xof_KeccakXofState_97 libcrux_sha3_portable_incremental_new_26(void) { return libcrux_sha3_generic_keccak_xof_new_35_c60(); d5550 1 a5550 1 Squeeze `N` x `LEN` bytes. Only `N = 1` for now. d5554 15 a5568 2 {libcrux_sha3::generic_keccak::xof::KeccakXofState[TraitClause@@0, TraitClause@@1]} d5571 40 a5610 1 A monomorphic instance of libcrux_sha3.generic_keccak.xof.squeeze_85 d5613 1 d5616 3 a5618 3 static KRML_MUSTINLINE void libcrux_sha3_generic_keccak_xof_squeeze_85_13( libcrux_sha3_generic_keccak_xof_KeccakXofState_97 *self, Eurydice_slice out) { d5620 10 a5629 1 libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); d5631 17 a5647 5 size_t out_len = Eurydice_slice_len(out, uint8_t); if (out_len > (size_t)0U) { if (out_len <= (size_t)168U) { libcrux_sha3_simd_portable_squeeze_13_3a(&self->inner, out, (size_t)0U, out_len); d5649 15 a5663 15 size_t blocks = out_len / (size_t)168U; for (size_t i = (size_t)0U; i < blocks; i++) { size_t i0 = i; libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); libcrux_sha3_simd_portable_squeeze_13_3a( &self->inner, out, i0 * (size_t)168U, (size_t)168U); } size_t remaining = out_len % (size_t)168U; if (remaining > (size_t)0U) { libcrux_sha3_generic_keccak_keccakf1600_80_04(&self->inner); libcrux_sha3_simd_portable_squeeze_13_3a( &self->inner, out, blocks * (size_t)168U, remaining); } } self->sponge = true; d5665 1 d5672 3 a5674 2 This function found in impl {libcrux_sha3::portable::incremental::Xof<168usize> for libcrux_sha3::portable::incremental::Shake128Xof} d5676 4 a5679 4 static inline void libcrux_sha3_portable_incremental_squeeze_26( libcrux_sha3_generic_keccak_xof_KeccakXofState_97 *self, Eurydice_slice out) { libcrux_sha3_generic_keccak_xof_squeeze_85_13(self, out); d5683 2 a5684 2 This function found in impl {core::clone::Clone for libcrux_sha3::portable::KeccakState} d5686 3 a5688 3 static inline libcrux_sha3_generic_keccak_KeccakState_17 libcrux_sha3_portable_clone_fe( libcrux_sha3_generic_keccak_KeccakState_17 *self) { d5693 2 a5694 2 This function found in impl {core::convert::From for u32} d5696 2 a5697 1 static inline uint32_t libcrux_sha3_from_6c(libcrux_sha3_Algorithm v) { d5699 2 a5700 1 case libcrux_sha3_Algorithm_Sha224: { d5703 3 a5705 2 case libcrux_sha3_Algorithm_Sha256: { return 2U; d5707 3 a5709 2 case libcrux_sha3_Algorithm_Sha384: { return 3U; d5711 3 a5713 2 case libcrux_sha3_Algorithm_Sha512: { return 4U; d5721 1 a5721 1 return 1U; d5725 2 a5726 2 This function found in impl {core::convert::From for libcrux_sha3::Algorithm} d5728 2 a5729 1 static inline libcrux_sha3_Algorithm libcrux_sha3_from_29(uint32_t v) { d5732 1 d5736 2 a5737 1 return libcrux_sha3_Algorithm_Sha256; d5740 2 a5741 1 return libcrux_sha3_Algorithm_Sha384; d5744 2 a5745 1 return libcrux_sha3_Algorithm_Sha512; d5753 1 a5753 1 return libcrux_sha3_Algorithm_Sha224; d5756 8 d5768 2 a5769 2 #define libcrux_sha3_portable_H_DEFINED #endif /* libcrux_sha3_portable_H */ d5771 1 a5771 1 /* from libcrux/libcrux-ml-kem/extracts/c_header_only/generated/libcrux_mlkem768_portable.h */ d5773 1 a5773 1 * SPDX-FileCopyrightText: 2025 Cryspen Sarl d5778 5 a5782 5 * Charon: 667d2fc98984ff7f3df989c2367e6c1fa4a000e7 * Eurydice: 2381cbc416ef2ad0b561c362c500bc84f36b6785 * Karamel: 80f5435f2fc505973c469a4afcc8d875cddd0d8b * F*: 71d8221589d4d438af3706d89cb653cf53e18aab * Libcrux: 68dfed5a4a9e40277f62828471c029afed1ecdcc d5785 2 a5786 3 #ifndef libcrux_mlkem768_portable_H #define libcrux_mlkem768_portable_H d5793 6 a5798 1 static inline void libcrux_ml_kem_hash_functions_portable_G( d5806 1 a5806 1 static inline void libcrux_ml_kem_hash_functions_portable_H( d5814 9 d5857 1 a5857 3 static KRML_MUSTINLINE int16_t libcrux_ml_kem_polynomial_zeta(size_t i) { return libcrux_ml_kem_polynomial_ZETAS_TIMES_MONTGOMERY_R[i]; } d5859 3 a5861 1 #define LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT ((size_t)16U) d5863 1 a5863 1 #define LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR ((size_t)16U) a5867 2 #define LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS ((int16_t)3329) d5880 1 a5880 1 Result_0a dst; d5882 3 a5884 3 &dst, Eurydice_slice_subslice3(array, (size_t)0U, (size_t)16U, int16_t *), Eurydice_slice, int16_t[16U], TryFromSliceError); unwrap_26_00(dst, ret); d5890 2 a5891 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d5894 135 a6028 3 libcrux_ml_kem_vector_portable_from_i16_array_b8(Eurydice_slice array) { return libcrux_ml_kem_vector_portable_vector_type_from_i16_array( libcrux_secrets_int_classify_public_classify_ref_9b_39(array)); d6042 63 d6108 16 a6123 4 int16_t ret[16U]; int16_t buf[16U] = {0U}; libcrux_secrets_int_public_integers_classify_27_46(buf, ret); memcpy(lit.elements, ret, (size_t)16U * sizeof(int16_t)); d6127 569 d6697 2 a6698 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d6701 1 a6701 1 libcrux_ml_kem_vector_portable_ZERO_b8(void) { d6719 2 a6720 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d6723 1 a6723 1 libcrux_ml_kem_vector_portable_add_b8( d6743 2 a6744 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d6747 1 a6747 1 libcrux_ml_kem_vector_portable_sub_b8( d6755 1 a6755 1 libcrux_ml_kem_vector_portable_vector_type_PortableVector vec, int16_t c) { d6760 1 a6760 1 vec.elements[uu____0] = vec.elements[uu____0] * c; d6762 1 a6762 1 return vec; d6766 2 a6767 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d6770 15 a6784 3 libcrux_ml_kem_vector_portable_multiply_by_constant_b8( libcrux_ml_kem_vector_portable_vector_type_PortableVector vec, int16_t c) { return libcrux_ml_kem_vector_portable_arithmetic_multiply_by_constant(vec, c); d6788 2 a6789 2 Note: This function is not secret independent Only use with public values. d6791 7 d6800 18 a6817 8 libcrux_ml_kem_vector_portable_vector_type_PortableVector vec) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; if (libcrux_secrets_int_public_integers_declassify_d8_39( vec.elements[i0]) >= (int16_t)3329) { size_t uu____0 = i0; vec.elements[uu____0] = vec.elements[uu____0] - (int16_t)3329; d6819 1 a6820 1 return vec; d6824 2 a6825 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d6828 1 a6828 1 libcrux_ml_kem_vector_portable_cond_subtract_3329_b8( d6836 1 a6836 1 #define LIBCRUX_ML_KEM_VECTOR_TRAITS_BARRETT_SHIFT ((int32_t)26) d6838 3 a6840 2 #define LIBCRUX_ML_KEM_VECTOR_TRAITS_BARRETT_R \ ((int32_t)1 << (uint32_t)LIBCRUX_ML_KEM_VECTOR_TRAITS_BARRETT_SHIFT) d6853 1 a6853 3 Note: The input bound is 28296 to prevent overflow in the multiplication of quotient by FIELD_MODULUS d6858 1 a6858 1 int32_t t = libcrux_secrets_int_as_i32_f5(value) * d6860 5 a6864 3 (LIBCRUX_ML_KEM_VECTOR_TRAITS_BARRETT_R >> 1U); int16_t quotient = libcrux_secrets_int_as_i16_36( t >> (uint32_t)LIBCRUX_ML_KEM_VECTOR_TRAITS_BARRETT_SHIFT); d6870 1 a6870 1 libcrux_ml_kem_vector_portable_vector_type_PortableVector vec) { d6874 1 a6874 1 int16_t vi = d6876 1 a6876 2 vec.elements[i0]); vec.elements[i0] = vi; d6878 1 a6878 1 return vec; d6882 2 a6883 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d6886 3 a6888 3 libcrux_ml_kem_vector_portable_barrett_reduce_b8( libcrux_ml_kem_vector_portable_vector_type_PortableVector vector) { return libcrux_ml_kem_vector_portable_arithmetic_barrett_reduce(vector); d6893 4 d6906 1 a6906 5 `|result| ≤ ceil(|value| / MONTGOMERY_R) + 1665 In particular, if `|value| ≤ FIELD_MODULUS-1 * FIELD_MODULUS-1`, then `|o| <= FIELD_MODULUS-1`. And, if `|value| ≤ pow2 16 * FIELD_MODULUS-1`, then `|o| <= FIELD_MODULUS + 1664 d6908 2 d6915 2 a6916 4 libcrux_secrets_int_as_i32_f5(libcrux_secrets_int_as_i16_36(value)) * libcrux_secrets_int_as_i32_b8( libcrux_secrets_int_public_integers_classify_27_df( LIBCRUX_ML_KEM_VECTOR_TRAITS_INVERSE_OF_MODULUS_MOD_MONTGOMERY_R)); d6918 9 a6926 10 libcrux_secrets_int_as_i32_f5(libcrux_secrets_int_as_i16_36(k)) * libcrux_secrets_int_as_i32_f5( libcrux_secrets_int_public_integers_classify_27_39( LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS)); int16_t c = libcrux_secrets_int_as_i16_36( k_times_modulus >> (uint32_t)LIBCRUX_ML_KEM_VECTOR_PORTABLE_ARITHMETIC_MONTGOMERY_SHIFT); int16_t value_high = libcrux_secrets_int_as_i16_36( value >> (uint32_t)LIBCRUX_ML_KEM_VECTOR_PORTABLE_ARITHMETIC_MONTGOMERY_SHIFT); a6943 2 int32_t product = libcrux_secrets_int_as_i32_f5(fe) * libcrux_secrets_int_as_i32_f5(fer); d6945 1 a6945 1 product); d6950 1 a6950 1 libcrux_ml_kem_vector_portable_vector_type_PortableVector vec, int16_t c) { d6954 1 a6954 1 vec.elements[i0] = d6956 1 a6956 1 vec.elements[i0], c); d6958 1 a6958 1 return vec; d6962 2 a6963 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d6966 2 a6967 3 libcrux_ml_kem_vector_portable_montgomery_multiply_by_constant_b8( libcrux_ml_kem_vector_portable_vector_type_PortableVector vector, int16_t constant) { d6969 1 a6969 51 vector, libcrux_secrets_int_public_integers_classify_27_39(constant)); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_arithmetic_bitwise_and_with_constant( libcrux_ml_kem_vector_portable_vector_type_PortableVector vec, int16_t c) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; size_t uu____0 = i0; vec.elements[uu____0] = vec.elements[uu____0] & c; } return vec; } /** A monomorphic instance of libcrux_ml_kem.vector.portable.arithmetic.shift_right with const generics - SHIFT_BY= 15 */ static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_arithmetic_shift_right_ef( libcrux_ml_kem_vector_portable_vector_type_PortableVector vec) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_ELEMENTS_IN_VECTOR; i++) { size_t i0 = i; vec.elements[i0] = vec.elements[i0] >> (uint32_t)(int32_t)15; } return vec; } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_arithmetic_to_unsigned_representative( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { libcrux_ml_kem_vector_portable_vector_type_PortableVector t = libcrux_ml_kem_vector_portable_arithmetic_shift_right_ef(a); libcrux_ml_kem_vector_portable_vector_type_PortableVector fm = libcrux_ml_kem_vector_portable_arithmetic_bitwise_and_with_constant( t, LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS); return libcrux_ml_kem_vector_portable_arithmetic_add(a, &fm); } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_to_unsigned_representative_b8( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { return libcrux_ml_kem_vector_portable_arithmetic_to_unsigned_representative( a); d6997 1 a6997 3 int16_t shifted = libcrux_secrets_int_public_integers_classify_27_39((int16_t)1664) - libcrux_secrets_int_as_i16_ca(fe); d7001 1 a7001 3 int16_t r0 = shifted_positive_in_range >> 15U; int16_t r1 = r0 & (int16_t)1; return libcrux_secrets_int_as_u8_f5(r1); d7006 1 a7006 1 libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { d7010 1 a7010 1 a.elements[i0] = libcrux_secrets_int_as_i16_59( d7012 1 a7012 1 libcrux_secrets_int_as_u16_f5(a.elements[i0]))); d7014 1 a7014 1 return a; d7018 2 a7019 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d7022 3 a7024 3 libcrux_ml_kem_vector_portable_compress_1_b8( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { return libcrux_ml_kem_vector_portable_compress_compress_1(a); d7036 1 a7036 2 uint64_t compressed = libcrux_secrets_int_as_u64_ca(fe) << (uint32_t)coefficient_bits; d7040 1 a7040 1 return libcrux_secrets_int_as_i16_b8( d7042 1 a7042 24 coefficient_bits, libcrux_secrets_int_as_u32_a3(compressed))); } static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_compress_decompress_1( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { libcrux_ml_kem_vector_portable_vector_type_PortableVector z = libcrux_ml_kem_vector_portable_vector_type_zero(); libcrux_ml_kem_vector_portable_vector_type_PortableVector s = libcrux_ml_kem_vector_portable_arithmetic_sub(z, &a); libcrux_ml_kem_vector_portable_vector_type_PortableVector res = libcrux_ml_kem_vector_portable_arithmetic_bitwise_and_with_constant( s, (int16_t)1665); return res; } /** This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} */ static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_decompress_1_b8( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { return libcrux_ml_kem_vector_portable_compress_decompress_1(a); d7046 2 a7047 2 libcrux_ml_kem_vector_portable_vector_type_PortableVector *vec, int16_t zeta, size_t i, size_t j) { d7050 3 a7052 6 vec->elements[j], libcrux_secrets_int_public_integers_classify_27_39(zeta)); int16_t a_minus_t = vec->elements[i] - t; int16_t a_plus_t = vec->elements[i] + t; vec->elements[j] = a_minus_t; vec->elements[i] = a_plus_t; d7057 3 a7059 3 libcrux_ml_kem_vector_portable_vector_type_PortableVector vec, int16_t zeta0, int16_t zeta1, int16_t zeta2, int16_t zeta3) { libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta0, (size_t)0U, d7061 1 a7061 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta0, (size_t)1U, d7063 1 a7063 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta1, (size_t)4U, d7065 1 a7065 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta1, (size_t)5U, d7067 1 a7067 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta2, (size_t)8U, d7069 1 a7069 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta2, (size_t)9U, d7071 1 a7071 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta3, (size_t)12U, d7073 1 a7073 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta3, (size_t)13U, d7075 1 a7075 1 return vec; d7079 2 a7080 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d7083 1 a7083 1 libcrux_ml_kem_vector_portable_ntt_layer_1_step_b8( d7092 3 a7094 3 libcrux_ml_kem_vector_portable_vector_type_PortableVector vec, int16_t zeta0, int16_t zeta1) { libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta0, (size_t)0U, d7096 1 a7096 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta0, (size_t)1U, d7098 1 a7098 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta0, (size_t)2U, d7100 1 a7100 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta0, (size_t)3U, d7102 1 a7102 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta1, (size_t)8U, d7104 1 a7104 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta1, (size_t)9U, d7106 1 a7106 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta1, (size_t)10U, d7108 1 a7108 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta1, (size_t)11U, d7110 1 a7110 1 return vec; d7114 2 a7115 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d7118 1 a7118 1 libcrux_ml_kem_vector_portable_ntt_layer_2_step_b8( d7126 4 a7129 7 libcrux_ml_kem_vector_portable_vector_type_PortableVector vec, int16_t zeta) { libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta, (size_t)0U, (size_t)8U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta, (size_t)1U, (size_t)9U); libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta, (size_t)2U, d7131 1 a7131 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta, (size_t)3U, d7133 1 a7133 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta, (size_t)4U, d7135 1 a7135 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta, (size_t)5U, d7137 1 a7137 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta, (size_t)6U, d7139 1 a7139 1 libcrux_ml_kem_vector_portable_ntt_ntt_step(&vec, zeta, (size_t)7U, d7141 1 a7141 1 return vec; d7145 2 a7146 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d7149 1 a7149 1 libcrux_ml_kem_vector_portable_ntt_layer_3_step_b8( d7155 7 a7161 7 libcrux_ml_kem_vector_portable_vector_type_PortableVector *vec, int16_t zeta, size_t i, size_t j) { int16_t a_minus_b = vec->elements[j] - vec->elements[i]; int16_t a_plus_b = vec->elements[j] + vec->elements[i]; int16_t o0 = libcrux_ml_kem_vector_portable_arithmetic_barrett_reduce_element( a_plus_b); int16_t o1 = d7163 1 a7163 3 a_minus_b, libcrux_secrets_int_public_integers_classify_27_39(zeta)); vec->elements[i] = o0; vec->elements[j] = o1; d7168 3 a7170 3 libcrux_ml_kem_vector_portable_vector_type_PortableVector vec, int16_t zeta0, int16_t zeta1, int16_t zeta2, int16_t zeta3) { libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta0, (size_t)0U, d7172 1 a7172 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta0, (size_t)1U, d7174 1 a7174 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta1, (size_t)4U, d7176 1 a7176 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta1, (size_t)5U, d7178 1 a7178 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta2, (size_t)8U, d7180 1 a7180 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta2, (size_t)9U, d7182 1 a7182 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta3, (size_t)12U, d7184 1 a7184 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta3, (size_t)13U, d7186 1 a7186 1 return vec; d7190 2 a7191 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d7194 1 a7194 1 libcrux_ml_kem_vector_portable_inv_ntt_layer_1_step_b8( d7203 3 a7205 3 libcrux_ml_kem_vector_portable_vector_type_PortableVector vec, int16_t zeta0, int16_t zeta1) { libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta0, (size_t)0U, d7207 1 a7207 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta0, (size_t)1U, d7209 1 a7209 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta0, (size_t)2U, d7211 1 a7211 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta0, (size_t)3U, d7213 1 a7213 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta1, (size_t)8U, d7215 1 a7215 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta1, (size_t)9U, d7217 1 a7217 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta1, (size_t)10U, d7219 1 a7219 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta1, (size_t)11U, d7221 1 a7221 1 return vec; d7225 2 a7226 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d7229 1 a7229 1 libcrux_ml_kem_vector_portable_inv_ntt_layer_2_step_b8( d7238 2 a7239 3 libcrux_ml_kem_vector_portable_vector_type_PortableVector vec, int16_t zeta) { libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta, (size_t)0U, d7241 1 a7241 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta, (size_t)1U, d7243 1 a7243 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta, (size_t)2U, d7245 1 a7245 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta, (size_t)3U, d7247 1 a7247 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta, (size_t)4U, d7249 1 a7249 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta, (size_t)5U, d7251 1 a7251 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta, (size_t)6U, d7253 1 a7253 1 libcrux_ml_kem_vector_portable_ntt_inv_ntt_step(&vec, zeta, (size_t)7U, d7255 1 a7255 1 return vec; d7259 2 a7260 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d7263 1 a7263 1 libcrux_ml_kem_vector_portable_inv_ntt_layer_3_step_b8( d7294 8 a7301 23 size_t i, libcrux_ml_kem_vector_portable_vector_type_PortableVector *out) { int16_t ai = a->elements[(size_t)2U * i]; int16_t bi = b->elements[(size_t)2U * i]; int16_t aj = a->elements[(size_t)2U * i + (size_t)1U]; int16_t bj = b->elements[(size_t)2U * i + (size_t)1U]; int32_t ai_bi = libcrux_secrets_int_as_i32_f5(ai) * libcrux_secrets_int_as_i32_f5(bi); int32_t aj_bj_ = libcrux_secrets_int_as_i32_f5(aj) * libcrux_secrets_int_as_i32_f5(bj); int16_t aj_bj = libcrux_ml_kem_vector_portable_arithmetic_montgomery_reduce_element( aj_bj_); int32_t aj_bj_zeta = libcrux_secrets_int_as_i32_f5(aj_bj) * libcrux_secrets_int_as_i32_f5(zeta); int32_t ai_bi_aj_bj = ai_bi + aj_bj_zeta; int16_t o0 = libcrux_ml_kem_vector_portable_arithmetic_montgomery_reduce_element( ai_bi_aj_bj); int32_t ai_bj = libcrux_secrets_int_as_i32_f5(ai) * libcrux_secrets_int_as_i32_f5(bj); int32_t aj_bi = libcrux_secrets_int_as_i32_f5(aj) * libcrux_secrets_int_as_i32_f5(bi); int32_t ai_bj_aj_bi = ai_bj + aj_bi; d7304 4 a7307 3 ai_bj_aj_bi); out->elements[(size_t)2U * i] = o0; out->elements[(size_t)2U * i + (size_t)1U] = o1; a7314 4 int16_t nzeta0 = -zeta0; int16_t nzeta1 = -zeta1; int16_t nzeta2 = -zeta2; int16_t nzeta3 = -zeta3; d7318 1 a7318 2 lhs, rhs, libcrux_secrets_int_public_integers_classify_27_39(zeta0), (size_t)0U, &out); d7320 1 a7320 2 lhs, rhs, libcrux_secrets_int_public_integers_classify_27_39(nzeta0), (size_t)1U, &out); d7322 1 a7322 2 lhs, rhs, libcrux_secrets_int_public_integers_classify_27_39(zeta1), (size_t)2U, &out); d7324 1 a7324 2 lhs, rhs, libcrux_secrets_int_public_integers_classify_27_39(nzeta1), (size_t)3U, &out); d7326 1 a7326 2 lhs, rhs, libcrux_secrets_int_public_integers_classify_27_39(zeta2), (size_t)4U, &out); d7328 1 a7328 2 lhs, rhs, libcrux_secrets_int_public_integers_classify_27_39(nzeta2), (size_t)5U, &out); d7330 1 a7330 2 lhs, rhs, libcrux_secrets_int_public_integers_classify_27_39(zeta3), (size_t)6U, &out); d7332 1 a7332 2 lhs, rhs, libcrux_secrets_int_public_integers_classify_27_39(nzeta3), (size_t)7U, &out); d7337 2 a7338 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d7341 1 a7341 1 libcrux_ml_kem_vector_portable_ntt_multiply_b8( d7353 15 a7367 28 uint8_t result0 = (((((((uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[0U]) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[1U]) << 1U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[2U]) << 2U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[3U]) << 3U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[4U]) << 4U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[5U]) << 5U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[6U]) << 6U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[7U]) << 7U; uint8_t result1 = (((((((uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[8U]) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[9U]) << 1U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[10U]) << 2U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[11U]) << 3U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[12U]) << 4U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[13U]) << 5U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[14U]) << 6U) | (uint32_t)libcrux_secrets_int_as_u8_f5(v.elements[15U]) << 7U; ret[0U] = result0; ret[1U] = result1; } static inline void libcrux_ml_kem_vector_portable_serialize_1( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, uint8_t ret[2U]) { uint8_t ret0[2U]; libcrux_ml_kem_vector_portable_serialize_serialize_1(a, ret0); libcrux_secrets_int_public_integers_declassify_d8_d4(ret0, ret); d7371 2 a7372 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d7374 1 a7374 1 static inline void libcrux_ml_kem_vector_portable_serialize_1_b8( d7377 1 a7377 1 libcrux_ml_kem_vector_portable_serialize_1(a, ret); d7382 18 a7399 57 int16_t result0 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)0U, uint8_t, uint8_t *) & 1U); int16_t result1 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)0U, uint8_t, uint8_t *) >> 1U & 1U); int16_t result2 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)0U, uint8_t, uint8_t *) >> 2U & 1U); int16_t result3 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)0U, uint8_t, uint8_t *) >> 3U & 1U); int16_t result4 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)0U, uint8_t, uint8_t *) >> 4U & 1U); int16_t result5 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)0U, uint8_t, uint8_t *) >> 5U & 1U); int16_t result6 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)0U, uint8_t, uint8_t *) >> 6U & 1U); int16_t result7 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)0U, uint8_t, uint8_t *) >> 7U & 1U); int16_t result8 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)1U, uint8_t, uint8_t *) & 1U); int16_t result9 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)1U, uint8_t, uint8_t *) >> 1U & 1U); int16_t result10 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)1U, uint8_t, uint8_t *) >> 2U & 1U); int16_t result11 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)1U, uint8_t, uint8_t *) >> 3U & 1U); int16_t result12 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)1U, uint8_t, uint8_t *) >> 4U & 1U); int16_t result13 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)1U, uint8_t, uint8_t *) >> 5U & 1U); int16_t result14 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)1U, uint8_t, uint8_t *) >> 6U & 1U); int16_t result15 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(v, (size_t)1U, uint8_t, uint8_t *) >> 7U & 1U); return ( KRML_CLITERAL(libcrux_ml_kem_vector_portable_vector_type_PortableVector){ .elements = {result0, result1, result2, result3, result4, result5, result6, result7, result8, result9, result10, result11, result12, result13, result14, result15}}); } static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_deserialize_1(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_serialize_deserialize_1( libcrux_secrets_int_classify_public_classify_ref_9b_90(a)); d7403 2 a7404 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d7407 2 a7408 2 libcrux_ml_kem_vector_portable_deserialize_1_b8(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_deserialize_1(a); d7420 21 a7440 21 uint8_t result0 = (uint32_t)libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)1U, int16_t, int16_t *)) << 4U | (uint32_t)libcrux_secrets_int_as_u8_f5(Eurydice_slice_index( v, (size_t)0U, int16_t, int16_t *)); uint8_t result1 = (uint32_t)libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)3U, int16_t, int16_t *)) << 4U | (uint32_t)libcrux_secrets_int_as_u8_f5(Eurydice_slice_index( v, (size_t)2U, int16_t, int16_t *)); uint8_t result2 = (uint32_t)libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)5U, int16_t, int16_t *)) << 4U | (uint32_t)libcrux_secrets_int_as_u8_f5(Eurydice_slice_index( v, (size_t)4U, int16_t, int16_t *)); uint8_t result3 = (uint32_t)libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)7U, int16_t, int16_t *)) << 4U | (uint32_t)libcrux_secrets_int_as_u8_f5(Eurydice_slice_index( v, (size_t)6U, int16_t, int16_t *)); return (KRML_CLITERAL(uint8_t_x4){ d7450 2 a7451 2 Eurydice_array_to_subslice3(v.elements, (size_t)0U, (size_t)8U, int16_t *)); d7454 12 a7465 18 Eurydice_array_to_subslice3(v.elements, (size_t)8U, (size_t)16U, int16_t *)); ret[0U] = result0_3.fst; ret[1U] = result0_3.snd; ret[2U] = result0_3.thd; ret[3U] = result0_3.f3; ret[4U] = result4_7.fst; ret[5U] = result4_7.snd; ret[6U] = result4_7.thd; ret[7U] = result4_7.f3; } static inline void libcrux_ml_kem_vector_portable_serialize_4( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, uint8_t ret[8U]) { uint8_t ret0[8U]; libcrux_ml_kem_vector_portable_serialize_serialize_4(a, ret0); libcrux_secrets_int_public_integers_declassify_d8_76(ret0, ret); d7469 2 a7470 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d7472 1 a7472 1 static inline void libcrux_ml_kem_vector_portable_serialize_4_b8( d7475 1 a7475 1 libcrux_ml_kem_vector_portable_serialize_4(a, ret); d7481 36 a7516 36 int16_t v0 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(bytes, (size_t)0U, uint8_t, uint8_t *) & 15U); int16_t v1 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(bytes, (size_t)0U, uint8_t, uint8_t *) >> 4U & 15U); int16_t v2 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *) & 15U); int16_t v3 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *) >> 4U & 15U); int16_t v4 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(bytes, (size_t)2U, uint8_t, uint8_t *) & 15U); int16_t v5 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(bytes, (size_t)2U, uint8_t, uint8_t *) >> 4U & 15U); int16_t v6 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(bytes, (size_t)3U, uint8_t, uint8_t *) & 15U); int16_t v7 = libcrux_secrets_int_as_i16_59( (uint32_t)Eurydice_slice_index(bytes, (size_t)3U, uint8_t, uint8_t *) >> 4U & 15U); return (KRML_CLITERAL(int16_t_x8){.fst = v0, .snd = v1, .thd = v2, .f3 = v3, .f4 = v4, .f5 = v5, .f6 = v6, .f7 = v7}); d7522 1 a7522 1 Eurydice_slice_subslice3(bytes, (size_t)0U, (size_t)4U, uint8_t *)); d7524 20 a7543 12 Eurydice_slice_subslice3(bytes, (size_t)4U, (size_t)8U, uint8_t *)); return ( KRML_CLITERAL(libcrux_ml_kem_vector_portable_vector_type_PortableVector){ .elements = {v0_7.fst, v0_7.snd, v0_7.thd, v0_7.f3, v0_7.f4, v0_7.f5, v0_7.f6, v0_7.f7, v8_15.fst, v8_15.snd, v8_15.thd, v8_15.f3, v8_15.f4, v8_15.f5, v8_15.f6, v8_15.f7}}); } static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_deserialize_4(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_serialize_deserialize_4( libcrux_secrets_int_classify_public_classify_ref_9b_90(a)); d7547 2 a7548 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d7551 2 a7552 2 libcrux_ml_kem_vector_portable_deserialize_4_b8(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_deserialize_4(a); d7564 4 a7567 3 libcrux_ml_kem_vector_portable_serialize_serialize_10_int(Eurydice_slice v) { uint8_t r0 = libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)0U, int16_t, int16_t *) & (int16_t)255); d7569 4 a7572 6 (uint32_t)libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)1U, int16_t, int16_t *) & (int16_t)63) << 2U | (uint32_t)libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)0U, int16_t, int16_t *) >> 8U & (int16_t)3); d7574 2 a7575 6 (uint32_t)libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)2U, int16_t, int16_t *) & (int16_t)15) << 4U | (uint32_t)libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)1U, int16_t, int16_t *) >> 6U & (int16_t)15); d7577 165 a7741 10 (uint32_t)libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)3U, int16_t, int16_t *) & (int16_t)3) << 6U | (uint32_t)libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)2U, int16_t, int16_t *) >> 4U & (int16_t)63); uint8_t r4 = libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)3U, int16_t, int16_t *) >> 2U & (int16_t)255); return (KRML_CLITERAL(uint8_t_x5){ d7750 1 a7750 2 Eurydice_array_to_subslice3(v.elements, (size_t)0U, (size_t)4U, int16_t *)); d7752 1 a7752 2 Eurydice_array_to_subslice3(v.elements, (size_t)4U, (size_t)8U, int16_t *)); d7754 2 a7755 2 Eurydice_array_to_subslice3(v.elements, (size_t)8U, (size_t)12U, int16_t *)); d7757 24 a7780 30 Eurydice_array_to_subslice3(v.elements, (size_t)12U, (size_t)16U, int16_t *)); ret[0U] = r0_4.fst; ret[1U] = r0_4.snd; ret[2U] = r0_4.thd; ret[3U] = r0_4.f3; ret[4U] = r0_4.f4; ret[5U] = r5_9.fst; ret[6U] = r5_9.snd; ret[7U] = r5_9.thd; ret[8U] = r5_9.f3; ret[9U] = r5_9.f4; ret[10U] = r10_14.fst; ret[11U] = r10_14.snd; ret[12U] = r10_14.thd; ret[13U] = r10_14.f3; ret[14U] = r10_14.f4; ret[15U] = r15_19.fst; ret[16U] = r15_19.snd; ret[17U] = r15_19.thd; ret[18U] = r15_19.f3; ret[19U] = r15_19.f4; } static inline void libcrux_ml_kem_vector_portable_serialize_10( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, uint8_t ret[20U]) { uint8_t ret0[20U]; libcrux_ml_kem_vector_portable_serialize_serialize_10(a, ret0); libcrux_secrets_int_public_integers_declassify_d8_57(ret0, ret); d7784 2 a7785 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d7787 1 a7787 1 static inline void libcrux_ml_kem_vector_portable_serialize_10_b8( d7790 1 a7790 1 libcrux_ml_kem_vector_portable_serialize_10(a, ret); d7796 2 a7797 3 int16_t r0 = libcrux_secrets_int_as_i16_f5( (libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *)) & d7800 4 a7803 6 (libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)0U, uint8_t, uint8_t *)) & (int16_t)255)); int16_t r1 = libcrux_secrets_int_as_i16_f5( (libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)2U, uint8_t, uint8_t *)) & d7806 4 a7809 6 libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *)) >> 2U); int16_t r2 = libcrux_secrets_int_as_i16_f5( (libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)3U, uint8_t, uint8_t *)) & d7812 4 a7815 6 libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)2U, uint8_t, uint8_t *)) >> 4U); int16_t r3 = libcrux_secrets_int_as_i16_f5( libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)4U, uint8_t, uint8_t *)) d7817 4 a7820 6 libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)3U, uint8_t, uint8_t *)) >> 6U); int16_t r4 = libcrux_secrets_int_as_i16_f5( (libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)6U, uint8_t, uint8_t *)) & d7823 4 a7826 6 (libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)5U, uint8_t, uint8_t *)) & (int16_t)255)); int16_t r5 = libcrux_secrets_int_as_i16_f5( (libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)7U, uint8_t, uint8_t *)) & d7829 4 a7832 6 libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)6U, uint8_t, uint8_t *)) >> 2U); int16_t r6 = libcrux_secrets_int_as_i16_f5( (libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)8U, uint8_t, uint8_t *)) & d7835 4 a7838 6 libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)7U, uint8_t, uint8_t *)) >> 4U); int16_t r7 = libcrux_secrets_int_as_i16_f5( libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)9U, uint8_t, uint8_t *)) d7840 10 a7849 11 libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)8U, uint8_t, uint8_t *)) >> 6U); return (KRML_CLITERAL(int16_t_x8){.fst = r0, .snd = r1, .thd = r2, .f3 = r3, .f4 = r4, .f5 = r5, .f6 = r6, .f7 = r7}); d7855 1 a7855 1 Eurydice_slice_subslice3(bytes, (size_t)0U, (size_t)10U, uint8_t *)); d7858 20 a7877 12 Eurydice_slice_subslice3(bytes, (size_t)10U, (size_t)20U, uint8_t *)); return ( KRML_CLITERAL(libcrux_ml_kem_vector_portable_vector_type_PortableVector){ .elements = {v0_7.fst, v0_7.snd, v0_7.thd, v0_7.f3, v0_7.f4, v0_7.f5, v0_7.f6, v0_7.f7, v8_15.fst, v8_15.snd, v8_15.thd, v8_15.f3, v8_15.f4, v8_15.f5, v8_15.f6, v8_15.f7}}); } static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_deserialize_10(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_serialize_deserialize_10( libcrux_secrets_int_classify_public_classify_ref_9b_90(a)); d7881 2 a7882 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d7885 2 a7886 2 libcrux_ml_kem_vector_portable_deserialize_10_b8(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_deserialize_10(a); d7897 12 a7908 10 uint8_t r0 = libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)0U, int16_t, int16_t *) & (int16_t)255); uint8_t r1 = libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)0U, int16_t, int16_t *) >> 8U | (Eurydice_slice_index(v, (size_t)1U, int16_t, int16_t *) & (int16_t)15) << 4U); uint8_t r2 = libcrux_secrets_int_as_u8_f5( Eurydice_slice_index(v, (size_t)1U, int16_t, int16_t *) >> 4U & (int16_t)255); return (KRML_CLITERAL(uint8_t_x3){.fst = r0, .snd = r1, .thd = r2}); d7916 1 a7916 2 Eurydice_array_to_subslice3(v.elements, (size_t)0U, (size_t)2U, int16_t *)); d7918 1 a7918 2 Eurydice_array_to_subslice3(v.elements, (size_t)2U, (size_t)4U, int16_t *)); d7920 1 a7920 2 Eurydice_array_to_subslice3(v.elements, (size_t)4U, (size_t)6U, int16_t *)); d7922 1 a7922 2 Eurydice_array_to_subslice3(v.elements, (size_t)6U, (size_t)8U, int16_t *)); d7924 2 a7925 2 Eurydice_array_to_subslice3(v.elements, (size_t)8U, (size_t)10U, int16_t *)); d7927 2 a7928 2 Eurydice_array_to_subslice3(v.elements, (size_t)10U, (size_t)12U, int16_t *)); d7930 2 a7931 2 Eurydice_array_to_subslice3(v.elements, (size_t)12U, (size_t)14U, int16_t *)); d7933 28 a7960 34 Eurydice_array_to_subslice3(v.elements, (size_t)14U, (size_t)16U, int16_t *)); ret[0U] = r0_2.fst; ret[1U] = r0_2.snd; ret[2U] = r0_2.thd; ret[3U] = r3_5.fst; ret[4U] = r3_5.snd; ret[5U] = r3_5.thd; ret[6U] = r6_8.fst; ret[7U] = r6_8.snd; ret[8U] = r6_8.thd; ret[9U] = r9_11.fst; ret[10U] = r9_11.snd; ret[11U] = r9_11.thd; ret[12U] = r12_14.fst; ret[13U] = r12_14.snd; ret[14U] = r12_14.thd; ret[15U] = r15_17.fst; ret[16U] = r15_17.snd; ret[17U] = r15_17.thd; ret[18U] = r18_20.fst; ret[19U] = r18_20.snd; ret[20U] = r18_20.thd; ret[21U] = r21_23.fst; ret[22U] = r21_23.snd; ret[23U] = r21_23.thd; } static inline void libcrux_ml_kem_vector_portable_serialize_12( libcrux_ml_kem_vector_portable_vector_type_PortableVector a, uint8_t ret[24U]) { uint8_t ret0[24U]; libcrux_ml_kem_vector_portable_serialize_serialize_12(a, ret0); libcrux_secrets_int_public_integers_declassify_d8_d2(ret0, ret); d7964 2 a7965 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d7967 1 a7967 1 static inline void libcrux_ml_kem_vector_portable_serialize_12_b8( d7970 1 a7970 1 libcrux_ml_kem_vector_portable_serialize_12(a, ret); d7981 6 a7986 6 int16_t byte0 = libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)0U, uint8_t, uint8_t *)); int16_t byte1 = libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)1U, uint8_t, uint8_t *)); int16_t byte2 = libcrux_secrets_int_as_i16_59( Eurydice_slice_index(bytes, (size_t)2U, uint8_t, uint8_t *)); d7989 1 a7989 1 return (KRML_CLITERAL(int16_t_x2){.fst = r0, .snd = r1}); d7995 1 a7995 1 Eurydice_slice_subslice3(bytes, (size_t)0U, (size_t)3U, uint8_t *)); d7997 1 a7997 1 Eurydice_slice_subslice3(bytes, (size_t)3U, (size_t)6U, uint8_t *)); d7999 1 a7999 1 Eurydice_slice_subslice3(bytes, (size_t)6U, (size_t)9U, uint8_t *)); d8001 1 a8001 1 Eurydice_slice_subslice3(bytes, (size_t)9U, (size_t)12U, uint8_t *)); d8003 1 a8003 1 Eurydice_slice_subslice3(bytes, (size_t)12U, (size_t)15U, uint8_t *)); d8006 1 a8006 1 Eurydice_slice_subslice3(bytes, (size_t)15U, (size_t)18U, uint8_t *)); d8009 1 a8009 1 Eurydice_slice_subslice3(bytes, (size_t)18U, (size_t)21U, uint8_t *)); d8012 20 a8031 13 Eurydice_slice_subslice3(bytes, (size_t)21U, (size_t)24U, uint8_t *)); return ( KRML_CLITERAL(libcrux_ml_kem_vector_portable_vector_type_PortableVector){ .elements = {v0_1.fst, v0_1.snd, v2_3.fst, v2_3.snd, v4_5.fst, v4_5.snd, v6_7.fst, v6_7.snd, v8_9.fst, v8_9.snd, v10_11.fst, v10_11.snd, v12_13.fst, v12_13.snd, v14_15.fst, v14_15.snd}}); } static inline libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_vector_portable_deserialize_12(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_serialize_deserialize_12( libcrux_secrets_int_classify_public_classify_ref_9b_90(a)); d8035 2 a8036 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d8039 2 a8040 2 libcrux_ml_kem_vector_portable_deserialize_12_b8(Eurydice_slice a) { return libcrux_ml_kem_vector_portable_deserialize_12(a); d8058 7 d8069 15 d8086 10 a8095 3 if (d2 < LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS) { if (sampled < (size_t)16U) { Eurydice_slice_index(result, sampled, int16_t, int16_t *) = d2; d8097 1 d8105 2 a8106 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d8108 1 a8108 1 static inline size_t libcrux_ml_kem_vector_portable_rej_sample_b8( d8113 1 a8113 1 #define LIBCRUX_ML_KEM_MLKEM768_VECTOR_U_COMPRESSION_FACTOR ((size_t)10U) d8115 1 a8115 1 #define LIBCRUX_ML_KEM_MLKEM768_C1_BLOCK_SIZE \ d8117 1 a8117 1 LIBCRUX_ML_KEM_MLKEM768_VECTOR_U_COMPRESSION_FACTOR / (size_t)8U) d8119 1 a8119 1 #define LIBCRUX_ML_KEM_MLKEM768_RANK ((size_t)3U) d8121 2 a8122 2 #define LIBCRUX_ML_KEM_MLKEM768_C1_SIZE \ (LIBCRUX_ML_KEM_MLKEM768_C1_BLOCK_SIZE * LIBCRUX_ML_KEM_MLKEM768_RANK) d8124 1 a8124 1 #define LIBCRUX_ML_KEM_MLKEM768_VECTOR_V_COMPRESSION_FACTOR ((size_t)4U) d8126 1 a8126 1 #define LIBCRUX_ML_KEM_MLKEM768_C2_SIZE \ d8128 1 a8128 1 LIBCRUX_ML_KEM_MLKEM768_VECTOR_V_COMPRESSION_FACTOR / (size_t)8U) d8130 2 a8131 2 #define LIBCRUX_ML_KEM_MLKEM768_CPA_PKE_CIPHERTEXT_SIZE \ (LIBCRUX_ML_KEM_MLKEM768_C1_SIZE + LIBCRUX_ML_KEM_MLKEM768_C2_SIZE) d8133 2 a8134 2 #define LIBCRUX_ML_KEM_MLKEM768_T_AS_NTT_ENCODED_SIZE \ (LIBCRUX_ML_KEM_MLKEM768_RANK * \ d8138 2 a8139 2 #define LIBCRUX_ML_KEM_MLKEM768_CPA_PKE_PUBLIC_KEY_SIZE \ (LIBCRUX_ML_KEM_MLKEM768_T_AS_NTT_ENCODED_SIZE + (size_t)32U) d8141 3 a8143 3 #define LIBCRUX_ML_KEM_MLKEM768_CPA_PKE_SECRET_KEY_SIZE \ (LIBCRUX_ML_KEM_MLKEM768_RANK * \ LIBCRUX_ML_KEM_CONSTANTS_COEFFICIENTS_IN_RING_ELEMENT * \ d8158 1 a8158 1 LIBCRUX_ML_KEM_MLKEM768_CPA_PKE_CIPHERTEXT_SIZE) d8160 1 a8160 1 typedef libcrux_ml_kem_types_MlKemPrivateKey_d9 d8163 1 a8163 1 typedef libcrux_ml_kem_types_MlKemPublicKey_30 d8166 2 a8167 2 #define LIBCRUX_ML_KEM_MLKEM768_RANKED_BYTES_PER_RING_ELEMENT \ (LIBCRUX_ML_KEM_MLKEM768_RANK * \ d8170 4 a8173 4 #define LIBCRUX_ML_KEM_MLKEM768_SECRET_KEY_SIZE \ (LIBCRUX_ML_KEM_MLKEM768_CPA_PKE_SECRET_KEY_SIZE + \ LIBCRUX_ML_KEM_MLKEM768_CPA_PKE_PUBLIC_KEY_SIZE + \ LIBCRUX_ML_KEM_CONSTANTS_H_DIGEST_SIZE + \ d8181 1 a8181 1 typedef struct libcrux_ml_kem_polynomial_PolynomialRingElement_1d_s { d8183 1 a8183 11 } libcrux_ml_kem_polynomial_PolynomialRingElement_1d; /** A monomorphic instance of libcrux_ml_kem.ind_cpa.unpacked.IndCpaPrivateKeyUnpacked with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - $3size_t */ typedef struct libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_a0_s { libcrux_ml_kem_polynomial_PolynomialRingElement_1d secret_as_ntt[3U]; } libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_a0; d8187 1 a8187 2 {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]} d8190 1 a8190 1 A monomorphic instance of libcrux_ml_kem.polynomial.ZERO_d6 d8195 19 a8213 11 static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_polynomial_ZERO_d6_ea(void) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d lit; libcrux_ml_kem_vector_portable_vector_type_PortableVector repeat_expression[16U]; for (size_t i = (size_t)0U; i < (size_t)16U; i++) { repeat_expression[i] = libcrux_ml_kem_vector_portable_ZERO_b8(); } memcpy(lit.coefficients, repeat_expression, (size_t)16U * sizeof(libcrux_ml_kem_vector_portable_vector_type_PortableVector)); d8218 1 a8218 8 This function found in impl {core::ops::function::FnMut<(usize), libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]> for libcrux_ml_kem::ind_cpa::decrypt::closure[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.decrypt.call_mut_0b a8221 4 - CIPHERTEXT_SIZE= 1088 - VECTOR_U_ENCODED_SIZE= 960 - U_COMPRESSION_FACTOR= 10 - V_COMPRESSION_FACTOR= 4 d8223 3 a8225 3 static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_ind_cpa_decrypt_call_mut_0b_42(void **_, size_t tupled_args) { return libcrux_ml_kem_polynomial_ZERO_d6_ea(); d8234 2 a8235 2 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_serialize_deserialize_to_uncompressed_ring_element_ea( d8237 2 a8238 2 libcrux_ml_kem_polynomial_PolynomialRingElement_1d re = libcrux_ml_kem_polynomial_ZERO_d6_ea(); d8242 2 a8243 3 Eurydice_slice bytes = Eurydice_slice_subslice3(serialized, i0 * (size_t)24U, i0 * (size_t)24U + (size_t)24U, uint8_t *); d8245 1 a8245 1 libcrux_ml_kem_vector_portable_deserialize_12_b8(bytes); d8255 1 a8255 1 A monomorphic instance of libcrux_ml_kem.ind_cpa.deserialize_vector d8260 1 a8260 1 static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_deserialize_vector_1b( d8262 2 a8263 1 libcrux_ml_kem_polynomial_PolynomialRingElement_1d *secret_as_ntt) { d8265 6 d8272 8 a8279 8 libcrux_ml_kem_polynomial_PolynomialRingElement_1d uu____0 = libcrux_ml_kem_serialize_deserialize_to_uncompressed_ring_element_ea( Eurydice_slice_subslice3( secret_key, i0 * LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT, (i0 + (size_t)1U) * LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT, uint8_t *)); d8282 3 d8288 4 a8291 5 This function found in impl {core::ops::function::FnMut<(usize), libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]> for libcrux_ml_kem::ind_cpa::deserialize_then_decompress_u::closure[TraitClause@@0, TraitClause@@1]} d8293 4 d8299 1 a8299 1 libcrux_ml_kem.ind_cpa.deserialize_then_decompress_u.call_mut_35 with types d8305 3 a8307 4 static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_ind_cpa_deserialize_then_decompress_u_call_mut_35_6c( void **_, size_t tupled_args) { return libcrux_ml_kem_polynomial_ZERO_d6_ea(); d8317 2 a8318 2 libcrux_ml_kem_vector_portable_compress_decompress_ciphertext_coefficient_ef( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { d8322 2 a8323 5 int32_t decompressed = libcrux_secrets_int_as_i32_f5(a.elements[i0]) * libcrux_secrets_int_as_i32_f5( libcrux_secrets_int_public_integers_classify_27_39( LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS)); d8326 1 a8326 1 a.elements[i0] = libcrux_secrets_int_as_i16_36(decompressed); d8328 1 a8328 1 return a; d8332 2 a8333 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d8337 1 a8337 1 libcrux_ml_kem.vector.portable.decompress_ciphertext_coefficient_b8 with const d8342 4 a8345 4 libcrux_ml_kem_vector_portable_decompress_ciphertext_coefficient_b8_ef( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { return libcrux_ml_kem_vector_portable_compress_decompress_ciphertext_coefficient_ef( a); d8354 2 a8355 2 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_serialize_deserialize_then_decompress_10_ea( d8357 2 a8358 2 libcrux_ml_kem_polynomial_PolynomialRingElement_1d re = libcrux_ml_kem_polynomial_ZERO_d6_ea(); d8362 2 a8363 3 Eurydice_slice bytes = Eurydice_slice_subslice3(serialized, i0 * (size_t)20U, i0 * (size_t)20U + (size_t)20U, uint8_t *); d8365 1 a8365 1 libcrux_ml_kem_vector_portable_deserialize_10_b8(bytes); d8367 1 a8367 1 libcrux_ml_kem_vector_portable_decompress_ciphertext_coefficient_b8_ef( d8376 3 a8378 3 libcrux_ml_kem.serialize.deserialize_then_decompress_ring_element_u with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - COMPRESSION_FACTOR= 10 d8380 68 a8447 4 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_serialize_deserialize_then_decompress_ring_element_u_0a( Eurydice_slice serialized) { return libcrux_ml_kem_serialize_deserialize_then_decompress_10_ea(serialized); d8456 13 d8476 1 a8476 1 libcrux_ml_kem_ntt_ntt_layer_int_vec_step_ea( d8481 6 a8486 7 libcrux_ml_kem_vector_portable_montgomery_multiply_by_constant_b8(b, zeta_r); b = libcrux_ml_kem_vector_portable_sub_b8(a, &t); a = libcrux_ml_kem_vector_portable_add_b8(a, &t); return (KRML_CLITERAL( libcrux_ml_kem_vector_portable_vector_type_PortableVector_x2){.fst = a, .snd = b}); d8495 2 a8496 2 static KRML_MUSTINLINE void libcrux_ml_kem_ntt_ntt_at_layer_4_plus_ea( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re, d8508 1 a8508 1 libcrux_ml_kem_ntt_ntt_layer_int_vec_step_ea( d8510 1 a8510 1 libcrux_ml_kem_polynomial_zeta(zeta_i[0U])); d8525 3 a8527 3 static KRML_MUSTINLINE void libcrux_ml_kem_ntt_ntt_at_layer_3_ea( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re, size_t _initial_coefficient_bound) { d8532 1 a8532 1 libcrux_ml_kem_vector_portable_ntt_layer_3_step_b8( d8534 1 a8534 1 libcrux_ml_kem_polynomial_zeta(zeta_i[0U])); d8545 3 a8547 3 static KRML_MUSTINLINE void libcrux_ml_kem_ntt_ntt_at_layer_2_ea( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re, size_t _initial_coefficient_bound) { d8552 5 a8556 3 libcrux_ml_kem_vector_portable_ntt_layer_2_step_b8( re->coefficients[round], libcrux_ml_kem_polynomial_zeta(zeta_i[0U]), libcrux_ml_kem_polynomial_zeta(zeta_i[0U] + (size_t)1U)); d8567 3 a8569 3 static KRML_MUSTINLINE void libcrux_ml_kem_ntt_ntt_at_layer_1_ea( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re, size_t _initial_coefficient_bound) { d8574 9 a8582 5 libcrux_ml_kem_vector_portable_ntt_layer_1_step_b8( re->coefficients[round], libcrux_ml_kem_polynomial_zeta(zeta_i[0U]), libcrux_ml_kem_polynomial_zeta(zeta_i[0U] + (size_t)1U), libcrux_ml_kem_polynomial_zeta(zeta_i[0U] + (size_t)2U), libcrux_ml_kem_polynomial_zeta(zeta_i[0U] + (size_t)3U)); d8588 5 a8592 1 A monomorphic instance of libcrux_ml_kem.polynomial.poly_barrett_reduce d8597 2 a8598 2 static KRML_MUSTINLINE void libcrux_ml_kem_polynomial_poly_barrett_reduce_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *myself) { d8603 3 a8605 3 libcrux_ml_kem_vector_portable_barrett_reduce_b8( myself->coefficients[i0]); myself->coefficients[i0] = uu____0; a8609 16 This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.poly_barrett_reduce_d6 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_polynomial_poly_barrett_reduce_d6_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *self) { libcrux_ml_kem_polynomial_poly_barrett_reduce_ea(self); } /** d8615 2 a8616 2 static KRML_MUSTINLINE void libcrux_ml_kem_ntt_ntt_vector_u_0a( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re) { d8618 3 a8620 1 libcrux_ml_kem_ntt_ntt_at_layer_4_plus_ea(&zeta_i, re, (size_t)7U, d8622 8 a8629 10 libcrux_ml_kem_ntt_ntt_at_layer_4_plus_ea(&zeta_i, re, (size_t)6U, (size_t)2U * (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_4_plus_ea(&zeta_i, re, (size_t)5U, (size_t)3U * (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_4_plus_ea(&zeta_i, re, (size_t)4U, (size_t)4U * (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_3_ea(&zeta_i, re, (size_t)5U * (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_2_ea(&zeta_i, re, (size_t)6U * (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_1_ea(&zeta_i, re, (size_t)7U * (size_t)3328U); libcrux_ml_kem_polynomial_poly_barrett_reduce_d6_ea(re); d8645 1 a8645 1 libcrux_ml_kem_ind_cpa_deserialize_then_decompress_u_6c( d8647 2 a8648 2 libcrux_ml_kem_polynomial_PolynomialRingElement_1d ret[3U]) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d u_as_ntt[3U]; d8650 1 a8650 5 /* original Rust expression is not an lvalue in C */ void *lvalue = (void *)0U; u_as_ntt[i] = libcrux_ml_kem_ind_cpa_deserialize_then_decompress_u_call_mut_35_6c( &lvalue, i); d8660 1 a8660 1 Eurydice_slice u_bytes = Eurydice_array_to_subslice3( d8668 1 a8668 1 uint8_t *); d8670 1 a8670 1 libcrux_ml_kem_serialize_deserialize_then_decompress_ring_element_u_0a( d8672 1 a8672 1 libcrux_ml_kem_ntt_ntt_vector_u_0a(&u_as_ntt[i0]); d8676 1 a8676 1 (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); d8686 2 a8687 2 libcrux_ml_kem_vector_portable_compress_decompress_ciphertext_coefficient_d1( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { d8691 2 a8692 5 int32_t decompressed = libcrux_secrets_int_as_i32_f5(a.elements[i0]) * libcrux_secrets_int_as_i32_f5( libcrux_secrets_int_public_integers_classify_27_39( LIBCRUX_ML_KEM_VECTOR_TRAITS_FIELD_MODULUS)); d8695 1 a8695 1 a.elements[i0] = libcrux_secrets_int_as_i16_36(decompressed); d8697 1 a8697 1 return a; d8701 2 a8702 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d8706 1 a8706 1 libcrux_ml_kem.vector.portable.decompress_ciphertext_coefficient_b8 with const d8711 4 a8714 4 libcrux_ml_kem_vector_portable_decompress_ciphertext_coefficient_b8_d1( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { return libcrux_ml_kem_vector_portable_compress_decompress_ciphertext_coefficient_d1( a); d8723 2 a8724 2 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_serialize_deserialize_then_decompress_4_ea( d8726 2 a8727 2 libcrux_ml_kem_polynomial_PolynomialRingElement_1d re = libcrux_ml_kem_polynomial_ZERO_d6_ea(); d8731 2 a8732 2 Eurydice_slice bytes = Eurydice_slice_subslice3( serialized, i0 * (size_t)8U, i0 * (size_t)8U + (size_t)8U, uint8_t *); d8734 1 a8734 1 libcrux_ml_kem_vector_portable_deserialize_4_b8(bytes); d8736 1 a8736 1 libcrux_ml_kem_vector_portable_decompress_ciphertext_coefficient_b8_d1( d8745 28 a8772 4 libcrux_ml_kem.serialize.deserialize_then_decompress_ring_element_v with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - COMPRESSION_FACTOR= 4 d8774 5 a8778 4 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_serialize_deserialize_then_decompress_ring_element_v_89( Eurydice_slice serialized) { return libcrux_ml_kem_serialize_deserialize_then_decompress_4_ea(serialized); d8782 1 a8782 1 A monomorphic instance of libcrux_ml_kem.polynomial.ZERO d8787 16 a8802 7 static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_polynomial_ZERO_ea(void) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d lit; libcrux_ml_kem_vector_portable_vector_type_PortableVector repeat_expression[16U]; for (size_t i = (size_t)0U; i < (size_t)16U; i++) { repeat_expression[i] = libcrux_ml_kem_vector_portable_ZERO_b8(); d8804 13 a8816 4 memcpy(lit.coefficients, repeat_expression, (size_t)16U * sizeof(libcrux_ml_kem_vector_portable_vector_type_PortableVector)); return lit; d8847 5 a8851 1 A monomorphic instance of libcrux_ml_kem.polynomial.ntt_multiply d8856 6 a8861 6 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_polynomial_ntt_multiply_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *myself, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *rhs) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d out = libcrux_ml_kem_polynomial_ZERO_ea(); d8866 13 a8878 9 libcrux_ml_kem_vector_portable_ntt_multiply_b8( &myself->coefficients[i0], &rhs->coefficients[i0], libcrux_ml_kem_polynomial_zeta((size_t)64U + (size_t)4U * i0), libcrux_ml_kem_polynomial_zeta((size_t)64U + (size_t)4U * i0 + (size_t)1U), libcrux_ml_kem_polynomial_zeta((size_t)64U + (size_t)4U * i0 + (size_t)2U), libcrux_ml_kem_polynomial_zeta((size_t)64U + (size_t)4U * i0 + (size_t)3U)); d8885 2 a8886 3 This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]} d8889 2 a8890 15 A monomorphic instance of libcrux_ml_kem.polynomial.ntt_multiply_d6 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_polynomial_ntt_multiply_d6_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *self, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *rhs) { return libcrux_ml_kem_polynomial_ntt_multiply_ea(self, rhs); } /** Given two polynomial ring elements `lhs` and `rhs`, compute the pointwise sum of their constituent coefficients. d8893 1 a8893 1 A monomorphic instance of libcrux_ml_kem.polynomial.add_to_ring_element d8898 3 a8900 3 static KRML_MUSTINLINE void libcrux_ml_kem_polynomial_add_to_ring_element_1b( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *myself, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *rhs) { d8904 1 a8904 1 (size_t)16U, myself->coefficients, d8910 1 a8910 1 libcrux_ml_kem_vector_portable_add_b8(myself->coefficients[i0], d8912 1 a8912 1 myself->coefficients[i0] = uu____0; a8916 17 This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.add_to_ring_element_d6 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_polynomial_add_to_ring_element_d6_1b( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *self, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *rhs) { libcrux_ml_kem_polynomial_add_to_ring_element_1b(self, rhs); } /** d8922 3 a8924 2 static KRML_MUSTINLINE void libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_1_ea( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re) { d8929 9 a8937 5 libcrux_ml_kem_vector_portable_inv_ntt_layer_1_step_b8( re->coefficients[round], libcrux_ml_kem_polynomial_zeta(zeta_i[0U]), libcrux_ml_kem_polynomial_zeta(zeta_i[0U] - (size_t)1U), libcrux_ml_kem_polynomial_zeta(zeta_i[0U] - (size_t)2U), libcrux_ml_kem_polynomial_zeta(zeta_i[0U] - (size_t)3U)); d8948 3 a8950 2 static KRML_MUSTINLINE void libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_2_ea( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re) { d8955 5 a8959 3 libcrux_ml_kem_vector_portable_inv_ntt_layer_2_step_b8( re->coefficients[round], libcrux_ml_kem_polynomial_zeta(zeta_i[0U]), libcrux_ml_kem_polynomial_zeta(zeta_i[0U] - (size_t)1U)); d8970 3 a8972 2 static KRML_MUSTINLINE void libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_3_ea( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re) { d8977 1 a8977 1 libcrux_ml_kem_vector_portable_inv_ntt_layer_3_step_b8( d8979 1 a8979 1 libcrux_ml_kem_polynomial_zeta(zeta_i[0U])); d8992 1 a8992 1 libcrux_ml_kem_invert_ntt_inv_ntt_layer_int_vec_step_reduce_ea( d8997 7 a9003 8 libcrux_ml_kem_vector_portable_sub_b8(b, &a); a = libcrux_ml_kem_vector_portable_barrett_reduce_b8( libcrux_ml_kem_vector_portable_add_b8(a, &b)); b = libcrux_ml_kem_vector_portable_montgomery_multiply_by_constant_b8( a_minus_b, zeta_r); return (KRML_CLITERAL( libcrux_ml_kem_vector_portable_vector_type_PortableVector_x2){.fst = a, .snd = b}); d9013 2 a9014 2 libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_4_plus_ea( size_t *zeta_i, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re, d9028 1 a9028 1 libcrux_ml_kem_invert_ntt_inv_ntt_layer_int_vec_step_reduce_ea( d9030 1 a9030 1 libcrux_ml_kem_polynomial_zeta(zeta_i[0U])); d9045 2 a9046 2 static KRML_MUSTINLINE void libcrux_ml_kem_invert_ntt_invert_ntt_montgomery_1b( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re) { d9049 4 a9052 4 libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_1_ea(&zeta_i, re); libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_2_ea(&zeta_i, re); libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_3_ea(&zeta_i, re); libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_4_plus_ea(&zeta_i, re, d9054 1 a9054 1 libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_4_plus_ea(&zeta_i, re, d9056 1 a9056 1 libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_4_plus_ea(&zeta_i, re, d9058 1 a9058 1 libcrux_ml_kem_invert_ntt_invert_ntt_at_layer_4_plus_ea(&zeta_i, re, d9060 1 a9060 1 libcrux_ml_kem_polynomial_poly_barrett_reduce_d6_ea(re); d9064 5 a9068 1 A monomorphic instance of libcrux_ml_kem.polynomial.subtract_reduce d9073 4 a9076 4 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_polynomial_subtract_reduce_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *myself, libcrux_ml_kem_polynomial_PolynomialRingElement_1d b) { d9082 1 a9082 1 libcrux_ml_kem_vector_portable_montgomery_multiply_by_constant_b8( d9084 5 a9088 6 libcrux_ml_kem_vector_portable_vector_type_PortableVector diff = libcrux_ml_kem_vector_portable_sub_b8(myself->coefficients[i0], &coefficient_normal_form); libcrux_ml_kem_vector_portable_vector_type_PortableVector red = libcrux_ml_kem_vector_portable_barrett_reduce_b8(diff); b.coefficients[i0] = red; a9093 18 This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.subtract_reduce_d6 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_polynomial_subtract_reduce_d6_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *self, libcrux_ml_kem_polynomial_PolynomialRingElement_1d b) { return libcrux_ml_kem_polynomial_subtract_reduce_ea(self, b); } /** d9105 7 a9111 7 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_matrix_compute_message_1b( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *v, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *secret_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *u_as_ntt) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d result = libcrux_ml_kem_polynomial_ZERO_d6_ea(); d9114 2 a9115 2 libcrux_ml_kem_polynomial_PolynomialRingElement_1d product = libcrux_ml_kem_polynomial_ntt_multiply_d6_ea(&secret_as_ntt[i0], d9117 19 a9135 1 libcrux_ml_kem_polynomial_add_to_ring_element_d6_1b(&result, &product); d9137 1 a9137 2 libcrux_ml_kem_invert_ntt_invert_ntt_montgomery_1b(&result); return libcrux_ml_kem_polynomial_subtract_reduce_d6_ea(v, result); d9141 5 a9145 2 A monomorphic instance of libcrux_ml_kem.serialize.to_unsigned_field_modulus with types libcrux_ml_kem_vector_portable_vector_type_PortableVector d9147 12 d9161 2 a9162 2 static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_serialize_to_unsigned_field_modulus_ea( d9164 6 a9169 1 return libcrux_ml_kem_vector_portable_to_unsigned_representative_b8(a); d9179 2 a9180 2 libcrux_ml_kem_serialize_compress_then_serialize_message_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d re, uint8_t ret[32U]) { d9185 1 a9185 1 libcrux_ml_kem_serialize_to_unsigned_field_modulus_ea( d9189 1 a9189 1 libcrux_ml_kem_vector_portable_compress_1_b8(coefficient); d9191 1 a9191 1 libcrux_ml_kem_vector_portable_serialize_1_b8(coefficient_compressed, d9193 2 d9196 1 a9196 3 Eurydice_array_to_subslice3(serialized, (size_t)2U * i0, (size_t)2U * i0 + (size_t)2U, uint8_t *), Eurydice_array_to_slice((size_t)2U, bytes, uint8_t), uint8_t); d9235 2 a9236 2 static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_decrypt_unpacked_42( libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_a0 *secret_key, d9238 4 a9241 4 libcrux_ml_kem_polynomial_PolynomialRingElement_1d u_as_ntt[3U]; libcrux_ml_kem_ind_cpa_deserialize_then_decompress_u_6c(ciphertext, u_as_ntt); libcrux_ml_kem_polynomial_PolynomialRingElement_1d v = libcrux_ml_kem_serialize_deserialize_then_decompress_ring_element_v_89( d9243 3 a9245 4 (size_t)960U, uint8_t, size_t, uint8_t[])); libcrux_ml_kem_polynomial_PolynomialRingElement_1d message = libcrux_ml_kem_matrix_compute_message_1b(&v, secret_key->secret_as_ntt, d9248 1 a9248 1 libcrux_ml_kem_serialize_compress_then_serialize_message_ea(message, ret0); d9262 11 a9272 3 static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_decrypt_42( Eurydice_slice secret_key, uint8_t *ciphertext, uint8_t ret[32U]) { libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_a0 a9273 6 libcrux_ml_kem_polynomial_PolynomialRingElement_1d ret0[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { /* original Rust expression is not an lvalue in C */ void *lvalue = (void *)0U; ret0[i] = libcrux_ml_kem_ind_cpa_decrypt_call_mut_0b_42(&lvalue, i); } d9275 6 a9280 8 secret_key_unpacked.secret_as_ntt, ret0, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); libcrux_ml_kem_ind_cpa_deserialize_vector_1b( secret_key, secret_key_unpacked.secret_as_ntt); uint8_t ret1[32U]; libcrux_ml_kem_ind_cpa_decrypt_unpacked_42(&secret_key_unpacked, ciphertext, ret1); memcpy(ret, ret1, (size_t)32U * sizeof(uint8_t)); d9284 2 a9285 2 This function found in impl {libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash} d9288 1 a9288 1 A monomorphic instance of libcrux_ml_kem.hash_functions.portable.G_4a d9292 1 a9292 1 static inline void libcrux_ml_kem_hash_functions_portable_G_4a_e0( d9302 1 a9302 1 static inline void libcrux_ml_kem_hash_functions_portable_PRF_9e( d9311 2 a9312 2 This function found in impl {libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash} d9315 1 a9315 1 A monomorphic instance of libcrux_ml_kem.hash_functions.portable.PRF_4a d9320 1 a9320 1 static inline void libcrux_ml_kem_hash_functions_portable_PRF_4a_41( d9322 1 a9322 1 libcrux_ml_kem_hash_functions_portable_PRF_9e(input, ret); d9327 1 a9327 1 libcrux_ml_kem.ind_cpa.unpacked.IndCpaPublicKeyUnpacked with types d9329 1 a9329 17 - $3size_t */ typedef struct libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0_s { libcrux_ml_kem_polynomial_PolynomialRingElement_1d t_as_ntt[3U]; uint8_t seed_for_A[32U]; libcrux_ml_kem_polynomial_PolynomialRingElement_1d A[3U][3U]; } libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0; /** This function found in impl {core::default::Default for libcrux_ml_kem::ind_cpa::unpacked::IndCpaPublicKeyUnpacked[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.unpacked.default_8b with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics d9332 4 a9335 26 static inline libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 libcrux_ml_kem_ind_cpa_unpacked_default_8b_1b(void) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d uu____0[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { uu____0[i] = libcrux_ml_kem_polynomial_ZERO_d6_ea(); } uint8_t uu____1[32U] = {0U}; libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 lit; memcpy( lit.t_as_ntt, uu____0, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); memcpy(lit.seed_for_A, uu____1, (size_t)32U * sizeof(uint8_t)); libcrux_ml_kem_polynomial_PolynomialRingElement_1d repeat_expression0[3U][3U]; for (size_t i0 = (size_t)0U; i0 < (size_t)3U; i0++) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d repeat_expression[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { repeat_expression[i] = libcrux_ml_kem_polynomial_ZERO_d6_ea(); } memcpy(repeat_expression0[i0], repeat_expression, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); } memcpy(lit.A, repeat_expression0, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U])); return lit; d9350 2 a9351 2 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_serialize_deserialize_to_reduced_ring_element_ea( d9353 2 a9354 2 libcrux_ml_kem_polynomial_PolynomialRingElement_1d re = libcrux_ml_kem_polynomial_ZERO_d6_ea(); d9358 2 a9359 3 Eurydice_slice bytes = Eurydice_slice_subslice3(serialized, i0 * (size_t)24U, i0 * (size_t)24U + (size_t)24U, uint8_t *); d9361 1 a9361 1 libcrux_ml_kem_vector_portable_deserialize_12_b8(bytes); d9363 1 a9363 1 libcrux_ml_kem_vector_portable_cond_subtract_3329_b8(coefficient); d9370 4 a9373 1 See [deserialize_ring_elements_reduced_out]. d9379 1 d9383 1 a9383 1 libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_1b( d9385 5 a9389 1 libcrux_ml_kem_polynomial_PolynomialRingElement_1d *deserialized_pk) { d9395 1 a9395 1 Eurydice_slice ring_element = Eurydice_slice_subslice3( d9399 3 a9401 3 uint8_t *); libcrux_ml_kem_polynomial_PolynomialRingElement_1d uu____0 = libcrux_ml_kem_serialize_deserialize_to_reduced_ring_element_ea( d9405 29 d9441 3 a9443 3 typedef struct libcrux_ml_kem_hash_functions_portable_PortableHash_88_s { libcrux_sha3_generic_keccak_KeccakState_17 shake128_state[3U]; } libcrux_ml_kem_hash_functions_portable_PortableHash_88; d9447 1 a9447 2 libcrux_ml_kem.hash_functions.portable.shake128_init_absorb_final with const generics d9450 4 a9453 5 static inline libcrux_ml_kem_hash_functions_portable_PortableHash_88 libcrux_ml_kem_hash_functions_portable_shake128_init_absorb_final_e0( uint8_t (*input)[34U]) { libcrux_ml_kem_hash_functions_portable_PortableHash_88 shake128_state; libcrux_sha3_generic_keccak_KeccakState_17 repeat_expression[3U]; d9455 1 a9455 1 repeat_expression[i] = libcrux_sha3_portable_incremental_shake128_init(); a9456 2 memcpy(shake128_state.shake128_state, repeat_expression, (size_t)3U * sizeof(libcrux_sha3_generic_keccak_KeccakState_17)); d9460 1 a9460 1 &shake128_state.shake128_state[i0], d9463 8 a9470 1 return shake128_state; d9474 2 a9475 2 This function found in impl {libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash} d9479 1 a9479 1 libcrux_ml_kem.hash_functions.portable.shake128_init_absorb_final_4a with const d9483 8 a9490 5 static inline libcrux_ml_kem_hash_functions_portable_PortableHash_88 libcrux_ml_kem_hash_functions_portable_shake128_init_absorb_final_4a_e0( uint8_t (*input)[34U]) { return libcrux_ml_kem_hash_functions_portable_shake128_init_absorb_final_e0( input); d9495 2 a9496 2 libcrux_ml_kem.hash_functions.portable.shake128_squeeze_first_three_blocks with const generics d9499 3 a9501 3 static inline void libcrux_ml_kem_hash_functions_portable_shake128_squeeze_first_three_blocks_e0( libcrux_ml_kem_hash_functions_portable_PortableHash_88 *st, d9514 2 a9515 2 This function found in impl {libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash} d9519 2 a9520 2 libcrux_ml_kem.hash_functions.portable.shake128_squeeze_first_three_blocks_4a with const generics d9523 3 a9525 3 static inline void libcrux_ml_kem_hash_functions_portable_shake128_squeeze_first_three_blocks_4a_e0( libcrux_ml_kem_hash_functions_portable_PortableHash_88 *self, d9527 2 a9528 2 libcrux_ml_kem_hash_functions_portable_shake128_squeeze_first_three_blocks_e0( self, ret); d9580 2 a9581 2 libcrux_ml_kem_sampling_sample_from_uniform_distribution_next_89( uint8_t (*randomness)[504U], size_t *sampled_coefficients, d9589 9 a9597 9 size_t sampled = libcrux_ml_kem_vector_portable_rej_sample_b8( Eurydice_array_to_subslice3(randomness[i1], r * (size_t)24U, r * (size_t)24U + (size_t)24U, uint8_t *), Eurydice_array_to_subslice3(out[i1], sampled_coefficients[i1], sampled_coefficients[i1] + (size_t)16U, int16_t *)); size_t uu____0 = i1; sampled_coefficients[uu____0] = sampled_coefficients[uu____0] + sampled; d9617 1 a9617 1 libcrux_ml_kem.hash_functions.portable.shake128_squeeze_next_block with const d9621 3 a9623 3 static inline void libcrux_ml_kem_hash_functions_portable_shake128_squeeze_next_block_e0( libcrux_ml_kem_hash_functions_portable_PortableHash_88 *st, d9636 2 a9637 2 This function found in impl {libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash} d9641 1 a9641 1 libcrux_ml_kem.hash_functions.portable.shake128_squeeze_next_block_4a with const d9645 3 a9647 3 static inline void libcrux_ml_kem_hash_functions_portable_shake128_squeeze_next_block_4a_e0( libcrux_ml_kem_hash_functions_portable_PortableHash_88 *self, d9649 1 a9649 2 libcrux_ml_kem_hash_functions_portable_shake128_squeeze_next_block_e0(self, ret); d9701 2 a9702 2 libcrux_ml_kem_sampling_sample_from_uniform_distribution_next_890( uint8_t (*randomness)[168U], size_t *sampled_coefficients, d9710 9 a9718 9 size_t sampled = libcrux_ml_kem_vector_portable_rej_sample_b8( Eurydice_array_to_subslice3(randomness[i1], r * (size_t)24U, r * (size_t)24U + (size_t)24U, uint8_t *), Eurydice_array_to_subslice3(out[i1], sampled_coefficients[i1], sampled_coefficients[i1] + (size_t)16U, int16_t *)); size_t uu____0 = i1; sampled_coefficients[uu____0] = sampled_coefficients[uu____0] + sampled; d9737 5 a9741 1 A monomorphic instance of libcrux_ml_kem.polynomial.from_i16_array d9746 4 a9749 4 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_polynomial_from_i16_array_ea(Eurydice_slice a) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d result = libcrux_ml_kem_polynomial_ZERO_ea(); d9754 3 a9756 4 libcrux_ml_kem_vector_portable_from_i16_array_b8( Eurydice_slice_subslice3(a, i0 * (size_t)16U, (i0 + (size_t)1U) * (size_t)16U, int16_t *)); d9763 5 a9767 3 This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]} d9769 6 a9774 33 /** A monomorphic instance of libcrux_ml_kem.polynomial.from_i16_array_d6 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_polynomial_from_i16_array_d6_ea(Eurydice_slice a) { return libcrux_ml_kem_polynomial_from_i16_array_ea(a); } /** This function found in impl {core::ops::function::FnMut<(@@Array), libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@2]> for libcrux_ml_kem::sampling::sample_from_xof::closure[TraitClause@@0, TraitClause@@1, TraitClause@@2, TraitClause@@3]} */ /** A monomorphic instance of libcrux_ml_kem.sampling.sample_from_xof.call_mut_e7 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 */ static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_sampling_sample_from_xof_call_mut_e7_2b( void **_, int16_t tupled_args[272U]) { int16_t s[272U]; memcpy(s, tupled_args, (size_t)272U * sizeof(int16_t)); return libcrux_ml_kem_polynomial_from_i16_array_d6_ea( Eurydice_array_to_subslice3(s, (size_t)0U, (size_t)256U, int16_t *)); } d9782 3 a9784 3 static KRML_MUSTINLINE void libcrux_ml_kem_sampling_sample_from_xof_2b( uint8_t (*seeds)[34U], libcrux_ml_kem_polynomial_PolynomialRingElement_1d ret[3U]) { d9787 6 a9792 3 libcrux_ml_kem_hash_functions_portable_PortableHash_88 xof_state = libcrux_ml_kem_hash_functions_portable_shake128_init_absorb_final_4a_e0( seeds); d9794 1 a9794 1 libcrux_ml_kem_hash_functions_portable_shake128_squeeze_first_three_blocks_4a_e0( d9796 5 a9800 2 bool done = libcrux_ml_kem_sampling_sample_from_uniform_distribution_next_89( randomness0, sampled_coefficients, out); d9806 1 a9806 1 libcrux_ml_kem_hash_functions_portable_shake128_squeeze_next_block_4a_e0( d9808 6 a9813 2 done = libcrux_ml_kem_sampling_sample_from_uniform_distribution_next_890( randomness, sampled_coefficients, out); d9819 1 a9819 1 libcrux_ml_kem_polynomial_PolynomialRingElement_1d ret0[3U]; d9821 2 a9822 4 /* original Rust expression is not an lvalue in C */ void *lvalue = (void *)0U; ret0[i] = libcrux_ml_kem_sampling_sample_from_xof_call_mut_e7_2b( &lvalue, copy_of_out[i]); d9826 1 a9826 1 (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); d9836 7 a9842 3 static KRML_MUSTINLINE void libcrux_ml_kem_matrix_sample_matrix_A_2b( libcrux_ml_kem_polynomial_PolynomialRingElement_1d (*A_transpose)[3U], uint8_t *seed, bool transpose) { d9845 3 d9850 1 a9850 2 core_array__core__clone__Clone_for__Array_T__N___clone( (size_t)34U, seed, seeds[i], uint8_t, void *); d9857 5 a9861 2 libcrux_ml_kem_polynomial_PolynomialRingElement_1d sampled[3U]; libcrux_ml_kem_sampling_sample_from_xof_2b(seeds, sampled); d9866 2 a9867 2 libcrux_ml_kem_polynomial_PolynomialRingElement_1d), libcrux_ml_kem_polynomial_PolynomialRingElement_1d); d9870 1 a9870 1 libcrux_ml_kem_polynomial_PolynomialRingElement_1d sample = sampled[j]; d9878 3 a9880 45 } /** A monomorphic instance of libcrux_ml_kem.ind_cpa.build_unpacked_public_key_mut with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - T_AS_NTT_ENCODED_SIZE= 1152 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_build_unpacked_public_key_mut_3f( Eurydice_slice public_key, libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 *unpacked_public_key) { Eurydice_slice uu____0 = Eurydice_slice_subslice_to( public_key, (size_t)1152U, uint8_t, size_t, uint8_t[]); libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_1b( uu____0, unpacked_public_key->t_as_ntt); Eurydice_slice seed = Eurydice_slice_subslice_from( public_key, (size_t)1152U, uint8_t, size_t, uint8_t[]); libcrux_ml_kem_polynomial_PolynomialRingElement_1d(*uu____1)[3U] = unpacked_public_key->A; uint8_t ret[34U]; libcrux_ml_kem_utils_into_padded_array_b6(seed, ret); libcrux_ml_kem_matrix_sample_matrix_A_2b(uu____1, ret, false); } /** A monomorphic instance of libcrux_ml_kem.ind_cpa.build_unpacked_public_key with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - T_AS_NTT_ENCODED_SIZE= 1152 */ static KRML_MUSTINLINE libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 libcrux_ml_kem_ind_cpa_build_unpacked_public_key_3f( Eurydice_slice public_key) { libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 unpacked_public_key = libcrux_ml_kem_ind_cpa_unpacked_default_8b_1b(); libcrux_ml_kem_ind_cpa_build_unpacked_public_key_mut_3f(public_key, &unpacked_public_key); return unpacked_public_key; d9886 1 a9886 3 libcrux_ml_kem_vector_portable_vector_type_PortableVector[3size_t], libcrux_ml_kem_polynomial_PolynomialRingElement libcrux_ml_kem_vector_portable_vector_type_PortableVector d9889 4 a9892 4 typedef struct tuple_ed_s { libcrux_ml_kem_polynomial_PolynomialRingElement_1d fst[3U]; libcrux_ml_kem_polynomial_PolynomialRingElement_1d snd; } tuple_ed; d9895 3 a9897 10 This function found in impl {core::ops::function::FnMut<(usize), libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@2]> for libcrux_ml_kem::ind_cpa::encrypt_c1::closure[TraitClause@@0, TraitClause@@1, TraitClause@@2, TraitClause@@3]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.encrypt_c1.call_mut_f1 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, d9901 2 a9902 7 - C1_LEN= 960 - U_COMPRESSION_FACTOR= 10 - BLOCK_LEN= 320 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 - ETA2= 2 - ETA2_RANDOMNESS_SIZE= 128 d9904 3 a9906 3 static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_ind_cpa_encrypt_c1_call_mut_f1_85(void **_, size_t tupled_args) { return libcrux_ml_kem_polynomial_ZERO_d6_ea(); d9915 1 a9915 1 static inline void libcrux_ml_kem_hash_functions_portable_PRFxN_41( d9928 2 a9929 2 This function found in impl {libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash} d9932 1 a9932 1 A monomorphic instance of libcrux_ml_kem.hash_functions.portable.PRFxN_4a d9937 1 a9937 1 static inline void libcrux_ml_kem_hash_functions_portable_PRFxN_4a_41( d9939 1 a9939 1 libcrux_ml_kem_hash_functions_portable_PRFxN_41(input, ret); d9997 2 a9998 2 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_sampling_sample_from_binomial_distribution_2_ea( d10004 1 a10004 1 Eurydice_slice byte_chunk = Eurydice_slice_subslice3( d10006 1 a10006 1 chunk_number * (size_t)4U + (size_t)4U, uint8_t *); d10022 1 a10022 1 for (uint32_t i = 0U; i < 32U / 4U; i++) { d10033 46 a10078 1 return libcrux_ml_kem_polynomial_from_i16_array_d6_ea( d10088 2 a10089 2 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_sampling_sample_from_binomial_distribution_a0( d10091 1 a10091 1 return libcrux_ml_kem_sampling_sample_from_binomial_distribution_2_ea( d10101 2 a10102 2 static KRML_MUSTINLINE void libcrux_ml_kem_ntt_ntt_at_layer_7_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re) { d10107 1 a10107 1 libcrux_ml_kem_vector_portable_multiply_by_constant_b8( d10110 1 a10110 1 libcrux_ml_kem_vector_portable_sub_b8(re->coefficients[j], &t); d10112 1 a10112 1 libcrux_ml_kem_vector_portable_add_b8(re->coefficients[j], &t); d10124 3 a10126 3 libcrux_ml_kem_ntt_ntt_binomially_sampled_ring_element_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re) { libcrux_ml_kem_ntt_ntt_at_layer_7_ea(re); d10128 10 a10137 13 libcrux_ml_kem_ntt_ntt_at_layer_4_plus_ea(&zeta_i, re, (size_t)6U, (size_t)11207U); libcrux_ml_kem_ntt_ntt_at_layer_4_plus_ea(&zeta_i, re, (size_t)5U, (size_t)11207U + (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_4_plus_ea( &zeta_i, re, (size_t)4U, (size_t)11207U + (size_t)2U * (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_3_ea( &zeta_i, re, (size_t)11207U + (size_t)3U * (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_2_ea( &zeta_i, re, (size_t)11207U + (size_t)4U * (size_t)3328U); libcrux_ml_kem_ntt_ntt_at_layer_1_ea( &zeta_i, re, (size_t)11207U + (size_t)5U * (size_t)3328U); libcrux_ml_kem_polynomial_poly_barrett_reduce_d6_ea(re); d10153 10 a10162 4 static KRML_MUSTINLINE uint8_t libcrux_ml_kem_ind_cpa_sample_vector_cbd_then_ntt_3b( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re_as_ntt, uint8_t *prf_input, uint8_t domain_separator) { d10165 6 a10170 2 core_array__core__clone__Clone_for__Array_T__N___clone( (size_t)33U, prf_input, prf_inputs[i], uint8_t, void *); a10171 2 domain_separator = libcrux_ml_kem_utils_prf_input_inc_e0(prf_inputs, domain_separator); d10173 1 a10173 1 libcrux_ml_kem_hash_functions_portable_PRFxN_4a_41(prf_inputs, prf_outputs); d10177 1 a10177 1 libcrux_ml_kem_sampling_sample_from_binomial_distribution_a0( d10179 1 a10179 1 libcrux_ml_kem_ntt_ntt_binomially_sampled_ring_element_ea(&re_as_ntt[i0]); d10181 11 a10191 1 return domain_separator; d10195 1 a10195 9 This function found in impl {core::ops::function::FnMut<(usize), libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@2]> for libcrux_ml_kem::ind_cpa::encrypt_c1::closure#1[TraitClause@@0, TraitClause@@1, TraitClause@@2, TraitClause@@3]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.encrypt_c1.call_mut_dd d10200 1 a10200 5 - C1_LEN= 960 - U_COMPRESSION_FACTOR= 10 - BLOCK_LEN= 320 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 a10201 1 - ETA2_RANDOMNESS_SIZE= 128 d10203 3 a10205 3 static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_ind_cpa_encrypt_c1_call_mut_dd_85(void **_, size_t tupled_args) { return libcrux_ml_kem_polynomial_ZERO_d6_ea(); d10220 10 a10229 4 static KRML_MUSTINLINE uint8_t libcrux_ml_kem_ind_cpa_sample_ring_element_cbd_3b( uint8_t *prf_input, uint8_t domain_separator, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *error_1) { d10232 6 a10237 2 core_array__core__clone__Clone_for__Array_T__N___clone( (size_t)33U, prf_input, prf_inputs[i], uint8_t, void *); a10238 2 domain_separator = libcrux_ml_kem_utils_prf_input_inc_e0(prf_inputs, domain_separator); d10240 1 a10240 1 libcrux_ml_kem_hash_functions_portable_PRFxN_4a_41(prf_inputs, prf_outputs); d10243 2 a10244 2 libcrux_ml_kem_polynomial_PolynomialRingElement_1d uu____0 = libcrux_ml_kem_sampling_sample_from_binomial_distribution_a0( d10246 1 a10246 1 error_1[i0] = uu____0; d10248 11 a10258 1 return domain_separator; d10266 1 a10266 1 static inline void libcrux_ml_kem_hash_functions_portable_PRF_a6( d10275 2 a10276 2 This function found in impl {libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash} d10279 1 a10279 1 A monomorphic instance of libcrux_ml_kem.hash_functions.portable.PRF_4a d10284 1 a10284 1 static inline void libcrux_ml_kem_hash_functions_portable_PRF_4a_410( d10286 1 a10286 1 libcrux_ml_kem_hash_functions_portable_PRF_a6(input, ret); d10290 1 a10290 7 This function found in impl {core::ops::function::FnMut<(usize), libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]> for libcrux_ml_kem::matrix::compute_vector_u::closure[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.matrix.compute_vector_u.call_mut_a8 d10295 3 a10297 4 static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_matrix_compute_vector_u_call_mut_a8_1b(void **_, size_t tupled_args) { return libcrux_ml_kem_polynomial_ZERO_d6_ea(); d10301 5 a10305 1 A monomorphic instance of libcrux_ml_kem.polynomial.add_error_reduce d10310 3 a10312 3 static KRML_MUSTINLINE void libcrux_ml_kem_polynomial_add_error_reduce_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *myself, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *error) { d10318 7 a10324 8 libcrux_ml_kem_vector_portable_montgomery_multiply_by_constant_b8( myself->coefficients[j], (int16_t)1441); libcrux_ml_kem_vector_portable_vector_type_PortableVector sum = libcrux_ml_kem_vector_portable_add_b8(coefficient_normal_form, &error->coefficients[j]); libcrux_ml_kem_vector_portable_vector_type_PortableVector red = libcrux_ml_kem_vector_portable_barrett_reduce_b8(sum); myself->coefficients[j] = red; a10328 17 This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.add_error_reduce_d6 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_polynomial_add_error_reduce_d6_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *self, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *error) { libcrux_ml_kem_polynomial_add_error_reduce_ea(self, error); } /** d10337 6 a10342 6 static KRML_MUSTINLINE void libcrux_ml_kem_matrix_compute_vector_u_1b( libcrux_ml_kem_polynomial_PolynomialRingElement_1d (*a_as_ntt)[3U], libcrux_ml_kem_polynomial_PolynomialRingElement_1d *r_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *error_1, libcrux_ml_kem_polynomial_PolynomialRingElement_1d ret[3U]) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d result[3U]; d10344 1 a10344 4 /* original Rust expression is not an lvalue in C */ void *lvalue = (void *)0U; result[i] = libcrux_ml_kem_matrix_compute_vector_u_call_mut_a8_1b(&lvalue, i); d10350 2 a10351 2 libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U]), libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U]); d10354 1 a10354 1 libcrux_ml_kem_polynomial_PolynomialRingElement_1d *row = a_as_ntt[i1]; d10359 2 a10360 2 libcrux_ml_kem_polynomial_PolynomialRingElement_1d), libcrux_ml_kem_polynomial_PolynomialRingElement_1d); d10363 4 a10366 4 libcrux_ml_kem_polynomial_PolynomialRingElement_1d *a_element = &row[j]; libcrux_ml_kem_polynomial_PolynomialRingElement_1d product = libcrux_ml_kem_polynomial_ntt_multiply_d6_ea(a_element, &r_as_ntt[j]); libcrux_ml_kem_polynomial_add_to_ring_element_d6_1b(&result[i1], d10369 2 a10370 2 libcrux_ml_kem_invert_ntt_invert_ntt_montgomery_1b(&result[i1]); libcrux_ml_kem_polynomial_add_error_reduce_d6_ea(&result[i1], &error_1[i1]); d10374 106 a10479 1 (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); d10488 2 a10489 2 libcrux_ml_kem_vector_portable_compress_compress_ef( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { d10493 1 a10493 1 int16_t uu____0 = libcrux_secrets_int_as_i16_f5( d10495 2 a10496 3 (uint8_t)(int32_t)10, libcrux_secrets_int_as_u16_f5(a.elements[i0]))); a.elements[i0] = uu____0; d10498 1 a10498 1 return a; d10502 2 a10503 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d10506 1 a10506 1 A monomorphic instance of libcrux_ml_kem.vector.portable.compress_b8 d10511 3 a10513 3 libcrux_ml_kem_vector_portable_compress_b8_ef( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { return libcrux_ml_kem_vector_portable_compress_compress_ef(a); d10523 2 a10524 2 libcrux_ml_kem_serialize_compress_then_serialize_10_ff( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re, uint8_t ret[320U]) { d10530 2 a10531 2 libcrux_ml_kem_vector_portable_compress_b8_ef( libcrux_ml_kem_serialize_to_unsigned_field_modulus_ea( d10534 64 a10597 1 libcrux_ml_kem_vector_portable_serialize_10_b8(coefficient, bytes); d10599 1 a10599 3 Eurydice_array_to_subslice3(serialized, (size_t)20U * i0, (size_t)20U * i0 + (size_t)20U, uint8_t *), Eurydice_array_to_slice((size_t)20U, bytes, uint8_t), uint8_t); d10612 2 a10613 2 libcrux_ml_kem_serialize_compress_then_serialize_ring_element_u_fe( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re, uint8_t ret[320U]) { d10615 1 a10615 1 libcrux_ml_kem_serialize_compress_then_serialize_10_ff(re, uu____0); d10631 2 a10632 2 static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_compress_then_serialize_u_43( libcrux_ml_kem_polynomial_PolynomialRingElement_1d input[3U], d10638 2 a10639 2 libcrux_ml_kem_polynomial_PolynomialRingElement_1d), libcrux_ml_kem_polynomial_PolynomialRingElement_1d); d10642 2 a10643 2 libcrux_ml_kem_polynomial_PolynomialRingElement_1d re = input[i0]; Eurydice_slice uu____0 = Eurydice_slice_subslice3( d10645 1 a10645 1 (i0 + (size_t)1U) * ((size_t)960U / (size_t)3U), uint8_t *); d10647 1 a10647 1 libcrux_ml_kem_serialize_compress_then_serialize_ring_element_u_fe(&re, d10655 3 a10657 12 A monomorphic instance of libcrux_ml_kem.ind_cpa.encrypt_c1 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - C1_LEN= 960 - U_COMPRESSION_FACTOR= 10 - BLOCK_LEN= 320 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 - ETA2= 2 - ETA2_RANDOMNESS_SIZE= 128 d10659 10 a10668 20 static KRML_MUSTINLINE tuple_ed libcrux_ml_kem_ind_cpa_encrypt_c1_85( Eurydice_slice randomness, libcrux_ml_kem_polynomial_PolynomialRingElement_1d (*matrix)[3U], Eurydice_slice ciphertext) { uint8_t prf_input[33U]; libcrux_ml_kem_utils_into_padded_array_c8(randomness, prf_input); libcrux_ml_kem_polynomial_PolynomialRingElement_1d r_as_ntt[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { /* original Rust expression is not an lvalue in C */ void *lvalue = (void *)0U; r_as_ntt[i] = libcrux_ml_kem_ind_cpa_encrypt_c1_call_mut_f1_85(&lvalue, i); } uint8_t domain_separator0 = libcrux_ml_kem_ind_cpa_sample_vector_cbd_then_ntt_3b(r_as_ntt, prf_input, 0U); libcrux_ml_kem_polynomial_PolynomialRingElement_1d error_1[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { /* original Rust expression is not an lvalue in C */ void *lvalue = (void *)0U; error_1[i] = libcrux_ml_kem_ind_cpa_encrypt_c1_call_mut_dd_85(&lvalue, i); d10670 2 a10671 28 uint8_t domain_separator = libcrux_ml_kem_ind_cpa_sample_ring_element_cbd_3b( prf_input, domain_separator0, error_1); prf_input[32U] = domain_separator; uint8_t prf_output[128U]; libcrux_ml_kem_hash_functions_portable_PRF_4a_410( Eurydice_array_to_slice((size_t)33U, prf_input, uint8_t), prf_output); libcrux_ml_kem_polynomial_PolynomialRingElement_1d error_2 = libcrux_ml_kem_sampling_sample_from_binomial_distribution_a0( Eurydice_array_to_slice((size_t)128U, prf_output, uint8_t)); libcrux_ml_kem_polynomial_PolynomialRingElement_1d u[3U]; libcrux_ml_kem_matrix_compute_vector_u_1b(matrix, r_as_ntt, error_1, u); libcrux_ml_kem_polynomial_PolynomialRingElement_1d uu____0[3U]; memcpy( uu____0, u, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); libcrux_ml_kem_ind_cpa_compress_then_serialize_u_43(uu____0, ciphertext); /* Passing arrays by value in Rust generates a copy in C */ libcrux_ml_kem_polynomial_PolynomialRingElement_1d copy_of_r_as_ntt[3U]; memcpy( copy_of_r_as_ntt, r_as_ntt, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); tuple_ed lit; memcpy( lit.fst, copy_of_r_as_ntt, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); lit.snd = error_2; return lit; } d10674 2 a10675 4 A monomorphic instance of libcrux_ml_kem.serialize.deserialize_then_decompress_message with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics a10676 20 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_serialize_deserialize_then_decompress_message_ea( uint8_t *serialized) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d re = libcrux_ml_kem_polynomial_ZERO_d6_ea(); for (size_t i = (size_t)0U; i < (size_t)16U; i++) { size_t i0 = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient_compressed = libcrux_ml_kem_vector_portable_deserialize_1_b8( Eurydice_array_to_subslice3(serialized, (size_t)2U * i0, (size_t)2U * i0 + (size_t)2U, uint8_t *)); libcrux_ml_kem_vector_portable_vector_type_PortableVector uu____0 = libcrux_ml_kem_vector_portable_decompress_1_b8(coefficient_compressed); re.coefficients[i0] = uu____0; } return re; } d10678 1 a10678 2 A monomorphic instance of libcrux_ml_kem.polynomial.add_message_error_reduce with types libcrux_ml_kem_vector_portable_vector_type_PortableVector d10680 1 a10680 1 d10682 4 a10685 22 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_polynomial_add_message_error_reduce_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *myself, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *message, libcrux_ml_kem_polynomial_PolynomialRingElement_1d result) { for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT; i++) { size_t i0 = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient_normal_form = libcrux_ml_kem_vector_portable_montgomery_multiply_by_constant_b8( result.coefficients[i0], (int16_t)1441); libcrux_ml_kem_vector_portable_vector_type_PortableVector sum1 = libcrux_ml_kem_vector_portable_add_b8(myself->coefficients[i0], &message->coefficients[i0]); libcrux_ml_kem_vector_portable_vector_type_PortableVector sum2 = libcrux_ml_kem_vector_portable_add_b8(coefficient_normal_form, &sum1); libcrux_ml_kem_vector_portable_vector_type_PortableVector red = libcrux_ml_kem_vector_portable_barrett_reduce_b8(sum2); result.coefficients[i0] = red; } return result; d10689 1 a10689 6 This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.add_message_error_reduce_d6 d10694 6 a10699 27 static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_polynomial_add_message_error_reduce_d6_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *self, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *message, libcrux_ml_kem_polynomial_PolynomialRingElement_1d result) { return libcrux_ml_kem_polynomial_add_message_error_reduce_ea(self, message, result); } /** Compute InverseNTT(tᵀ ◦ r̂) + e₂ + message */ /** A monomorphic instance of libcrux_ml_kem.matrix.compute_ring_element_v with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_matrix_compute_ring_element_v_1b( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *t_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *r_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *error_2, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *message) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d result = libcrux_ml_kem_polynomial_ZERO_d6_ea(); for (size_t i = (size_t)0U; i < (size_t)3U; i++) { d10701 10 a10710 4 libcrux_ml_kem_polynomial_PolynomialRingElement_1d product = libcrux_ml_kem_polynomial_ntt_multiply_d6_ea(&t_as_ntt[i0], &r_as_ntt[i0]); libcrux_ml_kem_polynomial_add_to_ring_element_d6_1b(&result, &product); a10711 3 libcrux_ml_kem_invert_ntt_invert_ntt_montgomery_1b(&result); return libcrux_ml_kem_polynomial_add_message_error_reduce_d6_ea( error_2, message, result); d10717 1 a10717 1 - COEFFICIENT_BITS= 4 d10720 2 a10721 2 libcrux_ml_kem_vector_portable_compress_compress_d1( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { d10725 1 a10725 1 int16_t uu____0 = libcrux_secrets_int_as_i16_f5( d10727 2 a10728 3 (uint8_t)(int32_t)4, libcrux_secrets_int_as_u16_f5(a.elements[i0]))); a.elements[i0] = uu____0; d10730 1 a10730 1 return a; d10734 2 a10735 2 This function found in impl {libcrux_ml_kem::vector::traits::Operations for libcrux_ml_kem::vector::portable::vector_type::PortableVector} d10738 1 a10738 1 A monomorphic instance of libcrux_ml_kem.vector.portable.compress_b8 d10740 1 a10740 1 - COEFFICIENT_BITS= 4 d10743 3 a10745 3 libcrux_ml_kem_vector_portable_compress_b8_d1( libcrux_ml_kem_vector_portable_vector_type_PortableVector a) { return libcrux_ml_kem_vector_portable_compress_compress_d1(a); d10749 1 a10749 1 A monomorphic instance of libcrux_ml_kem.serialize.compress_then_serialize_4 d10755 2 a10756 2 libcrux_ml_kem_serialize_compress_then_serialize_4_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d re, d10761 3 a10763 3 libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient = libcrux_ml_kem_vector_portable_compress_b8_d1( libcrux_ml_kem_serialize_to_unsigned_field_modulus_ea( d10765 2 a10766 2 uint8_t bytes[8U]; libcrux_ml_kem_vector_portable_serialize_4_b8(coefficient, bytes); d10768 3 a10770 3 Eurydice_slice_subslice3(serialized, (size_t)8U * i0, (size_t)8U * i0 + (size_t)8U, uint8_t *), Eurydice_array_to_slice((size_t)8U, bytes, uint8_t), uint8_t); a10777 1 - K= 3 d10782 3 a10784 3 libcrux_ml_kem_serialize_compress_then_serialize_ring_element_v_6c( libcrux_ml_kem_polynomial_PolynomialRingElement_1d re, Eurydice_slice out) { libcrux_ml_kem_serialize_compress_then_serialize_4_ea(re, out); d10788 1 a10788 64 A monomorphic instance of libcrux_ml_kem.ind_cpa.encrypt_c2 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - V_COMPRESSION_FACTOR= 4 - C2_LEN= 128 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_encrypt_c2_6c( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *t_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *r_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *error_2, uint8_t *message, Eurydice_slice ciphertext) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d message_as_ring_element = libcrux_ml_kem_serialize_deserialize_then_decompress_message_ea(message); libcrux_ml_kem_polynomial_PolynomialRingElement_1d v = libcrux_ml_kem_matrix_compute_ring_element_v_1b( t_as_ntt, r_as_ntt, error_2, &message_as_ring_element); libcrux_ml_kem_serialize_compress_then_serialize_ring_element_v_6c( v, ciphertext); } /** This function implements Algorithm 13 of the NIST FIPS 203 specification; this is the Kyber CPA-PKE encryption algorithm. Algorithm 13 is reproduced below: ```plaintext Input: encryption key ekₚₖₑ ∈ 𝔹^{384k+32}. Input: message m ∈ 𝔹^{32}. Input: encryption randomness r ∈ 𝔹^{32}. Output: ciphertext c ∈ 𝔹^{32(dᵤk + dᵥ)}. N ← 0 t̂ ← ByteDecode₁₂(ekₚₖₑ[0:384k]) ρ ← ekₚₖₑ[384k: 384k + 32] for (i ← 0; i < k; i++) for(j ← 0; j < k; j++) Â[i,j] ← SampleNTT(XOF(ρ, i, j)) end for end for for(i ← 0; i < k; i++) r[i] ← SamplePolyCBD_{η₁}(PRF_{η₁}(r,N)) N ← N + 1 end for for(i ← 0; i < k; i++) e₁[i] ← SamplePolyCBD_{η₂}(PRF_{η₂}(r,N)) N ← N + 1 end for e₂ ← SamplePolyCBD_{η₂}(PRF_{η₂}(r,N)) r̂ ← NTT(r) u ← NTT-¹(Âᵀ ◦ r̂) + e₁ μ ← Decompress₁(ByteDecode₁(m))) v ← NTT-¹(t̂ᵀ ◦ rˆ) + e₂ + μ c₁ ← ByteEncode_{dᵤ}(Compress_{dᵤ}(u)) c₂ ← ByteEncode_{dᵥ}(Compress_{dᵥ}(v)) return c ← (c₁ ‖ c₂) ``` The NIST FIPS 203 standard can be found at . */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.encrypt_unpacked d10805 54 a10858 3 static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_encrypt_unpacked_2a( libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 *public_key, uint8_t *message, Eurydice_slice randomness, uint8_t ret[1088U]) { d10860 1 a10860 5 tuple_ed uu____0 = libcrux_ml_kem_ind_cpa_encrypt_c1_85( randomness, public_key->A, Eurydice_array_to_subslice3(ciphertext, (size_t)0U, (size_t)960U, uint8_t *)); libcrux_ml_kem_polynomial_PolynomialRingElement_1d r_as_ntt[3U]; d10862 9 a10870 12 r_as_ntt, uu____0.fst, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); libcrux_ml_kem_polynomial_PolynomialRingElement_1d error_2 = uu____0.snd; libcrux_ml_kem_polynomial_PolynomialRingElement_1d *uu____1 = public_key->t_as_ntt; libcrux_ml_kem_polynomial_PolynomialRingElement_1d *uu____2 = r_as_ntt; libcrux_ml_kem_polynomial_PolynomialRingElement_1d *uu____3 = &error_2; uint8_t *uu____4 = message; libcrux_ml_kem_ind_cpa_encrypt_c2_6c( uu____1, uu____2, uu____3, uu____4, Eurydice_array_to_subslice_from((size_t)1088U, ciphertext, (size_t)960U, uint8_t, size_t, uint8_t[])); d10875 2 a10876 32 A monomorphic instance of libcrux_ml_kem.ind_cpa.encrypt with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - CIPHERTEXT_SIZE= 1088 - T_AS_NTT_ENCODED_SIZE= 1152 - C1_LEN= 960 - C2_LEN= 128 - U_COMPRESSION_FACTOR= 10 - V_COMPRESSION_FACTOR= 4 - BLOCK_LEN= 320 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 - ETA2= 2 - ETA2_RANDOMNESS_SIZE= 128 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_encrypt_2a( Eurydice_slice public_key, uint8_t *message, Eurydice_slice randomness, uint8_t ret[1088U]) { libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 unpacked_public_key = libcrux_ml_kem_ind_cpa_build_unpacked_public_key_3f(public_key); uint8_t ret0[1088U]; libcrux_ml_kem_ind_cpa_encrypt_unpacked_2a(&unpacked_public_key, message, randomness, ret0); memcpy(ret, ret0, (size_t)1088U * sizeof(uint8_t)); } /** This function found in impl {libcrux_ml_kem::variant::Variant for libcrux_ml_kem::variant::MlKem} d10879 1 a10879 1 A monomorphic instance of libcrux_ml_kem.variant.kdf_39 d10885 3 a10887 2 static KRML_MUSTINLINE void libcrux_ml_kem_variant_kdf_39_d6( Eurydice_slice shared_secret, uint8_t *_, uint8_t ret[32U]) { a10894 3 This code verifies on some machines, runs out of memory on others */ /** d10916 2 a10917 2 static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_decapsulate_62( libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key, d10919 3 a10921 3 Eurydice_slice_uint8_t_x4 uu____0 = libcrux_ml_kem_types_unpack_private_key_b4( Eurydice_array_to_slice((size_t)2400U, private_key->value, uint8_t)); d10923 10 a10932 3 Eurydice_slice ind_cpa_public_key = uu____0.snd; Eurydice_slice ind_cpa_public_key_hash = uu____0.thd; Eurydice_slice implicit_rejection_value = uu____0.f3; d10934 1 a10934 1 libcrux_ml_kem_ind_cpa_decrypt_42(ind_cpa_secret_key, ciphertext->value, d10937 1 a10937 1 libcrux_ml_kem_utils_into_padded_array_24( d10942 1 a10942 1 uint8_t, size_t, uint8_t[]), d10945 1 a10945 1 libcrux_ml_kem_hash_functions_portable_G_4a_e0( d10947 1 a10947 1 Eurydice_slice_uint8_t_x2 uu____1 = Eurydice_slice_split_at( d10951 2 a10952 2 Eurydice_slice shared_secret0 = uu____1.fst; Eurydice_slice pseudorandomness = uu____1.snd; d10954 2 a10955 2 libcrux_ml_kem_utils_into_padded_array_15(implicit_rejection_value, to_hash); Eurydice_slice uu____2 = Eurydice_array_to_subslice_from( d10957 2 a10958 2 uint8_t, size_t, uint8_t[]); Eurydice_slice_copy(uu____2, libcrux_ml_kem_types_as_ref_d3_80(ciphertext), d10961 1 a10961 1 libcrux_ml_kem_hash_functions_portable_PRF_4a_41( d10964 4 d10969 1 a10969 1 libcrux_ml_kem_ind_cpa_encrypt_2a(ind_cpa_public_key, decrypted, d10972 1 a10972 1 libcrux_ml_kem_variant_kdf_39_d6( d10975 1 a10975 2 libcrux_ml_kem_types_as_slice_a9_80(ciphertext), implicit_rejection_shared_secret); d10977 1 a10977 3 libcrux_ml_kem_variant_kdf_39_d6( shared_secret0, libcrux_ml_kem_types_as_slice_a9_80(ciphertext), shared_secret); d10980 1 a10980 1 libcrux_ml_kem_types_as_ref_d3_80(ciphertext), d11013 2 a11014 2 libcrux_ml_kem_ind_cca_instantiations_portable_decapsulate_35( libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key, d11016 1 a11016 1 libcrux_ml_kem_ind_cca_decapsulate_62(private_key, ciphertext, ret); d11027 1 a11027 1 libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key, d11029 1 a11029 1 libcrux_ml_kem_ind_cca_instantiations_portable_decapsulate_35( d11034 2 a11035 2 This function found in impl {libcrux_ml_kem::variant::Variant for libcrux_ml_kem::variant::MlKem} d11038 1 a11038 1 A monomorphic instance of libcrux_ml_kem.variant.entropy_preprocess_39 d11043 1 a11043 1 static KRML_MUSTINLINE void libcrux_ml_kem_variant_entropy_preprocess_39_9c( d11052 2 a11053 2 This function found in impl {libcrux_ml_kem::hash_functions::Hash for libcrux_ml_kem::hash_functions::portable::PortableHash} d11056 1 a11056 1 A monomorphic instance of libcrux_ml_kem.hash_functions.portable.H_4a d11060 1 a11060 1 static inline void libcrux_ml_kem_hash_functions_portable_H_4a_e0( d11078 1 a11078 1 - C1_BLOCK_SIZE= 320 d11084 3 a11086 2 static KRML_MUSTINLINE tuple_c2 libcrux_ml_kem_ind_cca_encapsulate_ca( libcrux_ml_kem_types_MlKemPublicKey_30 *public_key, uint8_t *randomness) { d11088 1 a11088 1 libcrux_ml_kem_variant_entropy_preprocess_39_9c( d11091 1 a11091 1 libcrux_ml_kem_utils_into_padded_array_24( d11095 3 a11097 3 size_t, uint8_t[]); uint8_t ret0[32U]; libcrux_ml_kem_hash_functions_portable_H_4a_e0( d11099 1 a11099 1 libcrux_ml_kem_types_as_slice_e6_d0(public_key), d11101 1 a11101 1 ret0); d11103 1 a11103 1 uu____0, Eurydice_array_to_slice((size_t)32U, ret0, uint8_t), uint8_t); d11105 1 a11105 1 libcrux_ml_kem_hash_functions_portable_G_4a_e0( d11113 5 d11119 2 a11120 5 libcrux_ml_kem_ind_cpa_encrypt_2a( Eurydice_array_to_slice((size_t)1184U, libcrux_ml_kem_types_as_slice_e6_d0(public_key), uint8_t), randomness0, pseudorandomness, ciphertext); d11124 13 a11136 5 tuple_c2 lit; lit.fst = libcrux_ml_kem_types_from_e0_80(copy_of_ciphertext); uint8_t ret[32U]; libcrux_ml_kem_variant_kdf_39_d6(shared_secret, ciphertext, ret); memcpy(lit.snd, ret, (size_t)32U * sizeof(uint8_t)); d11151 1 a11151 1 - C1_BLOCK_SIZE= 320 d11157 9 a11165 4 static inline tuple_c2 libcrux_ml_kem_ind_cca_instantiations_portable_encapsulate_cd( libcrux_ml_kem_types_MlKemPublicKey_30 *public_key, uint8_t *randomness) { return libcrux_ml_kem_ind_cca_encapsulate_ca(public_key, randomness); d11175 2 a11176 2 static inline tuple_c2 libcrux_ml_kem_mlkem768_portable_encapsulate( libcrux_ml_kem_types_MlKemPublicKey_30 *public_key, d11178 6 a11183 26 return libcrux_ml_kem_ind_cca_instantiations_portable_encapsulate_cd( public_key, randomness); } /** This function found in impl {core::default::Default for libcrux_ml_kem::ind_cpa::unpacked::IndCpaPrivateKeyUnpacked[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.unpacked.default_70 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static inline libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_a0 libcrux_ml_kem_ind_cpa_unpacked_default_70_1b(void) { libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_a0 lit; libcrux_ml_kem_polynomial_PolynomialRingElement_1d repeat_expression[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { repeat_expression[i] = libcrux_ml_kem_polynomial_ZERO_d6_ea(); } memcpy( lit.secret_as_ntt, repeat_expression, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); return lit; d11187 2 a11188 2 This function found in impl {libcrux_ml_kem::variant::Variant for libcrux_ml_kem::variant::MlKem} d11191 1 a11191 1 A monomorphic instance of libcrux_ml_kem.variant.cpa_keygen_seed_39 d11196 1 a11196 1 static KRML_MUSTINLINE void libcrux_ml_kem_variant_cpa_keygen_seed_39_9c( d11200 1 a11200 1 Eurydice_array_to_subslice3( d11202 1 a11202 1 LIBCRUX_ML_KEM_CONSTANTS_CPA_PKE_KEY_GENERATION_SEED_SIZE, uint8_t *), d11207 1 a11207 1 libcrux_ml_kem_hash_functions_portable_G_4a_e0( d11213 3 a11215 13 This function found in impl {core::ops::function::FnMut<(usize), libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@3]> for libcrux_ml_kem::ind_cpa::generate_keypair_unpacked::closure[TraitClause@@0, TraitClause@@1, TraitClause@@2, TraitClause@@3, TraitClause@@4, TraitClause@@5]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.generate_keypair_unpacked.call_mut_73 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]], libcrux_ml_kem_variant_MlKem with const generics a11216 2 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 d11218 3 a11220 4 static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_ind_cpa_generate_keypair_unpacked_call_mut_73_1c( void **_, size_t tupled_args) { return libcrux_ml_kem_polynomial_ZERO_d6_ea(); d11224 1 a11224 1 A monomorphic instance of libcrux_ml_kem.polynomial.to_standard_domain d11229 5 a11233 6 static KRML_MUSTINLINE libcrux_ml_kem_vector_portable_vector_type_PortableVector libcrux_ml_kem_polynomial_to_standard_domain_ea( libcrux_ml_kem_vector_portable_vector_type_PortableVector vector) { return libcrux_ml_kem_vector_portable_montgomery_multiply_by_constant_b8( vector, LIBCRUX_ML_KEM_VECTOR_TRAITS_MONTGOMERY_R_SQUARED_MOD_FIELD_MODULUS); d11237 5 a11241 1 A monomorphic instance of libcrux_ml_kem.polynomial.add_standard_error_reduce d11247 3 a11249 3 libcrux_ml_kem_polynomial_add_standard_error_reduce_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *myself, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *error) { d11255 7 a11261 8 libcrux_ml_kem_polynomial_to_standard_domain_ea( myself->coefficients[j]); libcrux_ml_kem_vector_portable_vector_type_PortableVector sum = libcrux_ml_kem_vector_portable_add_b8(coefficient_normal_form, &error->coefficients[j]); libcrux_ml_kem_vector_portable_vector_type_PortableVector red = libcrux_ml_kem_vector_portable_barrett_reduce_b8(sum); myself->coefficients[j] = red; d11266 1 a11266 3 This function found in impl {libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]} d11269 1 a11269 1 A monomorphic instance of libcrux_ml_kem.polynomial.add_standard_error_reduce_d6 d11272 48 d11323 17 a11339 4 libcrux_ml_kem_polynomial_add_standard_error_reduce_d6_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *self, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *error) { libcrux_ml_kem_polynomial_add_standard_error_reduce_ea(self, error); d11343 1 a11343 1 Compute  ◦ ŝ + ê d11346 1 a11346 1 A monomorphic instance of libcrux_ml_kem.matrix.compute_As_plus_e d11350 1 d11352 4 a11355 5 static KRML_MUSTINLINE void libcrux_ml_kem_matrix_compute_As_plus_e_1b( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *t_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_1d (*matrix_A)[3U], libcrux_ml_kem_polynomial_PolynomialRingElement_1d *s_as_ntt, libcrux_ml_kem_polynomial_PolynomialRingElement_1d *error_as_ntt) { d11359 3 a11361 3 (size_t)3U, matrix_A, libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U]), libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U]); d11364 9 a11372 22 libcrux_ml_kem_polynomial_PolynomialRingElement_1d *row = matrix_A[i0]; libcrux_ml_kem_polynomial_PolynomialRingElement_1d uu____0 = libcrux_ml_kem_polynomial_ZERO_d6_ea(); t_as_ntt[i0] = uu____0; for (size_t i1 = (size_t)0U; i1 < Eurydice_slice_len( Eurydice_array_to_slice( (size_t)3U, row, libcrux_ml_kem_polynomial_PolynomialRingElement_1d), libcrux_ml_kem_polynomial_PolynomialRingElement_1d); i1++) { size_t j = i1; libcrux_ml_kem_polynomial_PolynomialRingElement_1d *matrix_element = &row[j]; libcrux_ml_kem_polynomial_PolynomialRingElement_1d product = libcrux_ml_kem_polynomial_ntt_multiply_d6_ea(matrix_element, &s_as_ntt[j]); libcrux_ml_kem_polynomial_add_to_ring_element_d6_1b(&t_as_ntt[i0], &product); } libcrux_ml_kem_polynomial_add_standard_error_reduce_d6_ea( &t_as_ntt[i0], &error_as_ntt[i0]); d11374 1 d11378 26 a11403 36 This function implements most of Algorithm 12 of the NIST FIPS 203 specification; this is the Kyber CPA-PKE key generation algorithm. We say "most of" since Algorithm 12 samples the required randomness within the function itself, whereas this implementation expects it to be provided through the `key_generation_seed` parameter. Algorithm 12 is reproduced below: ```plaintext Output: encryption key ekₚₖₑ ∈ 𝔹^{384k+32}. Output: decryption key dkₚₖₑ ∈ 𝔹^{384k}. d ←$ B (ρ,σ) ← G(d) N ← 0 for (i ← 0; i < k; i++) for(j ← 0; j < k; j++) Â[i,j] ← SampleNTT(XOF(ρ, i, j)) end for end for for(i ← 0; i < k; i++) s[i] ← SamplePolyCBD_{η₁}(PRF_{η₁}(σ,N)) N ← N + 1 end for for(i ← 0; i < k; i++) e[i] ← SamplePolyCBD_{η₂}(PRF_{η₂}(σ,N)) N ← N + 1 end for ŝ ← NTT(s) ê ← NTT(e) t̂ ← Â◦ŝ + ê ekₚₖₑ ← ByteEncode₁₂(t̂) ‖ ρ dkₚₖₑ ← ByteEncode₁₂(ŝ) ``` a11404 3 The NIST FIPS 203 standard can be found at . */ d11406 1 a11406 1 A monomorphic instance of libcrux_ml_kem.ind_cpa.generate_keypair_unpacked d11411 3 d11417 2 a11418 4 static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_generate_keypair_unpacked_1c( Eurydice_slice key_generation_seed, libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_a0 *private_key, libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 *public_key) { d11420 1 a11420 1 libcrux_ml_kem_variant_cpa_keygen_seed_39_9c(key_generation_seed, hashed); d11424 1 a11424 1 Eurydice_slice seed_for_A = uu____0.fst; d11426 1 a11426 2 libcrux_ml_kem_polynomial_PolynomialRingElement_1d(*uu____1)[3U] = public_key->A; d11428 2 a11429 2 libcrux_ml_kem_utils_into_padded_array_b6(seed_for_A, ret); libcrux_ml_kem_matrix_sample_matrix_A_2b(uu____1, ret, true); d11431 29 a11459 145 libcrux_ml_kem_utils_into_padded_array_c8(seed_for_secret_and_error, prf_input); uint8_t domain_separator = libcrux_ml_kem_ind_cpa_sample_vector_cbd_then_ntt_3b( private_key->secret_as_ntt, prf_input, 0U); libcrux_ml_kem_polynomial_PolynomialRingElement_1d error_as_ntt[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { /* original Rust expression is not an lvalue in C */ void *lvalue = (void *)0U; error_as_ntt[i] = libcrux_ml_kem_ind_cpa_generate_keypair_unpacked_call_mut_73_1c(&lvalue, i); } libcrux_ml_kem_ind_cpa_sample_vector_cbd_then_ntt_3b(error_as_ntt, prf_input, domain_separator); libcrux_ml_kem_matrix_compute_As_plus_e_1b( public_key->t_as_ntt, public_key->A, private_key->secret_as_ntt, error_as_ntt); uint8_t uu____2[32U]; Result_fb dst; Eurydice_slice_to_array2(&dst, seed_for_A, Eurydice_slice, uint8_t[32U], TryFromSliceError); unwrap_26_b3(dst, uu____2); memcpy(public_key->seed_for_A, uu____2, (size_t)32U * sizeof(uint8_t)); } /** A monomorphic instance of libcrux_ml_kem.serialize.serialize_uncompressed_ring_element with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static KRML_MUSTINLINE void libcrux_ml_kem_serialize_serialize_uncompressed_ring_element_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *re, uint8_t ret[384U]) { uint8_t serialized[384U] = {0U}; for (size_t i = (size_t)0U; i < LIBCRUX_ML_KEM_POLYNOMIAL_VECTORS_IN_RING_ELEMENT; i++) { size_t i0 = i; libcrux_ml_kem_vector_portable_vector_type_PortableVector coefficient = libcrux_ml_kem_serialize_to_unsigned_field_modulus_ea( re->coefficients[i0]); uint8_t bytes[24U]; libcrux_ml_kem_vector_portable_serialize_12_b8(coefficient, bytes); Eurydice_slice_copy( Eurydice_array_to_subslice3(serialized, (size_t)24U * i0, (size_t)24U * i0 + (size_t)24U, uint8_t *), Eurydice_array_to_slice((size_t)24U, bytes, uint8_t), uint8_t); } memcpy(ret, serialized, (size_t)384U * sizeof(uint8_t)); } /** Call [`serialize_uncompressed_ring_element`] for each ring element. */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.serialize_vector with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_serialize_vector_1b( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *key, Eurydice_slice out) { for (size_t i = (size_t)0U; i < Eurydice_slice_len( Eurydice_array_to_slice( (size_t)3U, key, libcrux_ml_kem_polynomial_PolynomialRingElement_1d), libcrux_ml_kem_polynomial_PolynomialRingElement_1d); i++) { size_t i0 = i; libcrux_ml_kem_polynomial_PolynomialRingElement_1d re = key[i0]; Eurydice_slice uu____0 = Eurydice_slice_subslice3( out, i0 * LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT, (i0 + (size_t)1U) * LIBCRUX_ML_KEM_CONSTANTS_BYTES_PER_RING_ELEMENT, uint8_t *); uint8_t ret[384U]; libcrux_ml_kem_serialize_serialize_uncompressed_ring_element_ea(&re, ret); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)384U, ret, uint8_t), uint8_t); } } /** Concatenate `t` and `ρ` into the public key. */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.serialize_public_key_mut with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - PUBLIC_KEY_SIZE= 1184 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_serialize_public_key_mut_89( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *t_as_ntt, Eurydice_slice seed_for_a, uint8_t *serialized) { libcrux_ml_kem_ind_cpa_serialize_vector_1b( t_as_ntt, Eurydice_array_to_subslice3( serialized, (size_t)0U, libcrux_ml_kem_constants_ranked_bytes_per_ring_element((size_t)3U), uint8_t *)); Eurydice_slice_copy( Eurydice_array_to_subslice_from( (size_t)1184U, serialized, libcrux_ml_kem_constants_ranked_bytes_per_ring_element((size_t)3U), uint8_t, size_t, uint8_t[]), seed_for_a, uint8_t); } /** Concatenate `t` and `ρ` into the public key. */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.serialize_public_key with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - PUBLIC_KEY_SIZE= 1184 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cpa_serialize_public_key_89( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *t_as_ntt, Eurydice_slice seed_for_a, uint8_t ret[1184U]) { uint8_t public_key_serialized[1184U] = {0U}; libcrux_ml_kem_ind_cpa_serialize_public_key_mut_89(t_as_ntt, seed_for_a, public_key_serialized); memcpy(ret, public_key_serialized, (size_t)1184U * sizeof(uint8_t)); } /** Serialize the secret key from the unpacked key pair generation. */ /** A monomorphic instance of libcrux_ml_kem.ind_cpa.serialize_unpacked_secret_key with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - PRIVATE_KEY_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 */ static inline libcrux_ml_kem_utils_extraction_helper_Keypair768 libcrux_ml_kem_ind_cpa_serialize_unpacked_secret_key_6c( libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 *public_key, libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_a0 *private_key) { d11461 2 a11462 3 libcrux_ml_kem_ind_cpa_serialize_public_key_89( public_key->t_as_ntt, Eurydice_array_to_slice((size_t)32U, public_key->seed_for_A, uint8_t), d11464 3 a11466 4 uint8_t secret_key_serialized[1152U] = {0U}; libcrux_ml_kem_ind_cpa_serialize_vector_1b( private_key->secret_as_ntt, Eurydice_array_to_slice((size_t)1152U, secret_key_serialized, uint8_t)); a11483 23 A monomorphic instance of libcrux_ml_kem.ind_cpa.generate_keypair with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]], libcrux_ml_kem_variant_MlKem with const generics - K= 3 - PRIVATE_KEY_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 */ static KRML_MUSTINLINE libcrux_ml_kem_utils_extraction_helper_Keypair768 libcrux_ml_kem_ind_cpa_generate_keypair_ea(Eurydice_slice key_generation_seed) { libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_a0 private_key = libcrux_ml_kem_ind_cpa_unpacked_default_70_1b(); libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 public_key = libcrux_ml_kem_ind_cpa_unpacked_default_8b_1b(); libcrux_ml_kem_ind_cpa_generate_keypair_unpacked_1c( key_generation_seed, &private_key, &public_key); return libcrux_ml_kem_ind_cpa_serialize_unpacked_secret_key_6c(&public_key, &private_key); } /** d11487 1 a11487 1 A monomorphic instance of libcrux_ml_kem.ind_cca.serialize_kem_secret_key_mut d11493 1 a11493 2 static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_serialize_kem_secret_key_mut_d6( d11495 2 a11496 1 Eurydice_slice implicit_rejection_value, uint8_t *serialized) { d11498 1 a11498 1 uint8_t *uu____0 = serialized; d11502 1 a11502 1 Eurydice_array_to_subslice3( d11504 1 a11504 1 uint8_t *), d11507 1 a11507 1 uint8_t *uu____3 = serialized; d11511 1 a11511 1 Eurydice_array_to_subslice3( d11513 1 a11513 1 uint8_t *), d11516 4 a11519 5 Eurydice_slice uu____6 = Eurydice_array_to_subslice3( serialized, pointer, pointer + LIBCRUX_ML_KEM_CONSTANTS_H_DIGEST_SIZE, uint8_t *); uint8_t ret[32U]; libcrux_ml_kem_hash_functions_portable_H_4a_e0(public_key, ret); d11521 1 a11521 1 uu____6, Eurydice_array_to_slice((size_t)32U, ret, uint8_t), uint8_t); d11523 1 a11523 1 uint8_t *uu____7 = serialized; d11527 1 a11527 1 Eurydice_array_to_subslice3( d11530 1 a11530 1 uint8_t *), a11531 15 } /** A monomorphic instance of libcrux_ml_kem.ind_cca.serialize_kem_secret_key with types libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - SERIALIZED_KEY_LEN= 2400 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_serialize_kem_secret_key_d6( Eurydice_slice private_key, Eurydice_slice public_key, Eurydice_slice implicit_rejection_value, uint8_t ret[2400U]) { uint8_t out[2400U] = {0U}; libcrux_ml_kem_ind_cca_serialize_kem_secret_key_mut_d6( private_key, public_key, implicit_rejection_value, out); d11552 1 d11556 3 a11558 3 static KRML_MUSTINLINE libcrux_ml_kem_mlkem768_MlKem768KeyPair libcrux_ml_kem_ind_cca_generate_keypair_15(uint8_t *randomness) { Eurydice_slice ind_cpa_keypair_randomness = Eurydice_array_to_subslice3( d11560 1 a11560 1 LIBCRUX_ML_KEM_CONSTANTS_CPA_PKE_KEY_GENERATION_SEED_SIZE, uint8_t *); d11564 1 a11564 1 size_t, uint8_t[]); d11566 1 a11566 1 libcrux_ml_kem_ind_cpa_generate_keypair_ea(ind_cpa_keypair_randomness); d11572 1 a11572 1 libcrux_ml_kem_ind_cca_serialize_kem_secret_key_d6( d11580 3 a11582 3 libcrux_ml_kem_types_MlKemPrivateKey_d9 private_key = libcrux_ml_kem_types_from_77_28(copy_of_secret_key_serialized); libcrux_ml_kem_types_MlKemPrivateKey_d9 uu____2 = private_key; d11586 2 a11587 2 return libcrux_ml_kem_types_from_17_74( uu____2, libcrux_ml_kem_types_from_fd_d0(copy_of_public_key)); d11601 1 d11606 6 a11611 3 libcrux_ml_kem_ind_cca_instantiations_portable_generate_keypair_ce( uint8_t *randomness) { return libcrux_ml_kem_ind_cca_generate_keypair_15(randomness); d11619 5 a11623 2 return libcrux_ml_kem_ind_cca_instantiations_portable_generate_keypair_ce( randomness); d11627 2 a11628 3 Validate an ML-KEM private key. This implements the Hash check in 7.3 3. d11631 1 a11631 1 A monomorphic instance of libcrux_ml_kem.ind_cca.validate_private_key_only d11635 1 a11635 1 - SECRET_KEY_SIZE= 2400 d11637 20 a11656 12 static KRML_MUSTINLINE bool libcrux_ml_kem_ind_cca_validate_private_key_only_d6( libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key) { uint8_t t[32U]; libcrux_ml_kem_hash_functions_portable_H_4a_e0( Eurydice_array_to_subslice3(private_key->value, (size_t)384U * (size_t)3U, (size_t)768U * (size_t)3U + (size_t)32U, uint8_t *), t); Eurydice_slice expected = Eurydice_array_to_subslice3( private_key->value, (size_t)768U * (size_t)3U + (size_t)32U, (size_t)768U * (size_t)3U + (size_t)64U, uint8_t *); return Eurydice_array_eq_slice((size_t)32U, t, &expected, uint8_t, bool); d11660 4 a11663 10 Validate an ML-KEM private key. This implements the Hash check in 7.3 3. Note that the size checks in 7.2 1 and 2 are covered by the `SECRET_KEY_SIZE` and `CIPHERTEXT_SIZE` in the `private_key` and `ciphertext` types. */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.validate_private_key with types libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics d11666 2 d11669 11 d11681 71 a11751 4 static KRML_MUSTINLINE bool libcrux_ml_kem_ind_cca_validate_private_key_37( libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key, libcrux_ml_kem_mlkem768_MlKem768Ciphertext *_ciphertext) { return libcrux_ml_kem_ind_cca_validate_private_key_only_d6(private_key); d11755 1 a11755 1 Private key validation d11759 1 a11759 1 libcrux_ml_kem.ind_cca.instantiations.portable.validate_private_key with const d11763 2 d11766 2 a11767 206 */ static KRML_MUSTINLINE bool libcrux_ml_kem_ind_cca_instantiations_portable_validate_private_key_31( libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key, libcrux_ml_kem_mlkem768_MlKem768Ciphertext *ciphertext) { return libcrux_ml_kem_ind_cca_validate_private_key_37(private_key, ciphertext); } /** Validate a private key. Returns `true` if valid, and `false` otherwise. */ static inline bool libcrux_ml_kem_mlkem768_portable_validate_private_key( libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key, libcrux_ml_kem_mlkem768_MlKem768Ciphertext *ciphertext) { return libcrux_ml_kem_ind_cca_instantiations_portable_validate_private_key_31( private_key, ciphertext); } /** Private key validation */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.instantiations.portable.validate_private_key_only with const generics - K= 3 - SECRET_KEY_SIZE= 2400 */ static KRML_MUSTINLINE bool libcrux_ml_kem_ind_cca_instantiations_portable_validate_private_key_only_41( libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key) { return libcrux_ml_kem_ind_cca_validate_private_key_only_d6(private_key); } /** Validate the private key only. Returns `true` if valid, and `false` otherwise. */ static inline bool libcrux_ml_kem_mlkem768_portable_validate_private_key_only( libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key) { return libcrux_ml_kem_ind_cca_instantiations_portable_validate_private_key_only_41( private_key); } /** This function found in impl {core::ops::function::FnMut<(usize), libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]> for libcrux_ml_kem::serialize::deserialize_ring_elements_reduced_out::closure[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.serialize.deserialize_ring_elements_reduced_out.call_mut_0b with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_out_call_mut_0b_1b( void **_, size_t tupled_args) { return libcrux_ml_kem_polynomial_ZERO_d6_ea(); } /** This function deserializes ring elements and reduces the result by the field modulus. This function MUST NOT be used on secret inputs. */ /** A monomorphic instance of libcrux_ml_kem.serialize.deserialize_ring_elements_reduced_out with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE void libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_out_1b( Eurydice_slice public_key, libcrux_ml_kem_polynomial_PolynomialRingElement_1d ret[3U]) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d deserialized_pk[3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { /* original Rust expression is not an lvalue in C */ void *lvalue = (void *)0U; deserialized_pk[i] = libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_out_call_mut_0b_1b( &lvalue, i); } libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_1b( public_key, deserialized_pk); memcpy( ret, deserialized_pk, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); } /** Validate an ML-KEM public key. This implements the Modulus check in 7.2 2. Note that the size check in 7.2 1 is covered by the `PUBLIC_KEY_SIZE` in the `public_key` type. */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.validate_public_key with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - PUBLIC_KEY_SIZE= 1184 */ static KRML_MUSTINLINE bool libcrux_ml_kem_ind_cca_validate_public_key_89( uint8_t *public_key) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d deserialized_pk[3U]; libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_out_1b( Eurydice_array_to_subslice_to( (size_t)1184U, public_key, libcrux_ml_kem_constants_ranked_bytes_per_ring_element((size_t)3U), uint8_t, size_t, uint8_t[]), deserialized_pk); libcrux_ml_kem_polynomial_PolynomialRingElement_1d *uu____0 = deserialized_pk; uint8_t public_key_serialized[1184U]; libcrux_ml_kem_ind_cpa_serialize_public_key_89( uu____0, Eurydice_array_to_subslice_from( (size_t)1184U, public_key, libcrux_ml_kem_constants_ranked_bytes_per_ring_element((size_t)3U), uint8_t, size_t, uint8_t[]), public_key_serialized); return Eurydice_array_eq((size_t)1184U, public_key, public_key_serialized, uint8_t); } /** Public key validation */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.instantiations.portable.validate_public_key with const generics - K= 3 - PUBLIC_KEY_SIZE= 1184 */ static KRML_MUSTINLINE bool libcrux_ml_kem_ind_cca_instantiations_portable_validate_public_key_41( uint8_t *public_key) { return libcrux_ml_kem_ind_cca_validate_public_key_89(public_key); } /** Validate a public key. Returns `true` if valid, and `false` otherwise. */ static inline bool libcrux_ml_kem_mlkem768_portable_validate_public_key( libcrux_ml_kem_types_MlKemPublicKey_30 *public_key) { return libcrux_ml_kem_ind_cca_instantiations_portable_validate_public_key_41( public_key->value); } /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.MlKemPublicKeyUnpacked with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - $3size_t */ typedef struct libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0_s { libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 ind_cpa_public_key; uint8_t public_key_hash[32U]; } libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0; typedef libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768PublicKeyUnpacked; /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.MlKemPrivateKeyUnpacked with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - $3size_t */ typedef struct libcrux_ml_kem_ind_cca_unpacked_MlKemPrivateKeyUnpacked_a0_s { libcrux_ml_kem_ind_cpa_unpacked_IndCpaPrivateKeyUnpacked_a0 ind_cpa_private_key; uint8_t implicit_rejection_value[32U]; } libcrux_ml_kem_ind_cca_unpacked_MlKemPrivateKeyUnpacked_a0; typedef struct libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked_s { libcrux_ml_kem_ind_cca_unpacked_MlKemPrivateKeyUnpacked_a0 private_key; libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 public_key; } libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked; /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.decapsulate with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics - K= 3 - SECRET_KEY_SIZE= 2400 - CPA_SECRET_KEY_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 - CIPHERTEXT_SIZE= 1088 - T_AS_NTT_ENCODED_SIZE= 1152 - C1_SIZE= 960 d11778 3 a11780 84 static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_unpacked_decapsulate_51( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *key_pair, libcrux_ml_kem_mlkem768_MlKem768Ciphertext *ciphertext, uint8_t ret[32U]) { uint8_t decrypted[32U]; libcrux_ml_kem_ind_cpa_decrypt_unpacked_42( &key_pair->private_key.ind_cpa_private_key, ciphertext->value, decrypted); uint8_t to_hash0[64U]; libcrux_ml_kem_utils_into_padded_array_24( Eurydice_array_to_slice((size_t)32U, decrypted, uint8_t), to_hash0); Eurydice_slice uu____0 = Eurydice_array_to_subslice_from( (size_t)64U, to_hash0, LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE, uint8_t, size_t, uint8_t[]); Eurydice_slice_copy( uu____0, Eurydice_array_to_slice((size_t)32U, key_pair->public_key.public_key_hash, uint8_t), uint8_t); uint8_t hashed[64U]; libcrux_ml_kem_hash_functions_portable_G_4a_e0( Eurydice_array_to_slice((size_t)64U, to_hash0, uint8_t), hashed); Eurydice_slice_uint8_t_x2 uu____1 = Eurydice_slice_split_at( Eurydice_array_to_slice((size_t)64U, hashed, uint8_t), LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE, uint8_t, Eurydice_slice_uint8_t_x2); Eurydice_slice shared_secret = uu____1.fst; Eurydice_slice pseudorandomness = uu____1.snd; uint8_t to_hash[1120U]; libcrux_ml_kem_utils_into_padded_array_15( Eurydice_array_to_slice( (size_t)32U, key_pair->private_key.implicit_rejection_value, uint8_t), to_hash); Eurydice_slice uu____2 = Eurydice_array_to_subslice_from( (size_t)1120U, to_hash, LIBCRUX_ML_KEM_CONSTANTS_SHARED_SECRET_SIZE, uint8_t, size_t, uint8_t[]); Eurydice_slice_copy(uu____2, libcrux_ml_kem_types_as_ref_d3_80(ciphertext), uint8_t); uint8_t implicit_rejection_shared_secret[32U]; libcrux_ml_kem_hash_functions_portable_PRF_4a_41( Eurydice_array_to_slice((size_t)1120U, to_hash, uint8_t), implicit_rejection_shared_secret); uint8_t expected_ciphertext[1088U]; libcrux_ml_kem_ind_cpa_encrypt_unpacked_2a( &key_pair->public_key.ind_cpa_public_key, decrypted, pseudorandomness, expected_ciphertext); uint8_t selector = libcrux_ml_kem_constant_time_ops_compare_ciphertexts_in_constant_time( libcrux_ml_kem_types_as_ref_d3_80(ciphertext), Eurydice_array_to_slice((size_t)1088U, expected_ciphertext, uint8_t)); uint8_t ret0[32U]; libcrux_ml_kem_constant_time_ops_select_shared_secret_in_constant_time( shared_secret, Eurydice_array_to_slice((size_t)32U, implicit_rejection_shared_secret, uint8_t), selector, ret0); memcpy(ret, ret0, (size_t)32U * sizeof(uint8_t)); } /** Unpacked decapsulate */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.instantiations.portable.unpacked.decapsulate with const generics - K= 3 - SECRET_KEY_SIZE= 2400 - CPA_SECRET_KEY_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 - CIPHERTEXT_SIZE= 1088 - T_AS_NTT_ENCODED_SIZE= 1152 - C1_SIZE= 960 - C2_SIZE= 128 - VECTOR_U_COMPRESSION_FACTOR= 10 - VECTOR_V_COMPRESSION_FACTOR= 4 - C1_BLOCK_SIZE= 320 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 - ETA2= 2 - ETA2_RANDOMNESS_SIZE= 128 - IMPLICIT_REJECTION_HASH_INPUT_SIZE= 1120 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_instantiations_portable_unpacked_decapsulate_35( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *key_pair, d11782 1 a11782 1 libcrux_ml_kem_ind_cca_unpacked_decapsulate_51(key_pair, ciphertext, ret); d11786 1 a11786 1 Decapsulate ML-KEM 768 (unpacked) d11789 2 a11790 2 The input is a reference to an unpacked key pair of type [`MlKem768KeyPairUnpacked`] and an [`MlKem768Ciphertext`]. d11792 2 a11793 3 static inline void libcrux_ml_kem_mlkem768_portable_unpacked_decapsulate( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *private_key, d11795 1 a11795 1 libcrux_ml_kem_ind_cca_instantiations_portable_unpacked_decapsulate_35( d11800 5 a11804 1 A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.encaps_prepare d11809 3 a11811 13 static inline void libcrux_ml_kem_ind_cca_unpacked_encaps_prepare_9c( Eurydice_slice randomness, Eurydice_slice pk_hash, uint8_t ret[64U]) { uint8_t to_hash[64U]; libcrux_ml_kem_utils_into_padded_array_24(randomness, to_hash); Eurydice_slice_copy( Eurydice_array_to_subslice_from((size_t)64U, to_hash, LIBCRUX_ML_KEM_CONSTANTS_H_DIGEST_SIZE, uint8_t, size_t, uint8_t[]), pk_hash, uint8_t); uint8_t ret0[64U]; libcrux_ml_kem_hash_functions_portable_G_4a_e0( Eurydice_array_to_slice((size_t)64U, to_hash, uint8_t), ret0); memcpy(ret, ret0, (size_t)64U * sizeof(uint8_t)); d11815 1 a11815 1 A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.encapsulate d11817 2 a11818 2 libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]] with const generics d11833 20 a11852 3 static KRML_MUSTINLINE tuple_c2 libcrux_ml_kem_ind_cca_unpacked_encapsulate_0c( libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 *public_key, uint8_t *randomness) { d11854 3 a11856 6 libcrux_ml_kem_ind_cca_unpacked_encaps_prepare_9c( Eurydice_array_to_slice((size_t)32U, randomness, uint8_t), Eurydice_array_to_slice((size_t)32U, public_key->public_key_hash, uint8_t), hashed); Eurydice_slice_uint8_t_x2 uu____0 = Eurydice_slice_split_at( d11860 7 a11866 2 Eurydice_slice shared_secret = uu____0.fst; Eurydice_slice pseudorandomness = uu____0.snd; d11868 2 a11869 7 libcrux_ml_kem_ind_cpa_encrypt_unpacked_2a(&public_key->ind_cpa_public_key, randomness, pseudorandomness, ciphertext); uint8_t shared_secret_array[32U] = {0U}; Eurydice_slice_copy( Eurydice_array_to_slice((size_t)32U, shared_secret_array, uint8_t), shared_secret, uint8_t); d11873 6 a11878 2 libcrux_ml_kem_mlkem768_MlKem768Ciphertext uu____2 = libcrux_ml_kem_types_from_e0_80(copy_of_ciphertext); d11883 2 a11884 2 tuple_c2 lit; lit.fst = uu____2; d11890 1 a11890 1 Unpacked encapsulate d11894 1 a11894 1 libcrux_ml_kem.ind_cca.instantiations.portable.unpacked.encapsulate with const d11910 3 a11912 17 static KRML_MUSTINLINE tuple_c2 libcrux_ml_kem_ind_cca_instantiations_portable_unpacked_encapsulate_cd( libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 *public_key, uint8_t *randomness) { return libcrux_ml_kem_ind_cca_unpacked_encapsulate_0c(public_key, randomness); } /** Encapsulate ML-KEM 768 (unpacked) Generates an ([`MlKem768Ciphertext`], [`MlKemSharedSecret`]) tuple. The input is a reference to an unpacked public key of type [`MlKem768PublicKeyUnpacked`], the SHA3-256 hash of this public key, and [`SHARED_SECRET_SIZE`] bytes of `randomness`. */ static inline tuple_c2 libcrux_ml_kem_mlkem768_portable_unpacked_encapsulate( libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 *public_key, d11914 1 a11914 185 return libcrux_ml_kem_ind_cca_instantiations_portable_unpacked_encapsulate_cd( public_key, randomness); } /** This function found in impl {core::ops::function::FnMut<(usize), libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@1]> for libcrux_ml_kem::ind_cca::unpacked::transpose_a::closure::closure[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.transpose_a.closure.call_mut_b4 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_ind_cca_unpacked_transpose_a_closure_call_mut_b4_1b( void **_, size_t tupled_args) { return libcrux_ml_kem_polynomial_ZERO_d6_ea(); } /** This function found in impl {core::ops::function::FnMut<(usize), @@Array[TraitClause@@0, TraitClause@@1], K>> for libcrux_ml_kem::ind_cca::unpacked::transpose_a::closure[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.transpose_a.call_mut_7b with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static inline void libcrux_ml_kem_ind_cca_unpacked_transpose_a_call_mut_7b_1b( void **_, size_t tupled_args, libcrux_ml_kem_polynomial_PolynomialRingElement_1d ret[3U]) { for (size_t i = (size_t)0U; i < (size_t)3U; i++) { /* original Rust expression is not an lvalue in C */ void *lvalue = (void *)0U; ret[i] = libcrux_ml_kem_ind_cca_unpacked_transpose_a_closure_call_mut_b4_1b( &lvalue, i); } } /** This function found in impl {core::clone::Clone for libcrux_ml_kem::polynomial::PolynomialRingElement[TraitClause@@0, TraitClause@@2]} */ /** A monomorphic instance of libcrux_ml_kem.polynomial.clone_c1 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics */ static inline libcrux_ml_kem_polynomial_PolynomialRingElement_1d libcrux_ml_kem_polynomial_clone_c1_ea( libcrux_ml_kem_polynomial_PolynomialRingElement_1d *self) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d lit; libcrux_ml_kem_vector_portable_vector_type_PortableVector ret[16U]; core_array__core__clone__Clone_for__Array_T__N___clone( (size_t)16U, self->coefficients, ret, libcrux_ml_kem_vector_portable_vector_type_PortableVector, void *); memcpy(lit.coefficients, ret, (size_t)16U * sizeof(libcrux_ml_kem_vector_portable_vector_type_PortableVector)); return lit; } /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.transpose_a with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static inline void libcrux_ml_kem_ind_cca_unpacked_transpose_a_1b( libcrux_ml_kem_polynomial_PolynomialRingElement_1d ind_cpa_a[3U][3U], libcrux_ml_kem_polynomial_PolynomialRingElement_1d ret[3U][3U]) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d A[3U][3U]; for (size_t i = (size_t)0U; i < (size_t)3U; i++) { /* original Rust expression is not an lvalue in C */ void *lvalue = (void *)0U; libcrux_ml_kem_ind_cca_unpacked_transpose_a_call_mut_7b_1b(&lvalue, i, A[i]); } for (size_t i = (size_t)0U; i < (size_t)3U; i++) { size_t i0 = i; libcrux_ml_kem_polynomial_PolynomialRingElement_1d _a_i[3U][3U]; memcpy(_a_i, A, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U])); for (size_t i1 = (size_t)0U; i1 < (size_t)3U; i1++) { size_t j = i1; libcrux_ml_kem_polynomial_PolynomialRingElement_1d uu____0 = libcrux_ml_kem_polynomial_clone_c1_ea(&ind_cpa_a[j][i0]); A[i0][j] = uu____0; } } memcpy(ret, A, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U])); } /** Generate Unpacked Keys */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.generate_keypair with types libcrux_ml_kem_vector_portable_vector_type_PortableVector, libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]], libcrux_ml_kem_variant_MlKem with const generics - K= 3 - CPA_PRIVATE_KEY_SIZE= 1152 - PRIVATE_KEY_SIZE= 2400 - PUBLIC_KEY_SIZE= 1184 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_unpacked_generate_keypair_15( uint8_t randomness[64U], libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *out) { Eurydice_slice ind_cpa_keypair_randomness = Eurydice_array_to_subslice3( randomness, (size_t)0U, LIBCRUX_ML_KEM_CONSTANTS_CPA_PKE_KEY_GENERATION_SEED_SIZE, uint8_t *); Eurydice_slice implicit_rejection_value = Eurydice_array_to_subslice_from( (size_t)64U, randomness, LIBCRUX_ML_KEM_CONSTANTS_CPA_PKE_KEY_GENERATION_SEED_SIZE, uint8_t, size_t, uint8_t[]); libcrux_ml_kem_ind_cpa_generate_keypair_unpacked_1c( ind_cpa_keypair_randomness, &out->private_key.ind_cpa_private_key, &out->public_key.ind_cpa_public_key); libcrux_ml_kem_polynomial_PolynomialRingElement_1d uu____0[3U][3U]; memcpy(uu____0, out->public_key.ind_cpa_public_key.A, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U])); libcrux_ml_kem_polynomial_PolynomialRingElement_1d A[3U][3U]; libcrux_ml_kem_ind_cca_unpacked_transpose_a_1b(uu____0, A); libcrux_ml_kem_polynomial_PolynomialRingElement_1d uu____1[3U][3U]; memcpy(uu____1, A, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U])); memcpy(out->public_key.ind_cpa_public_key.A, uu____1, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U])); uint8_t pk_serialized[1184U]; libcrux_ml_kem_ind_cpa_serialize_public_key_89( out->public_key.ind_cpa_public_key.t_as_ntt, Eurydice_array_to_slice( (size_t)32U, out->public_key.ind_cpa_public_key.seed_for_A, uint8_t), pk_serialized); uint8_t uu____2[32U]; libcrux_ml_kem_hash_functions_portable_H_4a_e0( Eurydice_array_to_slice((size_t)1184U, pk_serialized, uint8_t), uu____2); memcpy(out->public_key.public_key_hash, uu____2, (size_t)32U * sizeof(uint8_t)); uint8_t uu____3[32U]; Result_fb dst; Eurydice_slice_to_array2(&dst, implicit_rejection_value, Eurydice_slice, uint8_t[32U], TryFromSliceError); unwrap_26_b3(dst, uu____3); memcpy(out->private_key.implicit_rejection_value, uu____3, (size_t)32U * sizeof(uint8_t)); } /** Generate a key pair */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.instantiations.portable.unpacked.generate_keypair with const generics - K= 3 - CPA_PRIVATE_KEY_SIZE= 1152 - PRIVATE_KEY_SIZE= 2400 - PUBLIC_KEY_SIZE= 1184 - ETA1= 2 - ETA1_RANDOMNESS_SIZE= 128 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_instantiations_portable_unpacked_generate_keypair_ce( uint8_t randomness[64U], libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *out) { d11916 3 a11918 3 uint8_t copy_of_randomness[64U]; memcpy(copy_of_randomness, randomness, (size_t)64U * sizeof(uint8_t)); libcrux_ml_kem_ind_cca_unpacked_generate_keypair_15(copy_of_randomness, out); d11922 1 a11922 13 Generate ML-KEM 768 Key Pair in "unpacked" form. */ static inline void libcrux_ml_kem_mlkem768_portable_unpacked_generate_key_pair_mut( uint8_t randomness[64U], libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *key_pair) { /* Passing arrays by value in Rust generates a copy in C */ uint8_t copy_of_randomness[64U]; memcpy(copy_of_randomness, randomness, (size_t)64U * sizeof(uint8_t)); libcrux_ml_kem_ind_cca_instantiations_portable_unpacked_generate_keypair_ce( copy_of_randomness, key_pair); } d11924 3 a11926 85 /** This function found in impl {core::default::Default for libcrux_ml_kem::ind_cca::unpacked::MlKemPublicKeyUnpacked[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.default_30 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 libcrux_ml_kem_ind_cca_unpacked_default_30_1b(void) { return ( KRML_CLITERAL(libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0){ .ind_cpa_public_key = libcrux_ml_kem_ind_cpa_unpacked_default_8b_1b(), .public_key_hash = {0U}}); } /** This function found in impl {core::default::Default for libcrux_ml_kem::ind_cca::unpacked::MlKemKeyPairUnpacked[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.default_7b with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked libcrux_ml_kem_ind_cca_unpacked_default_7b_1b(void) { libcrux_ml_kem_ind_cca_unpacked_MlKemPrivateKeyUnpacked_a0 uu____0 = { .ind_cpa_private_key = libcrux_ml_kem_ind_cpa_unpacked_default_70_1b(), .implicit_rejection_value = {0U}}; return (KRML_CLITERAL( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked){ .private_key = uu____0, .public_key = libcrux_ml_kem_ind_cca_unpacked_default_30_1b()}); } /** Generate ML-KEM 768 Key Pair in "unpacked" form. */ static inline libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked libcrux_ml_kem_mlkem768_portable_unpacked_generate_key_pair( uint8_t randomness[64U]) { libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked key_pair = libcrux_ml_kem_ind_cca_unpacked_default_7b_1b(); uint8_t uu____0[64U]; memcpy(uu____0, randomness, (size_t)64U * sizeof(uint8_t)); libcrux_ml_kem_mlkem768_portable_unpacked_generate_key_pair_mut(uu____0, &key_pair); return key_pair; } /** Create a new, empty unpacked key. */ static inline libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked libcrux_ml_kem_mlkem768_portable_unpacked_init_key_pair(void) { return libcrux_ml_kem_ind_cca_unpacked_default_7b_1b(); } /** Create a new, empty unpacked public key. */ static inline libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 libcrux_ml_kem_mlkem768_portable_unpacked_init_public_key(void) { return libcrux_ml_kem_ind_cca_unpacked_default_30_1b(); } /** Take a serialized private key and generate an unpacked key pair from it. */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.keys_from_private_key with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - SECRET_KEY_SIZE= 2400 - CPA_SECRET_KEY_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 - T_AS_NTT_ENCODED_SIZE= 1152 d11928 9 a11936 32 static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_unpacked_keys_from_private_key_42( libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key, libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *key_pair) { Eurydice_slice_uint8_t_x4 uu____0 = libcrux_ml_kem_types_unpack_private_key_b4( Eurydice_array_to_slice((size_t)2400U, private_key->value, uint8_t)); Eurydice_slice ind_cpa_secret_key = uu____0.fst; Eurydice_slice ind_cpa_public_key = uu____0.snd; Eurydice_slice ind_cpa_public_key_hash = uu____0.thd; Eurydice_slice implicit_rejection_value = uu____0.f3; libcrux_ml_kem_ind_cpa_deserialize_vector_1b( ind_cpa_secret_key, key_pair->private_key.ind_cpa_private_key.secret_as_ntt); libcrux_ml_kem_ind_cpa_build_unpacked_public_key_mut_3f( ind_cpa_public_key, &key_pair->public_key.ind_cpa_public_key); Eurydice_slice_copy( Eurydice_array_to_slice((size_t)32U, key_pair->public_key.public_key_hash, uint8_t), ind_cpa_public_key_hash, uint8_t); Eurydice_slice_copy( Eurydice_array_to_slice( (size_t)32U, key_pair->private_key.implicit_rejection_value, uint8_t), implicit_rejection_value, uint8_t); Eurydice_slice_copy( Eurydice_array_to_slice( (size_t)32U, key_pair->public_key.ind_cpa_public_key.seed_for_A, uint8_t), Eurydice_slice_subslice_from(ind_cpa_public_key, (size_t)1152U, uint8_t, size_t, uint8_t[]), uint8_t); d11940 2 a11941 1 Take a serialized private key and generate an unpacked key pair from it. d11944 2 a11945 2 A monomorphic instance of libcrux_ml_kem.ind_cca.instantiations.portable.unpacked.keypair_from_private_key a11947 4 - SECRET_KEY_SIZE= 2400 - CPA_SECRET_KEY_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 - T_AS_NTT_ENCODED_SIZE= 1152 d11949 3 a11951 7 static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_instantiations_portable_unpacked_keypair_from_private_key_fd( libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key, libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *key_pair) { libcrux_ml_kem_ind_cca_unpacked_keys_from_private_key_42(private_key, key_pair); d11955 10 a11964 1 Get an unpacked key from a private key. d11966 65 a12030 7 static inline void libcrux_ml_kem_mlkem768_portable_unpacked_key_pair_from_private_mut( libcrux_ml_kem_types_MlKemPrivateKey_d9 *private_key, libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *key_pair) { libcrux_ml_kem_ind_cca_instantiations_portable_unpacked_keypair_from_private_key_fd( private_key, key_pair); d12034 6 a12039 3 This function found in impl {libcrux_ml_kem::ind_cca::unpacked::MlKemKeyPairUnpacked[TraitClause@@0, TraitClause@@1]} d12042 4 a12045 3 A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.serialized_private_key_mut_11 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics d12050 3 d12054 9 a12062 4 static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_unpacked_serialized_private_key_mut_11_43( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *self, libcrux_ml_kem_types_MlKemPrivateKey_d9 *serialized) { d12064 1 a12064 3 libcrux_ml_kem_ind_cpa_serialize_unpacked_secret_key_6c( &self->public_key.ind_cpa_public_key, &self->private_key.ind_cpa_private_key); d12067 4 a12070 3 uint8_t ind_cpa_public_key[1184U]; memcpy(ind_cpa_public_key, uu____0.snd, (size_t)1184U * sizeof(uint8_t)); libcrux_ml_kem_ind_cca_serialize_kem_secret_key_mut_d6( d12072 14 a12085 4 Eurydice_array_to_slice((size_t)1184U, ind_cpa_public_key, uint8_t), Eurydice_array_to_slice( (size_t)32U, self->private_key.implicit_rejection_value, uint8_t), serialized->value); a12088 5 This function found in impl {libcrux_ml_kem::ind_cca::unpacked::MlKemKeyPairUnpacked[TraitClause@@0, TraitClause@@1]} */ /** d12090 2 a12091 2 libcrux_ml_kem.ind_cca.unpacked.serialized_private_key_11 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics d12096 3 d12100 7 a12106 7 static KRML_MUSTINLINE libcrux_ml_kem_types_MlKemPrivateKey_d9 libcrux_ml_kem_ind_cca_unpacked_serialized_private_key_11_43( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *self) { libcrux_ml_kem_types_MlKemPrivateKey_d9 sk = libcrux_ml_kem_types_default_d3_28(); libcrux_ml_kem_ind_cca_unpacked_serialized_private_key_mut_11_43(self, &sk); return sk; d12110 1 a12110 1 Get the serialized private key. d12112 8 a12119 5 static inline libcrux_ml_kem_types_MlKemPrivateKey_d9 libcrux_ml_kem_mlkem768_portable_unpacked_key_pair_serialized_private_key( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *key_pair) { return libcrux_ml_kem_ind_cca_unpacked_serialized_private_key_11_43(key_pair); d12123 1 a12123 9 Get the serialized private key. */ static inline void libcrux_ml_kem_mlkem768_portable_unpacked_key_pair_serialized_private_key_mut( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *key_pair, libcrux_ml_kem_types_MlKemPrivateKey_d9 *serialized) { libcrux_ml_kem_ind_cca_unpacked_serialized_private_key_mut_11_43(key_pair, serialized); } d12125 3 a12127 4 /** This function found in impl {libcrux_ml_kem::ind_cca::unpacked::MlKemPublicKeyUnpacked[TraitClause@@0, TraitClause@@1]} d12130 2 a12131 2 A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.serialized_dd with types libcrux_ml_kem_vector_portable_vector_type_PortableVector d12134 2 a12135 1 - PUBLIC_KEY_SIZE= 1184 d12137 14 a12150 10 static KRML_MUSTINLINE libcrux_ml_kem_types_MlKemPublicKey_30 libcrux_ml_kem_ind_cca_unpacked_serialized_dd_89( libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 *self) { uint8_t ret[1184U]; libcrux_ml_kem_ind_cpa_serialize_public_key_89( self->ind_cpa_public_key.t_as_ntt, Eurydice_array_to_slice((size_t)32U, self->ind_cpa_public_key.seed_for_A, uint8_t), ret); return libcrux_ml_kem_types_from_fd_d0(ret); d12154 1 a12154 3 This function found in impl {libcrux_ml_kem::ind_cca::unpacked::MlKemKeyPairUnpacked[TraitClause@@0, TraitClause@@1]} d12158 2 a12159 2 libcrux_ml_kem.ind_cca.unpacked.serialized_public_key_11 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics d12161 2 a12162 1 - PUBLIC_KEY_SIZE= 1184 d12164 6 a12169 4 static KRML_MUSTINLINE libcrux_ml_kem_types_MlKemPublicKey_30 libcrux_ml_kem_ind_cca_unpacked_serialized_public_key_11_89( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *self) { return libcrux_ml_kem_ind_cca_unpacked_serialized_dd_89(&self->public_key); d12173 3 a12175 1 Get the serialized public key. d12177 5 a12181 5 static inline libcrux_ml_kem_types_MlKemPublicKey_30 libcrux_ml_kem_mlkem768_portable_unpacked_key_pair_serialized_public_key( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *key_pair) { return libcrux_ml_kem_ind_cca_unpacked_serialized_public_key_11_89(key_pair); d12185 4 a12188 8 This function found in impl {libcrux_ml_kem::ind_cca::unpacked::MlKemPublicKeyUnpacked[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.serialized_mut_dd with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics a12189 1 - PUBLIC_KEY_SIZE= 1184 d12191 4 a12194 9 static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_unpacked_serialized_mut_dd_89( libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 *self, libcrux_ml_kem_types_MlKemPublicKey_30 *serialized) { libcrux_ml_kem_ind_cpa_serialize_public_key_mut_89( self->ind_cpa_public_key.t_as_ntt, Eurydice_array_to_slice((size_t)32U, self->ind_cpa_public_key.seed_for_A, uint8_t), serialized->value); d12198 4 a12201 3 This function found in impl {libcrux_ml_kem::ind_cca::unpacked::MlKemKeyPairUnpacked[TraitClause@@0, TraitClause@@1]} d12205 1 a12205 1 libcrux_ml_kem.ind_cca.unpacked.serialized_public_key_mut_11 with types d12207 1 a12208 1 - PUBLIC_KEY_SIZE= 1184 d12211 25 a12235 5 libcrux_ml_kem_ind_cca_unpacked_serialized_public_key_mut_11_89( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *self, libcrux_ml_kem_types_MlKemPublicKey_30 *serialized) { libcrux_ml_kem_ind_cca_unpacked_serialized_mut_dd_89(&self->public_key, serialized); d12239 1 a12239 9 Get the serialized public key. */ static inline void libcrux_ml_kem_mlkem768_portable_unpacked_key_pair_serialized_public_key_mut( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *key_pair, libcrux_ml_kem_types_MlKemPublicKey_30 *serialized) { libcrux_ml_kem_ind_cca_unpacked_serialized_public_key_mut_11_89(key_pair, serialized); } d12241 3 a12243 4 /** This function found in impl {core::clone::Clone for libcrux_ml_kem::ind_cpa::unpacked::IndCpaPublicKeyUnpacked[TraitClause@@0, TraitClause@@2]} d12246 1 a12246 1 A monomorphic instance of libcrux_ml_kem.ind_cpa.unpacked.clone_91 d12250 2 d12253 16 a12268 23 static inline libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 libcrux_ml_kem_ind_cpa_unpacked_clone_91_1b( libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 *self) { libcrux_ml_kem_polynomial_PolynomialRingElement_1d uu____0[3U]; core_array__core__clone__Clone_for__Array_T__N___clone( (size_t)3U, self->t_as_ntt, uu____0, libcrux_ml_kem_polynomial_PolynomialRingElement_1d, void *); uint8_t uu____1[32U]; core_array__core__clone__Clone_for__Array_T__N___clone( (size_t)32U, self->seed_for_A, uu____1, uint8_t, void *); libcrux_ml_kem_ind_cpa_unpacked_IndCpaPublicKeyUnpacked_a0 lit; memcpy( lit.t_as_ntt, uu____0, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d)); memcpy(lit.seed_for_A, uu____1, (size_t)32U * sizeof(uint8_t)); libcrux_ml_kem_polynomial_PolynomialRingElement_1d ret[3U][3U]; core_array__core__clone__Clone_for__Array_T__N___clone( (size_t)3U, self->A, ret, libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U], void *); memcpy(lit.A, ret, (size_t)3U * sizeof(libcrux_ml_kem_polynomial_PolynomialRingElement_1d[3U])); return lit; d12272 1 a12272 3 This function found in impl {core::clone::Clone for libcrux_ml_kem::ind_cca::unpacked::MlKemPublicKeyUnpacked[TraitClause@@0, TraitClause@@2]} d12275 3 a12277 3 A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.clone_d7 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics d12279 2 d12282 4 a12285 11 static inline libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 libcrux_ml_kem_ind_cca_unpacked_clone_d7_1b( libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 *self) { libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 lit; lit.ind_cpa_public_key = libcrux_ml_kem_ind_cpa_unpacked_clone_91_1b(&self->ind_cpa_public_key); uint8_t ret[32U]; core_array__core__clone__Clone_for__Array_T__N___clone( (size_t)32U, self->public_key_hash, ret, uint8_t, void *); memcpy(lit.public_key_hash, ret, (size_t)32U * sizeof(uint8_t)); return lit; d12289 1 a12289 15 This function found in impl {libcrux_ml_kem::ind_cca::unpacked::MlKemKeyPairUnpacked[TraitClause@@0, TraitClause@@1]} */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.public_key_11 with types libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 */ static KRML_MUSTINLINE libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 * libcrux_ml_kem_ind_cca_unpacked_public_key_11_1b( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *self) { return &self->public_key; } d12291 1 a12291 2 /** Get the unpacked public key. d12293 4 a12296 7 static inline void libcrux_ml_kem_mlkem768_portable_unpacked_public_key( libcrux_ml_kem_mlkem768_portable_unpacked_MlKem768KeyPairUnpacked *key_pair, libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 *pk) { libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 uu____0 = libcrux_ml_kem_ind_cca_unpacked_clone_d7_1b( libcrux_ml_kem_ind_cca_unpacked_public_key_11_1b(key_pair)); pk[0U] = uu____0; d12300 2 a12301 1 Get the serialized public key. d12303 4 a12306 5 static inline void libcrux_ml_kem_mlkem768_portable_unpacked_serialized_public_key( libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 *public_key, libcrux_ml_kem_types_MlKemPublicKey_30 *serialized) { libcrux_ml_kem_ind_cca_unpacked_serialized_mut_dd_89(public_key, serialized); d12309 1 a12309 47 /** Generate an unpacked key from a serialized key. */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.unpacked.unpack_public_key with types libcrux_ml_kem_hash_functions_portable_PortableHash[[$3size_t]], libcrux_ml_kem_vector_portable_vector_type_PortableVector with const generics - K= 3 - T_AS_NTT_ENCODED_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_unpacked_unpack_public_key_0a( libcrux_ml_kem_types_MlKemPublicKey_30 *public_key, libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 *unpacked_public_key) { Eurydice_slice uu____0 = Eurydice_array_to_subslice_to((size_t)1184U, public_key->value, (size_t)1152U, uint8_t, size_t, uint8_t[]); libcrux_ml_kem_serialize_deserialize_ring_elements_reduced_1b( uu____0, unpacked_public_key->ind_cpa_public_key.t_as_ntt); uint8_t uu____1[32U]; libcrux_ml_kem_utils_into_padded_array_9e( Eurydice_array_to_subslice_from((size_t)1184U, public_key->value, (size_t)1152U, uint8_t, size_t, uint8_t[]), uu____1); memcpy(unpacked_public_key->ind_cpa_public_key.seed_for_A, uu____1, (size_t)32U * sizeof(uint8_t)); libcrux_ml_kem_polynomial_PolynomialRingElement_1d(*uu____2)[3U] = unpacked_public_key->ind_cpa_public_key.A; uint8_t ret[34U]; libcrux_ml_kem_utils_into_padded_array_b6( Eurydice_array_to_subslice_from((size_t)1184U, public_key->value, (size_t)1152U, uint8_t, size_t, uint8_t[]), ret); libcrux_ml_kem_matrix_sample_matrix_A_2b(uu____2, ret, false); uint8_t uu____3[32U]; libcrux_ml_kem_hash_functions_portable_H_4a_e0( Eurydice_array_to_slice((size_t)1184U, libcrux_ml_kem_types_as_slice_e6_d0(public_key), uint8_t), uu____3); memcpy(unpacked_public_key->public_key_hash, uu____3, (size_t)32U * sizeof(uint8_t)); } d12311 2 a12312 19 /** Get the unpacked public key. */ /** A monomorphic instance of libcrux_ml_kem.ind_cca.instantiations.portable.unpacked.unpack_public_key with const generics - K= 3 - T_AS_NTT_ENCODED_SIZE= 1152 - PUBLIC_KEY_SIZE= 1184 */ static KRML_MUSTINLINE void libcrux_ml_kem_ind_cca_instantiations_portable_unpacked_unpack_public_key_31( libcrux_ml_kem_types_MlKemPublicKey_30 *public_key, libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 *unpacked_public_key) { libcrux_ml_kem_ind_cca_unpacked_unpack_public_key_0a(public_key, unpacked_public_key); } d12314 2 a12315 11 /** Get the unpacked public key. */ static inline void libcrux_ml_kem_mlkem768_portable_unpacked_unpacked_public_key( libcrux_ml_kem_types_MlKemPublicKey_30 *public_key, libcrux_ml_kem_ind_cca_unpacked_MlKemPublicKeyUnpacked_a0 *unpacked_public_key) { libcrux_ml_kem_ind_cca_instantiations_portable_unpacked_unpack_public_key_31( public_key, unpacked_public_key); } d12321 2 a12322 2 #define libcrux_mlkem768_portable_H_DEFINED #endif /* libcrux_mlkem768_portable_H */ d12327 3 a12329 2 #define libcrux_mlkem768_pk libcrux_ml_kem_types_MlKemPublicKey_30_s #define libcrux_mlkem768_sk libcrux_ml_kem_types_MlKemPrivateKey_d9_s d12331 1 a12331 1 #define libcrux_mlkem768_enc_result tuple_c2_s d12333 1 a12333 1 #define LIBCRUX_ML_KEM_KEY_PAIR_PRNG_LEN 64U @